Large Scale Local Online Similarity/distance Learning Framework Based On Passive/aggressive

Abstract

Similarity/Distance measures play a key role in many machine learning, pattern recognition, and data mining algorithms, which leads to the emergence of metric learning field. Many metric learning algorithms learn a global distance function from data that satisfy the constraints of the problem. However, in many real-world datasets that the discrimination power of features varies in the different regions of input space, a global metric is often unable to capture the complexity of the task. To address this challenge, local metric learning methods are proposed that learn multiple metrics across the different regions of input space. Some advantages of these methods are high flexibility and the ability to learn a nonlinear mapping but typically achieves at the expense of higher time requirement and overfitting problem. To overcome these challenges, this research presents an online multiple metric learning framework. Each metric in the proposed framework is composed of a global and a local co

Stats

• citations1
• S2 citations—
• github stars0
• HF likes0
• heat score2.26
• arxiv keyhamdan2018large

Related papers

• Sparse Online Relative Similarity Learning (2021)2.26
• Similarity Function Tracking Using Pairwise Comparisons (2017)2.26
• Dynamic Metric Learning From Pairwise Comparisons (2016)3.58
• Nonstationary Distance Metric Learning (2016)0.00
• Low-rank Robust Online Distance/similarity Learning Based On The Rescaled Hinge Loss (2020)7.50
• Local Distance Metric Learning For Nearest Neighbor Algorithm (2018)0.00
• Local Similarity-aware Deep Feature Embedding (2016)0.00
• Metric Learning By Similarity Network For Deep Semi-supervised Learning (2020)3.58