Abstract
In this paper, we address the semisupervised distance metric learning problem and its applications in classification and image retrieval. First, we formulate a semisupervised distance metric learning model by considering the metric information of inner classes and interclasses. In this model, an adaptive parameter is designed to balance the inner metrics and intermetrics by using data structure. Second, we convert the model to a minimization problem whose variable is symmetric positive-definite matrix. Third, in implementation, we deduce an intrinsic steepest descent method, which assures that the metric matrix is strictly symmetric positive-definite at each iteration, with the manifold structure of the symmetric positive-definite matrix manifold. Finally, we test the proposed algorithm on conventional data sets, and compare it with other four representative methods. The numerical results validate that the proposed method significantly improves the classification with the same computational efficiency.
| Original language | English |
|---|---|
| Pages (from-to) | 2731-2742 |
| Number of pages | 12 |
| Journal | IEEE Transactions on Neural Networks and Learning Systems |
| Volume | 29 |
| Issue number | 7 |
| DOIs | |
| State | Published - Jul 2018 |
| Externally published | Yes |
Keywords
- Classification
- distance metric learning
- intrinsic algorithm
- matrix manifold
- semisupervised learning
Fingerprint
Dive into the research topics of 'Manifold preserving: An intrinsic approach for semisupervised distance metric learning'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver