Learning k for kNN Classification

Guangxi Normal University · Chinese Academy of Sciences

Indexed incrossref

Abstract

The K Nearest Neighbor (kNN) method has widely been used in the applications of data mining and machine learning due to its simple implementation and distinguished performance. However, setting all test data with the same k value in the previous kNN methods has been proven to make these methods impractical in real applications. This article proposes to learn a correlation matrix to reconstruct test data points by training data to assign different k values to different test data points, referred to as the Correlation Matrix kNN (CM-kNN for short) classification. Specifically, the least-squares loss function is employed to minimize the reconstruction error to reconstruct each test data point by all training data…

Citation impact

559
total citations
FWCI
12.66
Percentile
100%
References
57
Citations per year

Authors

5

Topics & keywords

Keywords
  • Computer science
  • Pattern recognition (psychology)
  • Artificial intelligence
  • Imputation (statistics)
  • Test data
  • Data mining
  • Data point
  • k-nearest neighbors algorithm
No related works found for this paper.

Funding