A New Nearest Centroid Neighbor Classifier Based on K Local Means Using Harmonic Mean Distance

• Main Authors: Sumet Mehta, Xiangjun Shen, Jiangping Gou, Dejiao Niu
• Format: Article
• Language: English
• Published: MDPI AG 2018-09-01
• Series: Information
• Subjects: K-nearest neighbor; nearest centroid neighbor; local centroid mean vector; harmonic mean distance; pattern classification
• Online Access: http://www.mdpi.com/2078-2489/9/9/234

The K-nearest neighbour classifier is very effective and simple non-parametric technique in pattern classification; however, it only considers the distance closeness, but not the geometricalplacement of the k neighbors. Also, its classification performance is highly influenced by the neighborhood size k and existing outliers. In this paper, we propose a new local mean based k-harmonic nearest centroid neighbor (LMKHNCN) classifier in orderto consider both distance-based proximity, as well as spatial distribution of k neighbors. In our method, firstly the k nearest centroid neighbors in each class are found which are used to find k different local mean vectors, and then employed to compute their harmonic mean distance to the query sample. Lastly, the query sample is assigned to the class with minimum harmonic mean distance. The experimental results based on twenty-six real-world datasets shows that the proposed LMKHNCN classifier achieves lower error rates, particularly in small sample-size situations, and that it is less sensitive to parameter k when compared to therelated four KNN-based classifiers.