Co-metric: A metric learning algorithm for data with multiple views

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We address the problem of metric learning for multi-view data. Many metric learning algorithms have been proposed, most of them focus just on single view circumstances, and only a few deal with multi-view data. In this paper, motivated by the co-training framework, we propose an algorithm-independent framework, named co-metric, to learn Mahalanobis metrics in multi-view settings. In its implementation, an off-the-shelf single-view metric learning algorithm is used to learn metrics in individual views of a few labeled examples. Then the most confidently-labeled examples chosen from the unlabeled set are used to guide the metric learning in the next loop. This procedure is repeated until some stop criteria are met. The framework can accommodate most existing metric learning algorithms whether types-of-side-information or example-labels are used. In addition it can naturally deal with semi-supervised circumstances under more than two views. Our comparative experiments demonstrate its competiveness and effectiveness. © 2013 Higher Education Press and Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Qian, Q., & Chen, S. (2013). Co-metric: A metric learning algorithm for data with multiple views. Frontiers of Computer Science, 7(3), 359–369. https://doi.org/10.1007/s11704-013-2110-x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free