6533b821fe1ef96bd127ad1c
RESEARCH PRODUCT
About Combining Metric Learning and Prototype Generation
Jesús V. AlbertMiguel Arevalillo-herráezAdrian Perez-suayFrancesc J. Ferrisubject
Set (abstract data type)Matrix (mathematics)Mathematical optimizationOptimization problemmedia_common.quotation_subjectMetric (mathematics)Convex optimizationQuality (business)Equivalence of metricsMathematicsMetric k-centermedia_commondescription
Distance metric learning has been a major research topic in recent times. Usually, the problem is formulated as finding a Mahalanobis-like metric matrix that satisfies a set of constraints as much as possible. Different ways to introduce these constraints and to effectively formulate and solve the optimization problem have been proposed. In this work, we start with one of these formulations that leads to a convex optimization problem and generalize it in order to increase the efficiency by appropriately selecting the set of constraints. Moreover, the original criterion is expressed in terms of a reduced set of representatives that is learnt together with the metric. This leads to further improvements not only in efficiency but also in the quality of the obtained metrics.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2014-01-01 |