Natural neighborhood graph-based instance reduction algorithm without parameters

2018 ◽  
Vol 70 ◽  
pp. 279-287 ◽  
Author(s):  
Lijun Yang ◽  
Qingsheng Zhu ◽  
Jinlong Huang ◽  
Dongdong Cheng ◽  
Quanwang Wu ◽  
...  
Author(s):  
Lijun Yang ◽  
Qingsheng Zhu ◽  
Jinlong Huang ◽  
Dongdong Cheng ◽  
Cheng Zhang

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.


2014 ◽  
Vol 145 ◽  
pp. 477-487 ◽  
Author(s):  
Javad Hamidzadeh ◽  
Reza Monsefi ◽  
Hadi Sadoghi Yazdi

2015 ◽  
Vol 48 (5) ◽  
pp. 1878-1889 ◽  
Author(s):  
Javad Hamidzadeh ◽  
Reza Monsefi ◽  
Hadi Sadoghi Yazdi

Author(s):  
Shuo Feng ◽  
Haiying Chu ◽  
Xuyang Wang ◽  
Yuanka Liang ◽  
Xianwei Shi ◽  
...  

2014 ◽  
Vol 35 (8) ◽  
pp. 1940-1945 ◽  
Author(s):  
Xiang-hui Liu ◽  
Wen-bao Han ◽  
Jian-xiao Quan

Sign in / Sign up

Export Citation Format

Share Document