Distance metric learning by minimal distance maximization
From MaRDI portal
Publication:622006
DOI10.1016/J.PATCOG.2010.09.019zbMATH Open1209.68497OpenAlexW2070519498MaRDI QIDQ622006FDOQ622006
Authors: Yaoliang Yu, Jiayan Jiang, Liming 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
Recommendations
convex optimizationmetric learninglinear dimensionality reduction (LDR)minimal distance maximization
Cites Work
- CSDP, A C library for semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Principal component analysis.
- Title not available (Why is that?)
- Dimensionality reduction of multimodal labeled data by local Fisher discriminant analysis
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Robust L1 Principal Component Analysis and Its Bayesian Variational Inference
Cited In (9)
- Unsupervised representation learning with minimax distance measures
- Learning Theory and Kernel Machines
- Semi-supervised metric learning via topology preserving multiple semi-supervised assumptions
- Maximal margin classification for metric spaces
- Maxi-Min discriminant analysis via online learning
- Lp- and Ls-norm distance based robust linear discriminant analysis
- Metric Learning
- Metric Learning via Cross-Validation
- Local discriminative distance metrics ensemble learning
Uses Software
This page was built for publication: Distance metric learning by minimal distance maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622006)
