Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
A Centroid k-Nearest Neighbor Method
verfasst von : Qingjiu Zhang, Shiliang Sun
Erschienen in: Advanced Data Mining and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.