KNN Classification With One-step Computation

Abstract

KNN classification is an improvisational learning mode, in which they are carried out only when a test data is predicted that set a suitable K value and search the K nearest neighbors from the whole training sample space, referred them to the lazy part of KNN classification. This lazy part has been the bottleneck problem of applying KNN classification due to the complete search of K nearest neighbors. In this paper, a one-step computation is proposed to replace the lazy part of KNN classification. The one-step computation actually transforms the lazy part to a matrix computation as follows. Given a test data, training samples are first applied to fit the test data with the least squares loss function. And then, a relationship matrix is generated by weighting all training samples according to their influence on the test data. Finally, a group lasso is employed to perform sparse learning of the relationship matrix. In this way, setting K value and searching K nearest neighbors are both i

Stats

• citations59
• S2 citations—
• github stars0
• HF likes0
• heat score13.34
• arxiv keyzhang2020knn

Related papers

• A Fast And Easy Regression Technique For K-nn Classification Without Using Negative Pairs (2018)0.00
• Minimax Rate Optimal Adaptive Nearest Neighbor Classification And Regression (2019)8.35
• A New Hashing Based Nearest Neighbors Selection Technique For Big Datasets (2020)3.58
• Approximate Knn Classification For Biomedical Data (2020)8.35
• Adaptive Nearest Neighbor: A General Framework For Distance Metric Learning (2019)0.00
• Knet: A Deep Knn Network To Handle Label Noise (2021)0.00
• A Two-stage Active Learning Algorithm For \(k\)-nearest Neighbors (2022)0.00
• An Adaptive Nearest Neighbor Rule For Classification (2019)0.00