Large-Margin Metric Learning for Constrained Partitioning Problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Large-Margin Metric Learning for Constrained Partitioning Problems


We consider unsupervised partitioning problems based explicitly or implicitly on the minimization of Euclidean distortions, such as clustering, image or video segmentation, and other change-point detection problems. We emphasize on cases with specific structure, which include many practical situations ranging from meanbasedchange-point detection to image segmentation problems. We aim at learning a Mahalanobis metric for these unsupervised problems, leading to feature weighting and/or selection. This is done in a supervised way by assuming the availability of several (partially) labeled datasets that share the same metric. We cast the metric learning problem as a large-margin structured prediction problem, with proper definition of regularizers and losses, leading to a convex optimization problem which can be solved efficiently. Our experiments show how learning the metric can significantlyimprove performance on bioinformatics, video or image segmentation problems.
Fichier principal
Vignette du fichier
VersionHAL.pdf (366.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00796921 , version 1 (05-03-2013)



Rémi Lajugie, Sylvain Arlot, Francis Bach. Large-Margin Metric Learning for Constrained Partitioning Problems. Proceedings of The 31st International Conference on Machine Learning, Jun 2014, Beijing, China. ⟨hal-00796921⟩
519 View
278 Download



Gmail Facebook Twitter LinkedIn More