A K-Nearest Centroid Neighbor with atention Classifier

Among classic algorithms of data mining, the K-nearest neighbor based methods are simple and effective pattern classification algorithms. However, most KNN-based methods do not fully take into account the impact of different training sample points on classification, lead to inaccurate classification. To address this issue, we propose a scheme named Attention-based local mean K-Nearest Centroid Neighbor Classifier (ALMKNCN), combining nearest centroid neighbor with attention mechanism, the influence of each training sample on the query sample is fully considered. Given the query pattern, we first calculate the local centroid mean vector for each class, and then use the idea of attention mechanism to calculate the weight of pseudo-distance between each class and test sample. Finally, based on attention coefficient, the distances between the query sample and local mean vectors are weighted to determine the class of the query sample. Extensive experiments on UCI and KEEL data sets are carried out by comparing ALMKNCN to the state-of-art KNN-based methods. The experimental results demonstrate that the proposed ALMKNCN outperforms the related competitive KNN-based methods with more effectiveness.