A Prototype Selection Algorithm Using Fuzzy k-Important Nearest Neighbor Method
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.
Keywordsk-nearest neighbor (KNN) Prototype selection (PS) Fuzzy k-important nearest neighbor (FKINN)
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).
- 5.Amal MA, Riadh BA (2011) Survey of nearest neighbor condensing techniques. (IJACSA) Int J Adv Comput Sci Appl 2(11)Google Scholar
- 9.Keller J, Gray MR, Givens JA (1985) A fuzzy k-nearest neighbor algorithm. IEEE Trans Systems Man Cybern SMC-15(4):406–410Google Scholar
- 10.Blake CL, Merz CJ (1998) UCI repository of machine learning database. Department of Information and Computer Science, University of California, IrvineGoogle Scholar