Multiple Closed-Form Local Metric Learning for K-Nearest Neighbor Classifier

2013/11/12 by Jianbo Ye, Ye, Jianbo
Computer Science · #Advanced Image and Video Retrieval Techniques #FOS: Computer and information sciences #Face and Expression Recognition #Machine Learning (cs.LG) #Text and Document Classification Technologies

paper · pdf · doi:10.48550/arxiv.1311.3157

openalex publication_date 2013/11/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Many researches have been devoted to learn a Mahalanobis distance metric, which can effectively improve the performance of kNN classification. Most approaches are iterative and computational expensive and linear rigidity still critically limits metric learning algorithm to perform better. We proposed a computational economical framework to learn multiple metrics in closed-form.

Related

• Local Distance Metric Learning for Nearest Neighbor Algorithm
• Reduced-Rank Local Distance Metric Learning for k-NN Classification
• Adaptive Nearest Neighbor: A General Framework for Distance Metric Learning
• Metric Embedding for Nearest Neighbor Classification
• metricDTW: local distance metric learning in Dynamic Time Warping