{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T22:24:16Z","timestamp":1782253456823,"version":"3.54.5"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,6,20]],"date-time":"2015-06-20T00:00:00Z","timestamp":1434758400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10994-015-5499-7","type":"journal-article","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T19:56:43Z","timestamp":1434743803000},"page":"115-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":70,"title":["Generalization bounds for metric and similarity learning"],"prefix":"10.1007","volume":"102","author":[{"given":"Qiong","family":"Cao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zheng-Chu","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yiming","family":"Ying","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"5499_CR1","first-page":"937","volume":"6","author":"A Bar-Hillel","year":"2005","unstructured":"Bar-Hillel, A., Hertz, T., Shental, N., & Weinshall, D. (2005). Learning a mahalanobis metric from equivalence constraints. Journal of Machine Learning Research, 6, 937\u2013965.","journal-title":"Journal of Machine Learning Research"},{"key":"5499_CR2","first-page":"463","volume":"3","author":"PL Bartlett","year":"2002","unstructured":"Bartlett, P. L., & Mendelson, S. (2002). Rademacher and Gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research, 3, 463\u2013482.","journal-title":"Journal of Machine Learning Research"},{"key":"5499_CR3","first-page":"499","volume":"2","author":"O Bousquet","year":"2002","unstructured":"Bousquet, O., & Elisseeff, A. (2002). Stability and generalization. Journal of Machine Learning Research, 2, 499\u2013526.","journal-title":"Journal of Machine Learning Research"},{"key":"5499_CR4","first-page":"1109","volume":"11","author":"G Chechik","year":"2010","unstructured":"Chechik, G., Sharma, V., Shalit, U., & Bengio, S. (2010). Large scale online learning of image similarity through ranking. Journal of Machine Learning Research, 11, 1109\u20131135.","journal-title":"Journal of Machine Learning Research"},{"key":"5499_CR5","first-page":"1143","volume":"5","author":"DR Chen","year":"2004","unstructured":"Chen, D. R., Wu, Q., Ying, Y., & Zhou, D. X. (2004). Support vector machine soft margin classifiers: Error analysis. Journal of Machine Learning Research, 5, 1143\u20131175.","journal-title":"Journal of Machine Learning Research"},{"key":"5499_CR6","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1214\/009052607000000910","volume":"36","author":"S Cl\u00e9mencon","year":"2008","unstructured":"Cl\u00e9mencon, S., Lugosi, G., & Vayatis, N. (2008). Ranking and empirical minimization of U-statistics. The Annals of Statistics, 36, 844\u2013874.","journal-title":"The Annals of Statistics"},{"key":"5499_CR7","doi-asserted-by":"crossref","unstructured":"Davis, J., Kulis, B., Jain, P., Sra, S., & Dhillon, I. (2007). Information-theoretic metric learning. In ICML.","DOI":"10.1145\/1273496.1273523"},{"key":"5499_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0537-1","volume-title":"Decoupling: From dependence to independence","author":"VH Pe\u00f1a De La","year":"1999","unstructured":"De La Pe\u00f1a, V. H., & Gin\u00e9, E. (1999). Decoupling: From dependence to independence. New York: Springer."},{"key":"5499_CR9","unstructured":"Globerson, A., & Roweis, S. (2005). Metric learning by collapsing classes. In NIPS."},{"key":"5499_CR10","unstructured":"Goldberger, J., Roweis, S., Hinton, G., & Salakhutdinov, R. (2004). Neighbourhood component analysis. In NIPS."},{"key":"5499_CR11","doi-asserted-by":"crossref","unstructured":"Guillaumin, M., Verbeek, J., & Schmid, C. (2009). Is that you? Metric learning approaches for face identification. In ICCV.","DOI":"10.1109\/ICCV.2009.5459197"},{"key":"5499_CR12","doi-asserted-by":"crossref","unstructured":"Hoi, S. C. H., Liu, W. , Lyu, M. R. , & Ma, W.-Y. (2006). Learning distance metrics with contextual constraints for image retrieval. In CVPR.","DOI":"10.1109\/CVPR.2006.167"},{"key":"5499_CR13","unstructured":"Jin, R., Wang, S., & Zhou, Y. (2009). Regularized distance metric learning: Theory and algorithm. In NIPS."},{"key":"5499_CR14","unstructured":"Kar, P., & Jain, P. (2011). Similarity-based learning via data-driven embeddings. In NIPS."},{"key":"5499_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aos\/1015362183","volume":"30","author":"V Koltchinskii","year":"2002","unstructured":"Koltchinskii, V., & Panchenko, V. (2002). Empirical margin distributions and bounding the generalization error of combined classifiers. The Annals of Statistics, 30, 1\u20135.","journal-title":"The Annals of Statistics"},{"key":"5499_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-20212-4","volume-title":"Probability in Banach spaces: Isoperimetry and processes","author":"M Ledoux","year":"1991","unstructured":"Ledoux, M., & Talagrand, M. (1991). Probability in Banach spaces: Isoperimetry and processes. New York: Springer Press."},{"key":"5499_CR17","first-page":"1049","volume":"9","author":"A Maurer","year":"2008","unstructured":"Maurer, A. (2008). Learning similarity with operator-valued large-margin classifiers. Journal of Machine Learning Research, 9, 1049\u20131082.","journal-title":"Journal of Machine Learning Research"},{"key":"5499_CR18","volume-title":"Surveys in combinatorics, chapter on the methods of bounded differences","author":"C McDiarmid","year":"1989","unstructured":"McDiarmid, C. (1989). Surveys in combinatorics, chapter on the methods of bounded differences. Cambridge, UK: Cambridge University Press."},{"key":"5499_CR19","first-page":"491","volume":"12","author":"B McFee","year":"2011","unstructured":"McFee, B., & Lanckriet, G. (2011). Learning multi-modal similarity. Journal of Machine Learning Research, 12, 491\u2013523.","journal-title":"Journal of Machine Learning Research"},{"key":"5499_CR20","doi-asserted-by":"crossref","unstructured":"Rosales, R., & Fung, G. (2006). Learning sparse metrics via linear programming. In KDD.","DOI":"10.1145\/1150402.1150444"},{"key":"5499_CR21","unstructured":"Shalit, O., Weinshall, D., & Chechik, G. (2010). Online learning in the manifold of low-rank matrices. In NIPS."},{"key":"5499_CR22","unstructured":"Shen, C., Kim, J., Wang, L., & Hengel, A. (2009). Positive semidefinite metric learning with boosting. In NIPS."},{"key":"5499_CR23","doi-asserted-by":"crossref","unstructured":"Weinberger, K. Q., & Saul, L. K. (2008). Fast solvers and efficient implementations for distance metric learning. In ICML.","DOI":"10.1145\/1390156.1390302"},{"key":"5499_CR24","unstructured":"Xing, E., Ng, A., Jordan, M., & Russell, S. (2002). Distance metric learning with application to clustering with side information. In NIPS."},{"key":"5499_CR25","unstructured":"Yang, L., & Jin, R. (2007). Distance metric learning: A comprehensive survey. Technical report, Department of Computer Science and Engineering, Michigan State University."},{"key":"5499_CR26","unstructured":"Ying, Y., & Campbell. (2009). Generalization bounds for learning the kernel. In COLT."},{"key":"5499_CR27","doi-asserted-by":"crossref","first-page":"2858","DOI":"10.1162\/NECO_a_00028","volume":"22","author":"Y Ying","year":"2010","unstructured":"Ying, Y., & Campbell, C. (2010). Rademacher chaos complexity for learning the kernel problem. Neural Computation, 22, 2858\u201386.","journal-title":"Neural Computation"},{"key":"5499_CR28","unstructured":"Ying, Y., Huang, K., & Campbell, C. (2009). Sparse metric learning via smooth optimization. In NIPS."},{"key":"5499_CR29","first-page":"1","volume":"13","author":"Y Ying","year":"2012","unstructured":"Ying, Y., & Li, P. (2012). Distance metric learning with eigenvalue optimization. Journal of Machine Learning Research, 13, 1\u201326.","journal-title":"Journal of Machine Learning Research"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-015-5499-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-015-5499-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-015-5499-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T10:32:39Z","timestamp":1652524359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-015-5499-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,20]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["5499"],"URL":"https:\/\/doi.org\/10.1007\/s10994-015-5499-7","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,20]]}}}