Author
Listed:
- Lijun Yang
(Chongqing University, Chongqing, China)
- Qingsheng Zhu
(Chongqing University, Chongqing, China)
- Jinlong Huang
(Chongqing University, Chongqing, China)
- Dongdong Cheng
(Chongqing University, Chongqing, China)
- Cheng Zhang
(Chongqing University, Chongqing, China)
Abstract
Instance reduction is aimed at reducing prohibitive computational costs and the storage space for instance-based learning. The most frequently used methods include the condensation and edition approaches. Condensation method removes the patterns far from the decision boundary and do not contribute to better classification accuracy, while edition method removes noisy patterns to improve the classification accuracy. In this paper, a new hybrid algorithm called instance reduction algorithm based on natural neighbor and nearest enemy is presented. At first, an edition algorithm is proposed to filter noisy patterns and smooth the class boundaries by using natural neighbor. The main advantage of the algorithm is that it does not require any user-defined parameters. Then, using a new condensation method based on nearest enemy to reduce instances far from decision line. Through this algorithm, interior instances are discarded. Experiments show that the hybrid approach effectively reduces the number of instances while achieves higher classification accuracy along with competitive algorithms.
Suggested Citation
Lijun Yang & Qingsheng Zhu & Jinlong Huang & Dongdong Cheng & Cheng Zhang, 2016.
"Natural Neighbor Reduction Algorithm for Instance-based Learning,"
International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), IGI Global, vol. 10(4), pages 59-73, October.
Handle:
RePEc:igg:jcini0:v:10:y:2016:i:4:p:59-73
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jcini0:v:10:y:2016:i:4:p:59-73. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.