Closed-Form Training of Mahalanobis Distance for Supervised Clustering

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn 2016-December, Issue , 2016, Pages 3909-3917

  Law, Marc T ^a   Yu, Yaoliang ^b   Cord, Matthieu ^a   Xing, Eric P ^b  

^a SORBONNE UNIVERSITÉ   (France)

^b Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER VISION; PATTERN RECOGNITION;

MAHALANOBIS DISTANCES; MULTIVARIATE LINEAR REGRESSIONS; ORDERS OF MAGNITUDE; SIMILARITY METRICS; STATE-OF-THE-ART PERFORMANCE; STRUCTURED PREDICTION; SUPERVISED CLUSTERING; TRAINING DATASET;

CLUSTERING ALGORITHMS;

EID: 84986268595     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2016.424     Document Type: Conference Paper

References (37)

1. F. Bach and M. Jordan. Learning spectral clustering. NIPS, 16:305-312, 2004.
2. A. Banerjee, S. Merugu, I. S. Dhillon, and J. Ghosh. Clustering with bregman divergences. Journal of Machine Learning Research, 6:1705-1749, 2005.
3. A. Bar-Hillel, T. Hertz, N. Shental, and D.Weinshall. Learning a Mahalanobis metric from equivalence constraints. Journal of Machine Learning Research, 6(6):937-965, 2005.
4. D. P. Bertsekas. Convex Optimization Algorithms. Athena Scientific, 2015.
5. C. M. Bishop. Pattern recognition and machine learning. springer, 2006.
6. E. Borenstein and S. Ullman. Learning to segment. In ECCV, pages 315-328. Springer, 2004.
7. A. B. Chan and N. Vasconcelos. Modeling, clustering, and segmenting video with mixtures of dynamic textures. IEEE Transactions on Pattern Analysis and Machine Intelligence, 30(5):909-926, 2008.
8. T. Cour, S. Yu, and J. Shi. Normalized cut segmentation code. copyright 2004 university of pennsylvania. Computer and Information Science Department, 2004.
9. J. V. Davis, B. Kulis, P. Jain, S. Sra, and I. S. Dhillon. Information-theoretic metric learning. In ICML, pages 209-216. ACM, 2007.
10. K. Fan. On a theorem of weyl concerning eigenvalues of linear transformations i. Proceedings of the National Academy of Sciences of the United States of America, 35(11):652, 1949.
11. T. Finley and T. Joachims. Supervised clustering with support vector machines. In ICML, pages 217-224. ACM, 2005.
12. D. Garreau, R. Lajugie, S. Arlot, and F. Bach. Metric learning for temporal sequence alignment. In NIPS, 2014.
13. L. Hubert and P. Arabie. Comparing partitions. Journal of classification, 2(1):193-218, 1985.
14. A. Joulin, F. Bach, and J. Ponce. Multi-class cosegmentation. In CVPR, pages 542-549. IEEE, 2012.
15. D. Kedem, S. Tyree, F. Sha, G. R. Lanckriet, and K. Q.Weinberger. Non-linear metric learning. In NIPS, pages 2573-2581, 2012.
16. M. Kostinger, M. Hirzer, P. Wohlhart, P. M. Roth, and H. Bischof. Large scale metric learning from equivalence constraints. In CVPR, pages 2288-2295. IEEE, 2012.
17. R. Lajugie, F. Bach, and S. Arlot. Large-margin metric learning for constrained partitioning problems. In ICML, pages 297-305, 2014.
18. M. T. Law, N. Thome, and M. Cord. Quadruplet-wise image similarity learning. In ICCV, pages 249-256, 2013.
19. M. T. Law, N. Thome, and M. Cord. Fantope regularization in metric learning. In CVPR, pages 1051-1058. IEEE, 2014.
20. J. Leskovec, A. Rajaraman, and J. D. Ullman. Mining of massive datasets. Cambridge University Press, 2014.
21. S. Liao, Y. Hu, X. Zhu, and S. Z. Li. Person re-identification by local maximal occurrence representation and metric learning. In CVPR, pages 2197-2206, 2015.
22. S. P. Lloyd. Least square quantization in PCM. Technical report, 1957. Bell Telephone Laboratories Paper.
23. D. G. Lowe. Distinctive image features from scaleinvariant keypoints. International journal of computer vision, 60(2):91-110, 2004.
24. A. Mignon and F. Jurie. Pcca: A new approach for distance learning from sparse pairwise constraints. In CVPR, 2012.
25. A. Mumtaz, E. Coviello, G. R. Lanckriet, and A. B. Chan. Clustering dynamic textures with the hierarchical em algorithm for modeling video. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 35(7):1606-1621, 2013.
26. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. NIPS, 2:849-856, 2002.
27. M.-E. Nilsback and A. Zisserman. A visual vocabulary for flower classification. In CVPR, volume 2, pages 1447-1454, 2006.
28. M. L. Overton and R. S. Womersley. Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices. Mathematical Programming, 62(1-3):321-357, 1993.
29. J. Peng and Y. Wei. Approximating k-means-type clustering via semidefinite programming. SIAM journal on optimization, 18:186-205, 2007.
30. S. Shalev-Shwartz, Y. Singer, N. Srebro, and A. Cotter. Pegasos: Primal estimated sub-gradient solver for svm. Mathematical programming, 127(1):3-30, 2011.
31. J. Shi and J. Malik. Normalized cuts and image segmentation. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 22(8):888-905, 2000.
32. D. Teney, M. Brown, D. Kit, and P. Hall. Learning Similarity Metrics for Dynamic Scene Segmentation. In CVPR, 2015.
33. S. Trivedi, D. Mcallester, and G. Shakhnarovich. Discriminative metric learning by neighborhood gerrymandering. In NIPS, pages 3392-3400, 2014.
34. R. Unnikrishnan, C. Pantofaru, and M. Hebert. Toward objective evaluation of image segmentation algorithms. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 29(6):929-944, 2007.
35. K. Q. Weinberger and L. K. Saul. Distance metric learning for large margin nearest neighbor classification. Journal of Machine Learning Research, 10:207-244, 2009.
36. E. P. Xing, M. I. Jordan, S. Russell, and A. Y. Ng. Distance metric learning with application to clustering with side-information. In NIPS, pages 505-512, 2002.
37. Y.-L. Yu and D. Schuurmans. Rank/norm regularization with closed-form solutions: Application to subspace clustering. In Uncertainty in Artificial Intelligence (UAI), 2011.