Advertisement
Published in:
2010 | OriginalPaper | Chapter
A Centroid k-Nearest Neighbor Method
Authors : Qingjiu Zhang, Shiliang Sun
Published in: Advanced Data Mining and Applications
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
k
-nearest neighbor method (
k
NN) is a very useful and easy-implementing method for real applications. The query point is estimated by its
k
nearest neighbors. However, this kind of prediction simply uses the label information of its neighbors without considering their space distributions. This paper proposes a novel
k
NN method in which the centroids instead of the neighbors themselves are employed. The centroids can reflect not only the label information but also the distribution information of its neighbors. In order to evaluate the proposed method, Euclidean distance and Mahalanobis distance is used in our experiments. Moreover, traditional
k
NN is also implemented to provide a comparison with the proposed method. The empirical results suggest that the propose method is more robust and effective.