A Fast And Easy Regression Technique For K-nn Classification Without Using Negative Pairs

Abstract

This paper proposes an inexpensive way to learn an effective dissimilarity function to be used for \(k\)-nearest neighbor (\(k\)-NN) classification. Unlike Mahalanobis metric learning methods that map both query (unlabeled) objects and labeled objects to new coordinates by a single transformation, our method learns a transformation of labeled objects to new points in the feature space whereas query objects are kept in their original coordinates. This method has several advantages over existing distance metric learning methods: (i) In experiments with large document and image datasets, it achieves \(k\)-NN classification accuracy better than or at least comparable to the state-of-the-art metric learning methods. (ii) The transformation can be learned efficiently by solving a standard ridge regression problem. For document and image datasets, training is often more than two orders of magnitude faster than the fastest metric learning methods tested. This speed-up is also due to the fact t

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyshigeto2018a

Related papers

• Adaptive Nearest Neighbor: A General Framework For Distance Metric Learning (2019)0.00
• Minimax Rate Optimal Adaptive Nearest Neighbor Classification And Regression (2019)8.35
• On Convergence Of Nearest Neighbor Classifiers Over Feature Transformations (2020)0.00
• KNN Classification With One-step Computation (2020)13.34
• Local Distance Metric Learning For Nearest Neighbor Algorithm (2018)0.00
• Minimax Optimal Algorithms With Fixed-\(k\)-nearest Neighbors (2022)0.00
• Distributionally Robust Weighted \(k\)-nearest Neighbors (2020)0.00
• Distance And Similarity Measures Effect On The Performance Of K-nearest Neighbor Classifier -- A Review (2017)20.24