Metric Learning

DOI10.2200/S00626ED1V01Y201501AIM030zbMath1308.68005MaRDI QIDQ5175665

Aurélien Bellet, Marc Sebban, Amaury Habrard

Publication date: 24 February 2015

Published in: Synthesis Lectures on Artificial Intelligence and Machine Learning (Search for Journal in Brave)

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (15)

Multidimensional scaling of noisy high dimensional data ⋮ PCA-KL: a parametric dimensionality reduction approach for unsupervised metric learning ⋮ Alternating Mahalanobis Distance Minimization for Accurate and Well-Conditioned CP Decomposition ⋮ Self-supervised Metric Learning in Multi-View Data: A Downstream Task Perspective ⋮ Counts-of-counts similarity for prediction and search in relational data ⋮ Information-Theoretic Semi-Supervised Metric Learning via Entropy Regularization ⋮ Fast generalization rates for distance metric learning. Improved theoretical analysis for smooth strongly convex distance metric learning ⋮ Robust pairwise learning with Huber loss ⋮ Hyperlink regression via Bregman divergence ⋮ Manifold learning with arbitrary norms ⋮ Ground metric learning on graphs ⋮ Supervised distance metric learning through maximization of the Jeffrey divergence ⋮ Boosted sparse nonlinear distance metric learning ⋮ Social media as author-audience games ⋮ Uniform consistency and uniform in number of neighbors consistency for nonparametric regression estimates and conditional \(U\)-statistics involving functional data

This page was built for publication: Metric Learning