{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T17:46:30Z","timestamp":1777571190809,"version":"3.51.4"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,6,16]],"date-time":"2012-06-16T00:00:00Z","timestamp":1339804800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10994-012-5293-8","type":"journal-article","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T13:15:31Z","timestamp":1340025331000},"page":"5-35","source":"Crossref","is-referenced-by-count":23,"title":["Good edit similarity learning by loss minimization"],"prefix":"10.1007","volume":"89","author":[{"given":"Aur\u00e9lien","family":"Bellet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amaury","family":"Habrard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Sebban","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,16]]},"reference":[{"key":"5293_CR1","unstructured":"Bach, F., & Obozinski, G. (2010). Sparse methods for machine learning: theory and algorithms. ECML\/PKDD tutorial. http:\/\/www.di.ens.fr\/~fbac\/ecml2010tutorial ."},{"key":"5293_CR2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/1143844.1143854","volume-title":"Proceedings of the 23rd international conference on machine learning (ICML)","author":"M. F. Balcan","year":"2006","unstructured":"Balcan, M. F., & Blum, A. (2006). On a theory of learning with similarity functions. In Proceedings of the 23rd international conference on machine learning (ICML) (pp. 73\u201380)."},{"key":"5293_CR3","first-page":"287","volume-title":"Proceedings of the 21st annual conference on learning theory (COLT)","author":"M. F. Balcan","year":"2008","unstructured":"Balcan, M. F., Blum, A., & Srebro, N. (2008). Improved guarantees for learning via similarity functions. In Proceedings of the 21st annual conference on learning theory (COLT) (pp. 287\u2013298)."},{"issue":"6","key":"5293_CR4","doi-asserted-by":"crossref","first-page":"2330","DOI":"10.1016\/j.patcog.2009.12.008","volume":"43","author":"A. Bellet","year":"2010","unstructured":"Bellet, A., Bernard, M., Murgue, T., & Sebban, M. (2010). Learning state machine-based string edit kernels. Pattern Recognition, 43(6), 2330\u20132339.","journal-title":"Pattern Recognition"},{"key":"5293_CR5","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1109\/ICTAI.2011.27","volume-title":"Proceedings of the 23rd IEEE international conference on tools with artificial intelligence (ICTAI)","author":"A. Bellet","year":"2011","unstructured":"Bellet, A., Habrard, A., & Sebban, M. (2011a). An experimental study on learning with good edit similarity functions. In Proceedings of the 23rd IEEE international conference on tools with artificial intelligence (ICTAI) (pp. 126\u2013133)."},{"key":"5293_CR6","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/978-3-642-23780-5_22","volume-title":"Proceedings of the 22nd European conference on machine learning and principles and practice of knowledge discovery in databases (ECML\/PKDD)","author":"A. Bellet","year":"2011","unstructured":"Bellet, A., Habrard, A., & Sebban, M. (2011b). Learning good edit similarities with generalization guarantees. In LNCS: Vol. 6911. Proceedings of the 22nd European conference on machine learning and principles and practice of knowledge discovery in databases (ECML\/PKDD) (pp. 188\u2013203)."},{"issue":"8","key":"5293_CR7","doi-asserted-by":"crossref","first-page":"2611","DOI":"10.1016\/j.patcog.2008.01.011","volume":"41","author":"M. Bernard","year":"2008","unstructured":"Bernard, M., Boyer, L., Habrard, A., & Sebban, M. (2008). Learning probabilistic models of tree edit distance. Pattern Recognition, 41(8), 2611\u20132629.","journal-title":"Pattern Recognition"},{"key":"5293_CR8","first-page":"1186","volume-title":"Proceedings of the 22nd international joint conference on artificial intelligence (IJCAI)","author":"W. Bian","year":"2011","unstructured":"Bian, W., & Tao, D. (2011). Learning a distance metric by empirical loss minimization. In Proceedings of the 22nd international joint conference on artificial intelligence (IJCAI) (pp. 1186\u20131191)."},{"key":"5293_CR9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/956750.956759","volume-title":"Proceeding of the 9th ACM SIGKDD international conference on knowledge discovery and data mining (KDD)","author":"M. Bilenko","year":"2003","unstructured":"Bilenko, M., & Mooney, R. J. (2003). Adaptive duplicate detection using learnable string similarity measures. In Proceeding of the 9th ACM SIGKDD international conference on knowledge discovery and data mining (KDD) (pp. 39\u201348)."},{"issue":"1\u20133","key":"5293_CR10","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.tcs.2004.12.030","volume":"337","author":"P. Bille","year":"2005","unstructured":"Bille, P. (2005). A survey on tree edit distance and related problem. Theoretical Computer Science, 337(1\u20133), 217\u2013239.","journal-title":"Theoretical Computer Science"},{"key":"5293_CR11","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":"5293_CR12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/1273496.1273523","volume-title":"Proceedings of the 24th international conference on machine learning (ICML)","author":"J. V. Davis","year":"2007","unstructured":"Davis, J. V., Kulis, B., Jain, P., Sra, S., & Dhillon, I. S. (2007). Information-theoretic metric learning. In Proceedings of the 24th international conference on machine learning (ICML) (pp. 209\u2013216)."},{"issue":"1","key":"5293_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A. P. Dempster","year":"1977","unstructured":"Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B, 39(1), 1\u201338.","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"5293_CR14","series-title":"LNCS","first-page":"274","volume-title":"Proceedings of the 19th annual conference on learning theory (COLT)","author":"F. Denis","year":"2006","unstructured":"Denis, F., Esposito, Y., & Habrard, A. (2006). Learning rational stochastic languages. In LNCS: Vol. 4005. Proceedings of the 19th annual conference on learning theory (COLT) (pp. 274\u2013288). Berlin: Springer."},{"key":"5293_CR15","series-title":"LNCS","first-page":"57","volume-title":"Proceedings of the 9th international colloquium on grammatical inference (ICGI)","author":"F. Denis","year":"2008","unstructured":"Denis, F., Gilbert, E., Habrard, A., Ouardi, F., & Tommasi, M. (2008). Relevant representations for the inference of rational stochastic tree languages. In LNCS: Vol. 5278. Proceedings of the 9th international colloquium on grammatical inference (ICGI) (pp. 57\u201370). Berlin: Springer."},{"key":"5293_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1462153.1462154","volume":"56","author":"K. Etessami","year":"2009","unstructured":"Etessami, K., & Yannakakis, M. (2009). Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. Journal of the ACM, 56, 1.","journal-title":"Journal of the ACM"},{"key":"5293_CR17","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/356625.356627","volume":"6","author":"H. Freeman","year":"1974","unstructured":"Freeman, H. (1974). Computer processing of line-drawing images. ACM Computing Surveys, 6, 57\u201397.","journal-title":"ACM Computing Surveys"},{"key":"5293_CR18","first-page":"10,915","volume-title":"Proc. of the national academy of sciences of the United States of America, Vol.\u00a089","author":"S. Henikoff","year":"1992","unstructured":"Henikoff, S., & Henikoff, J. G. (1992). Amino acid substitution matrices from protein blocks. In Proc. of the national academy of sciences of the United States of America, Vol.\u00a089 (pp. 10,915\u201310,919)."},{"key":"5293_CR19","first-page":"862","volume-title":"Advances in neural information processing systems (NIPS)","author":"R. Jin","year":"2009","unstructured":"Jin, R., Wang, S., & Zhou, Y. (2009). Regularized distance metric learning: theory and algorithm. In Advances in neural information processing systems (NIPS) (pp. 862\u2013870)."},{"key":"5293_CR20","series-title":"LNCS","first-page":"91","volume-title":"Proceedings of the 6th European symposium on algorithms (ESA)","author":"P. Klein","year":"1998","unstructured":"Klein, P. (1998). Computing the edit-distance between unrooted ordered trees. In LNCS: Vol. 1461. Proceedings of the 6th European symposium on algorithms (ESA) (pp. 91\u2013102). Berlin: Springer."},{"key":"5293_CR21","first-page":"707","volume":"6","author":"V. I. Levenshtein","year":"1966","unstructured":"Levenshtein, V. I. (1966). Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics-Doklandy, 6, 707\u2013710.","journal-title":"Soviet Physics-Doklandy"},{"key":"5293_CR22","first-page":"388","volume-title":"Proceedings of 21st conference in uncertainty in artificial Intelligence (UAI)","author":"A. McCallum","year":"2005","unstructured":"McCallum, A., Bellare, K., & Pereira, F. (2005). A conditional random field for discriminatively-trained finite-state string edit distance. In Proceedings of 21st conference in uncertainty in artificial Intelligence (UAI) (pp. 388\u2013395)."},{"key":"5293_CR23","first-page":"148","volume-title":"Surveys in combinatorics","author":"C. McDiarmid","year":"1989","unstructured":"McDiarmid, C. (1989). On the method of bounded differences. In Surveys in combinatorics (pp. 148\u2013188). Cambridge: Cambridge University Press."},{"key":"5293_CR24","first-page":"289","volume-title":"Proceedings of the 47th annual meeting of the association for computational linguistics and the 4th international joint conference on natural language processing of the AFNLP (ACL-IJCNLP)","author":"Y. Mehdad","year":"2009","unstructured":"Mehdad, Y. (2009). Automatic cost estimation for tree edit distance using particle swarm optimization. In Proceedings of the 47th annual meeting of the association for computational linguistics and the 4th international joint conference on natural language processing of the AFNLP (ACL-IJCNLP) (pp. 289\u2013292)."},{"key":"5293_CR25","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/ICPR.2004.1334548","volume-title":"Proceedings of the 17th international conference on pattern recognition (ICPR)","author":"M. Neuhaus","year":"2004","unstructured":"Neuhaus, M., & Bunke, H. (2004). A probabilistic approach to learning costs for graph edit distance. In Proceedings of the 17th international conference on pattern recognition (ICPR) (pp. 389\u2013393). New York: IEEE Press."},{"issue":"9","key":"5293_CR26","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.1016\/j.patcog.2006.03.011","volume":"39","author":"J. Oncina","year":"2006","unstructured":"Oncina, J., & Sebban, M. (2006). Learning stochastic edit distance: application in handwritten character recognition. Pattern Recognition, 39(9), 1575\u20131587.","journal-title":"Pattern Recognition"},{"issue":"5","key":"5293_CR27","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1109\/34.682181","volume":"20","author":"E. S. Ristad","year":"1998","unstructured":"Ristad, E. S., & Yianilos, P. N. (1998). Learning string-edit distance. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(5), 522\u2013532.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"5","key":"5293_CR28","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1162\/089976604773135104","volume":"16","author":"L. Rosasco","year":"2004","unstructured":"Rosasco, L., Vito, E. D., Caponnetto, A., Piana, M., & Verri, A. (2004). Are loss functions all the same? Neural Computation, 16(5), 1063\u20131076.","journal-title":"Neural Computation"},{"issue":"246","key":"5293_CR29","first-page":"1","volume":"7","author":"H. Saigo","year":"2006","unstructured":"Saigo, H., Vert, J. P., & Akutsu, T. (2006). Optimizing amino acid substitution matrices with a local alignment kernel. BMC Bioinformatics, 7(246), 1\u201312.","journal-title":"BMC Bioinformatics"},{"issue":"6","key":"5293_CR30","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","volume":"6","author":"S. Selkow","year":"1977","unstructured":"Selkow, S. (1977). The tree-to-tree editing problem. Information Processing Letters, 6(6), 184\u2013186.","journal-title":"Information Processing Letters"},{"key":"5293_CR31","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/ICDAR.2009.193","volume-title":"Proceedings of the 10th international conference on document analysis and recognition (ICDAR)","author":"A. Takasu","year":"2009","unstructured":"Takasu, A. (2009). Bayesian similarity model estimation for approximate recognized text search. In Proceedings of the 10th international conference on document analysis and recognition (ICDAR) (pp. 611\u2013615)."},{"key":"5293_CR32","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1145\/1273496.1273621","volume-title":"Proceedings of the 24th international conference on machine learning (ICML)","author":"L. Wang","year":"2007","unstructured":"Wang, L., Yang, C., & Feng, J. (2007). On learning with dissimilarity functions. In Proceedings of the 24th international conference on machine learning (ICML) (pp. 991\u2013998)."},{"key":"5293_CR33","first-page":"207","volume":"10","author":"K. Q. Weinberger","year":"2009","unstructured":"Weinberger, K. Q., & Saul, L. K. (2009). Distance metric learning for large margin nearest neighbor classification. Journal of Machine Learning Research, 10, 207\u2013244.","journal-title":"Journal of Machine Learning Research"},{"key":"5293_CR34","unstructured":"Yang, L., & Jin, R. (2006). Distance metric learning: a comprehensive survey. Tech. rep., Department of Computer Science and Engineering, Michigan State University."},{"issue":"6","key":"5293_CR35","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Zhang, K., & Shasha, D. (1989). Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing, 18(6), 1245\u20131262.","journal-title":"SIAM Journal on Computing"},{"key":"5293_CR36","first-page":"49","volume-title":"Advances in neural information processing systems (NIPS)","author":"J. Zhu","year":"2003","unstructured":"Zhu, J., Rosset, S., Hastie, T., & Tibshirani, R. (2003). 1-norm support vector machines. In Advances in neural information processing systems (NIPS) (pp. 49\u201356)."},{"key":"5293_CR37","first-page":"45","volume-title":"ICDM workshops","author":"P. Zigoris","year":"2006","unstructured":"Zigoris, P., Eads, D., & Zhang, Y. (2006). Unsupervised learning of tree alignment models for information extraction. In ICDM workshops (pp. 45\u201349)."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-012-5293-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-012-5293-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-012-5293-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,25]],"date-time":"2024-04-25T18:05:21Z","timestamp":1714068321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-012-5293-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,16]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["5293"],"URL":"https:\/\/doi.org\/10.1007\/s10994-012-5293-8","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,16]]}}}