Abstract
The k-Nearest Neighbor (KNN) algorithm is widely used as a simple and effective classification algorithm. While its main advantage is its simplicity, its main shortcoming is its computational complexity for large training sets. A Prototype Selection (PS) method is used to optimize the efficiency of the algorithm so that the disadvantages can be overcome. This paper presents a new PS algorithm, namely Fuzzy k-Important Nearest Neighbor (FKINN) algorithm. In this algorithm, an important nearest neighbor selection rule is introduced. When classifying a data set with the FKINN algorithm, the most repeated selection sample is defined as an important nearest neighbor. To verify the performance of the algorithm, five UCI benchmarking databases are considered. Experiments show that the algorithm effectively deletes redundant or irrelevant prototypes while maintaining the same level of classification accuracy as that of the KNN algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Cover TM, Hart PE (1967) Nearest neighbor pattern classification. IEEE Trans Inf Theory 13:21–27
Wu Y, Ianakiev KG, Govindaraju V (2002) Improved K-nearest neighbor classification. Pattern Recogn 35(10):2311–2318
Sanchez JS, Barandela R, Marques AI, Alejo R (2003) Analysis of new techniques to obtain quality training sets. Pattern Recogn Lett 24(7):1015–1022
Garcia S, Derrac J, Cano JR, Herrera F (2012) Prototype selection for nearest neighbor classification: taxonomy and empirical study. IEEE Trans Pattern Anal Mach Intell 34(3):417–435
Amal MA, Riadh BA (2011) Survey of nearest neighbor condensing techniques. (IJACSA) Int J Adv Comput Sci Appl 2(11)
Chang CL (1974) Finding prototypes for nearest neighbor classifiers. IEEE Trans Comput 23(11):1179–1184
Cervantes A, Galvan IM, Isasi P (2009) AMPSO: a new particle swarm method for nearest neighborhood classification. IEEE Trans Syst Man Cybern Part B Cybern 39(5):1082–1091
Triguero I, Garca S, Herrera F (2010) IPADE: iterative prototype adjustment for nearest neighbor classification. IEEE Trans Neural Netw 21(12):1984–1990
Keller J, Gray MR, Givens JA (1985) A fuzzy k-nearest neighbor algorithm. IEEE Trans Systems Man Cybern SMC-15(4):406–410
Blake CL, Merz CJ (1998) UCI repository of machine learning database. Department of Information and Computer Science, University of California, Irvine
Fayed HA, Atiya AF (2009) A novel template reduction approach for the k-nearest neighbor method. IEEE Trans Neural Netw 20(5):890–896
Acknowledgments
This research was supported by the MKE (The Ministry of Knowledge Economy), Korea, under the Convergence-ITRC (Convergence Information Technology Research Center) support program (NIPA-2012-H0401-12-1001) supervised by the NIPA (National IT Industry Promotion Agency).
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (2012R1A1A2044134).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Zhang, ZX., Tian, XW., Lee, SH., Lim, J.S. (2013). A Prototype Selection Algorithm Using Fuzzy k-Important Nearest Neighbor Method. In: Kim, K., Chung, KY. (eds) IT Convergence and Security 2012. Lecture Notes in Electrical Engineering, vol 215. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-5860-5_120
Download citation
DOI: https://doi.org/10.1007/978-94-007-5860-5_120
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-5859-9
Online ISBN: 978-94-007-5860-5
eBook Packages: EngineeringEngineering (R0)