Good edit similarity learning by loss minimization

Machine Learning

Volumn 89, Issue 1-2, 2012, Pages 5-35

  Bellet, Aurélien ^a   Habrard, Amaury ^a   Sebban, Marc ^a  

^a UNIVERSITÉ JEAN MONNET   (France)

Author keywords

Edit distance; Good similarity function; Loss minimization; Similarity learning

Indexed keywords

CLASS OF LOSS FUNCTIONS; EDIT DISTANCE; FUNDAMENTAL COMPONENT; GENERALIZATION ABILITY; LOSS MINIMIZATION; REAL-WORLD DATASETS; SIMILARITY FUNCTIONS; SIMILARITY LEARNING; TREE-STRUCTURED DATA; UNIFORM STABILITY;

LEARNING ALGORITHMS;

TREES (MATHEMATICS);

EID: 84865203025     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-012-5293-8     Document Type: Article

References (37)

1. Bach, F., & Obozinski, G. (2010). Sparse methods for machine learning: theory and algorithms. ECML/PKDD tutorial. http://www.di.ens.fr/~fbac/ ecml2010tutorial.
2. 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-80). (Pubitemid 46966829)
3. 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-298).
4. A. Bellet M. Bernard T. Murgue M. Sebban 2010 Learning state machine-based string edit kernels Pattern Recognition 43 6 2330 2339 1191.68490 10.1016/j.patcog.2009.12.008
5. 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-133).
6. 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-203).
7. M. Bernard L. Boyer A. Habrard M. Sebban 2008 Learning probabilistic models of tree edit distance Pattern Recognition 41 8 2611 2629 1151.68577 10.1016/j.patcog.2008.01.011
8. 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-1191).
9. 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-48).
10. P. Bille 2005 A survey on tree edit distance and related problem Theoretical Computer Science 337 1-3 217 239 2141222 1078.68152 10.1016/j.tcs.2004.12.030 (Pubitemid 40644674)
11. O. Bousquet A. Elisseeff 2002 Stability and generalization Journal of Machine Learning Research 2 499 526 1929416 1007.68083 (Pubitemid 135712570)
12. 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-216). (Pubitemid 47275067)
13. A. P. Dempster N. M. Laird D. B. Rubin 1977 Maximum likelihood from incomplete data via the EM algorithm Journal of the Royal Statistical Society, Series B 39 1 1 38 501537 0364.62022
14. 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-288). Berlin: Springer. (Pubitemid 44072200)
15. 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-70). Berlin: Springer.
16. K. Etessami M. Yannakakis 2009 Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations Journal of the ACM 56 1 2541335 10.1145/1462153.1462154
17. H. Freeman 1974 Computer processing of line-drawing images ACM Computing Surveys 6 57 97 0287.68067 10.1145/356625.356627
18. 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. 89 (pp. 10,915-10,919).
19. Jin, R., Wang, S., & Zhou, Y. (2009). Regularized distance metric learning: theory and algorithm. In Advances in neural information processing systems (NIPS) (pp. 862-870).
20. 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-102). Berlin: Springer. (Pubitemid 128117046)
21. V. I. Levenshtein 1966 Binary codes capable of correcting deletions, insertions and reversals Soviet Physics-Doklandy 6 707 710 189928
22. 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-395).
23. McDiarmid, C. (1989). On the method of bounded differences. In Surveys in combinatorics (pp. 148-188). Cambridge: Cambridge University Press.
24. 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-292).
25. 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-393). New York: IEEE Press.
26. J. Oncina M. Sebban 2006 Learning stochastic edit distance: application in handwritten character recognition Pattern Recognition 39 9 1575 1587 1096.68724 10.1016/j.patcog.2006.03.011 (Pubitemid 43867574)
27. E. S. Ristad P. N. Yianilos 1998 Learning string-edit distance IEEE Transactions on Pattern Analysis and Machine Intelligence 20 5 522 532 10.1109/34.682181 (Pubitemid 128741331)
28. L. Rosasco E. D. Vito A. Caponnetto M. Piana A. Verri 2004 Are loss functions all the same? Neural Computation 16 5 1063 1076 1089.68109 10.1162/089976604773135104 (Pubitemid 38483051)
29. H. Saigo J. P. Vert T. Akutsu 2006 Optimizing amino acid substitution matrices with a local alignment kernel BMC Bioinformatics 7 246 1 12
30. S. Selkow 1977 The tree-to-tree editing problem Information Processing Letters 6 6 184 186 458995 0391.68022 10.1016/0020-0190(77)90064-3
31. 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-615).
32. 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-998). (Pubitemid 47275163)
33. K. Q. Weinberger L. K. Saul 2009 Distance metric learning for large margin nearest neighbor classification Journal of Machine Learning Research 10 207 244 1235.68204
34. Yang, L., & Jin, R. (2006). Distance metric learning: a comprehensive survey. Tech. rep., Department of Computer Science and Engineering, Michigan State University.
35. K. Zhang D. Shasha 1989 Simple fast algorithms for the editing distance between trees and related problems SIAM Journal on Computing 18 6 1245 1262 1025472 0692.68047 10.1137/0218082 (Pubitemid 20613578)
36. Zhu, J., Rosset, S., Hastie, T., & Tibshirani, R. (2003). 1-norm support vector machines. In Advances in neural information processing systems (NIPS) (pp. 49-56).
37. Zigoris, P., Eads, D., & Zhang, Y. (2006). Unsupervised learning of tree alignment models for information extraction. In ICDM workshops (pp. 45-49).