Distance metric learning by minimal distance maximization

DOI10.1016/j.patcog.2010.09.019zbMath1209.68497OpenAlexW2070519498MaRDI QIDQ622006

Jiayan Jiang, Yaoliang Yu, Li-Ming Zhang

Publication date: 31 January 2011

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2010.09.019

zbMATH Keywords

convex optimizationmetric learninglinear dimensionality reduction (LDR)minimal distance maximization

Mathematics Subject Classification ID

Convex programming (90C25) Pattern recognition, speech recognition (68T10)

Related Items (3)

Semi-supervised metric learning via topology preserving multiple semi-supervised assumptions ⋮ Maxi-Min discriminant analysis via online learning ⋮ Local discriminative distance metrics ensemble learning

Uses Software

• CSDP
• SeDuMi
• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Principal component analysis.
• CSDP, A C library for semidefinite programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Robust L1 Principal Component Analysis and Its Bayesian Variational Inference

This page was built for publication: Distance metric learning by minimal distance maximization