nips nips2011 nips2011-171 nips2011-171-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Jun Wang, Huyen T. Do, Adam Woznica, Alexandros Kalousis
Abstract: Metric learning has become a very active research field. The most popular representative–Mahalanobis metric learning–can be seen as learning a linear transformation and then computing the Euclidean metric in the transformed space. Since a linear transformation might not always be appropriate for a given learning problem, kernelized versions of various metric learning algorithms exist. However, the problem then becomes finding the appropriate kernel function. Multiple kernel learning addresses this limitation by learning a linear combination of a number of predefined kernels; this approach can be also readily used in the context of multiple-source learning to fuse different data sources. Surprisingly, and despite the extensive work on multiple kernel learning for SVMs, there has been no work in the area of metric learning with multiple kernel learning. In this paper we fill this gap and present a general approach for metric learning with multiple kernel learning. Our approach can be instantiated with different metric learning algorithms provided that they satisfy some constraints. Experimental evidence suggests that our approach outperforms metric learning with an unweighted kernel combination and metric learning with cross-validation based kernel selection. 1
[1] S.P. Boyd and L. Vandenberghe. Convex optimization. Cambridge Univ Pr, 2004.
[2] J. Dattorro. Convex optimization & Euclidean distance geometry. Meboo Publishing USA, 2005.
[3] J.V. Davis, B. Kulis, P. Jain, S. Sra, and I.S. Dhillon. Information-theoretic metric learning. In ICML, 2007.
[4] K. Gai, G. Chen, and C. Zhang. Learning kernels with radiuses of minimum enclosing balls. NIPS, 2010.
[5] A. Globerson and S. Roweis. Metric learning by collapsing classes. In NIPS, 2006.
[6] L. Grippo and M. Sciandrone. On the convergence of the block nonlinear gauss-seidel method under convex constraints* 1. Operations Research Letters, 26(3):127–136, 2000.
[7] M. Guillaumin, J. Verbeek, and C. Schmid. Is that you? Metric learning approaches for face identification. In ICCV, pages 498–505, 2009.
[8] K. Huang, Y. Ying, and C. Campbell. Gsml: A unified framework for sparse metric learning. In Data Mining, 2009. ICDM’09. Ninth IEEE International Conference on, pages 189–198. IEEE, 2009.
[9] P. Jain, B. Kulis, and I. Dhillon. Inductive regularized learning of kernel functions. NIPS, 2010.
[10] G.R.G. Lanckriet, N. Cristianini, P. Bartlett, L. El Ghaoui, and M.I. Jordan. Learning the Kernel Matrix with Semidefinite Programming. Journal of Machine Learning Research, 5:27– 72, 2004.
[11] B. McFee and G. Lanckriet. Partial order embedding with multiple kernels. In Proceedings of the 26th Annual International Conference on Machine Learning, pages 721–728. ACM, 2009.
[12] B. McFee and G. Lanckriet. Metric learning to rank. In ICML. ACM New York, NY, USA, 2010.
[13] B. McFee and G. Lanckriet. Learning multi-modal similarity. The Journal of Machine Learning Research, 12:491–523, 2011.
[14] N. Nguyen and Y. Guo. Metric Learning: A Support Vector Approach. In ECML/PKDD, 2008.
[15] M.E. Nilsback and A. Zisserman. A visual vocabulary for flower classification. In Computer Vision and Pattern Recognition, 2006 IEEE Computer Society Conference on, volume 2, pages 1447–1454. Ieee, 2006.
[16] M.E. Nilsback and A. Zisserman. Automated flower classification over a large number of classes. In Computer Vision, Graphics & Image Processing, 2008. ICVGIP’08. Sixth Indian Conference on, pages 722–729. IEEE, 2008.
[17] A. Rakotomamonjy, F. Bach, S. Canu, and Y. Grandvalet. SimpleMKL. Journal of Machine Learning Research, 9:2491–2521, 2008.
[18] M. Schultz and T. Joachims. Learning a distance metric from relative comparisons. In NIPS, 2003.
[19] S. Shalev-Shwartz, Y. Singer, and A.Y. Ng. Online and batch learning of pseudo-metrics. In Proceedings of the twenty-first international conference on Machine learning. ACM, 2004.
[20] S. Sonnenburg, G. Ratsch, and C. Schafer. A general and efficient multiple kernel learning algorithm. In NIPS, 2006.
[21] J.P. Vert, J. Qiu, and W. Noble. A new pairwise kernel for biological network inference with support vector machines. BMC bioinformatics, 8(Suppl 10):S8, 2007.
[22] K.Q. Weinberger and L.K. Saul. Distance metric learning for large margin nearest neighbor classification. The Journal of Machine Learning Research, 10:207–244, 2009.
[23] E.P. Xing, A.Y. Ng, M.I. Jordan, and S. Russell. Distance metric learning with application to clustering with side-information. In NIPS, 2003. 9