A Fast and Easy Regression Technique for k-NN Classification Without Using Negative Pairs (PAKDD2017) A Fast and Easy Regression Technique for k-NN Classification Without Using Negative Pairs (PAKDD2017)
classification, hubness phenomenon, k-nearest neighbor, metric learning
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 that the proposed method eliminates the optimization over “negative” object pairs, i.e., objects whose class labels are different. (iii) The formulation has a theoretical justification in terms of reducing hubness in data.
Yutaro Shigeto, Masashi Shimbo (Nara Institute of Science and Technology), and Yuji Matsumoto (Nara Institute of Science and Technology).
In: Kim J., Shim K., Cao L., Lee JG., Lin X., Moon YS. (eds), Advances in Knowledge Discovery and Data Mining, 21st Pacific-Asia Conference, PAKDD 2017, Proceedings Part1, Lecture Notes in Computer Science, Vol.10234, pp.17-29, Springer, Jeju, South Korea, May 24, 2017.
[ Springer | pdf | arXiv ]