Abstract:As a nonparametric classification algorithm, K-Nearest Neighbor (KNN) is very efficient and can be easily realized. However, the traditional KNN suggests that the contributions of all K nearest neighbors are equal, which makes it easy to be disturbed by noises. Meanwhile, for large data sets, the computational demands for classifying patterns using KNN can be prohibitive. In this paper, a new Template reduction KNN algorithm based on Weighted distance (TWKNN) is proposed. Firstly, the points that are far away from the classification boundary are dropped by the template reduction technique. Then, in the process of classification, the K nearest neighbors’ weights of the test sample are set according to the Euclidean distance metric, which can enhance the robustness of the algorithm. Experimental results show that the proposed approach effectively reduces the number of training samples while maintaining the same level of classification accuracy as the traditional KNN.
杨金福, 宋敏, 李明爱. 一种新的基于距离加权的模板约简K近邻算法[J]. 电子与信息学报, 2011, 33(10): 2378-2383.
Yang Jin-Fu, Song Min, Li Ming-Ai. A Novel Template Reduction K-Nearest Neighbor Classification Method Based on Weighted Distance. , 2011, 33(10): 2378-2383.