Computer Science ›› 2017, Vol. 44 ›› Issue (4): 241-245, 268.doi: 10.11896/j.issn.1002-137X.2017.04.051

Previous Articles     Next Articles

Prototype Selection Algorithm Based on Natural Neighbor and MST

ZHU Qing-sheng, DUAN Lang-jun and YANG Li-jun   

  • Online:2018-11-13 Published:2018-11-13

Abstract: K-nearest neighbor (KNN) is one of the most popular algorithms for supervised classification.However,the traditional KNN classification has two limitations that the option of parameter K and prohibitive computational and storage demand for large datasets.To overcome these limitations,a new prototype selection algorithm was proposed,which retains some key prototypes that make a large contribution to classification and removes the most of other prototypes with little contribution for classification.Differing from other prototype selection algorithms,the proposal uses a novel neighbor concept natural neighbor to preprocess the dataset and builds minimum spanning tree based on the speci-fic terminal conditions.According to the MST,the prototypes close to boundaries and some internal prototypes are preserved.Experimental results show that the proposed algorithm effectively reduces the number of prototypes while maintaining the same level of classification accuracy as the traditional KNN classification algorithm.Moreover,it is a little bit superior to other prototype selection algorithms in classification accuracy and retention ratio.

Key words: K-nearest neighbor,Prototype selection,Natural neighbor,Minimum spanning tree,Classification

[1] FAYED H,ATIYA A F.A Novel Template Reduction Approach for the-Nearest Neighbor Method[J].IEEE Transactions on Neural Networks,2009,20(5):890-896.
[2] LI J,WANG Y.A new fast reduction technique based on binary nearest neighbor tree[J].Neurocomputing,2015,149:1647-1657.
[3] OLVERA-LPEZ J A,CARRASCO-OCHOA J A,MARTNEZ-TRINIDAD J F.A new fast prototype selection method based on clustering[J].Pattern Analysis and Applications,2010,13(2):131-141.
[4] HART B P E.The condensed nearest neighbor rule[J].IEEE Trans Information Theory,1968,14:515-516.
[5] CHOU C H,KUO B H,CHANG F.The generalized condensed nearest neighbor rule as a data reduction method[C]∥18th International Conference on Pattern Recognition,2006(ICPR 2006).IEEE,2006:556-559.
[6] ANGIULLI F.Fast nearest neighbor condensation for large data sets classification[J].IEEE Transactions on Knowledge and Data Engineering,2007,19(11):1450-1464.
[7] WILSON D L.Asymptotic properties of nearest neighbor rules using edited data[J].IEEE Transactions on Systems Man and Cybernetics,1972,SMC-2(3):408-421.
[8] WILSON D R,MARTNEZ T R.Reduction techniques for instance-based learning algorithms[J].Mach Learn,2000,38(3):257-286
[9] ZOU X,ZHU Q,JIN Y.An adaptive neighborhood graph for LLE algorithm without free-parameter[J].International Journal of Computer Applications,2011,16(2):20-23.
[10] ZOU X L,ZHU Q S.Abnormal structure in regular data re-vealed by Isomap with natural nearest neighbor[M]∥Advances in Computer Science,Environment,Ecoinformatics,and Education.Springer Berlin Heidelberg,2011:538-544.
[11] ZHU Q S,ZHANG Y,LIU H J.Classification Algorithm Based on Natural Nearest Neighbor[J].Journal of Information and Computetional Science,2015,12(2):573-580.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75, 88 .
[2] XIA Qing-xun and ZHUANG Yi. Remote Attestation Mechanism Based on Locality Principle[J]. Computer Science, 2018, 45(4): 148 -151, 162 .
[3] LI Bai-shen, LI Ling-zhi, SUN Yong and ZHU Yan-qin. Intranet Defense Algorithm Based on Pseudo Boosting Decision Tree[J]. Computer Science, 2018, 45(4): 157 -162 .
[4] WANG Huan, ZHANG Yun-feng and ZHANG Yan. Rapid Decision Method for Repairing Sequence Based on CFDs[J]. Computer Science, 2018, 45(3): 311 -316 .
[5] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[6] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[7] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[8] LIU Qin. Study on Data Quality Based on Constraint in Computer Forensics[J]. Computer Science, 2018, 45(4): 169 -172 .
[9] ZHONG Fei and YANG Bin. License Plate Detection Based on Principal Component Analysis Network[J]. Computer Science, 2018, 45(3): 268 -273 .
[10] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99, 116 .