An experimental study on learning with good edit similarity functions

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2011, Pages 126-133

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

^a UNIVERSITÉ JEAN MONNET   (France)

^b AIX MARSEILLE UNIVERSITY   (France)

Author keywords

Edit distance; Linear program; Similarity function; Sparsity; Structured data

Indexed keywords

EDIT DISTANCE; LINEAR PROGRAMS; SIMILARITY FUNCTIONS; SPARSITY; STRUCTURED DATA;

ARTIFICIAL INTELLIGENCE; SUPPORT VECTOR MACHINES;

LEARNING ALGORITHMS;

EID: 84855810480     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2011.27     Document Type: Conference Paper

References (30)

1. J. Goldberger, S. Roweis, G. Hinton, and R. Salakhutdinov, "Neighbourhood Components Analysis," in Adv. in Neural Inf. Proc. Sys. (NIPS), vol. 17, 2004, pp. 513-520.
2. J. V. Davis, B. Kulis, P. Jain, S. Sra, and I. S. Dhillon, "Information-theoretic metric learning," in Proc. of the Int. Conf. on Machine Learning (ICML), 2007, pp. 209-216.
3. K. Q. Weinberger and L. K. Saul, "Distance Metric Learning for Large Margin Nearest Neighbor Classification," J. of Mach. Learn. Res. (JMLR), vol. 10, pp. 207-244, 2009.
4. R. A. Wagner and M. J. Fischer, "The String-to-String Correction Problem," Journal of the ACM, vol. 21, no. 1, pp. 168-173, 1974.
5. P. Bille, "A survey on tree edit distance and related problems," Theoretical Computer Science, vol. 337, no. 1-3, pp. 217-239, 2005. (Pubitemid 40644674)
6. X. Gao, B. Xiao, D. Tao, and X. Li, "A survey of graph edit distance," Pattern Analysis & Applications, vol. 13, no. 1, pp. 113-129, 2010.
7. T. F. Smith and M. S. Waterman, "Identification of common molecular subsequences," Journal of Molecular Biology, vol. 147, no. 1, pp. 195-197, 1981.
8. E. S. Ristad and P. N. Yianilos, "Learning String-Edit Distance," in IEEE Trans. on Pattern Analysis and Machine Intelligence, vol. 20, no. 5, 1998, pp. 522-532. (Pubitemid 128741331)
9. M. Bilenko and R. J. Mooney, "Adaptive Duplicate Detection Using Learnable String Similarity Measures," in Proc. of the Int. Conf. on Knowledge Discovery and Data Mining (SIGKDD), 2003, pp. 39-48.
10. J. Oncina and M. Sebban, "Learning Stochastic Edit Distance: application in handwritten character recognition," Pattern Recognition, vol. 39, no. 9, pp. 1575-1587, 2006. (Pubitemid 43867574)
11. M. Bernard, L. Boyer, A. Habrard, and M. Sebban, "Learning probabilistic models of tree edit distance," Pattern Recognition, vol. 41, no. 8, pp. 2611-2629, 2008.
12. C. Cortes, P. Haffner, and M. Mohri, "Rational Kernels: Theory and Algorithms," J. of Mach. Learn. Res. (JMLR), vol. 5, pp. 1035-1062, 2004.
13. H. Li and T. Jiang, "A class of edit kernels for SVMs to predict translation initiation sites in eukaryotic mRNAs," in Proc. of the Annual Int. Conf. on Research in Comp. Molecular Biology, 2004, pp. 262-271.
14. H. Saigo, J.-P. Vert, N. Ueda, and T. Akutsu, "Protein homology detection using string alignment kernels," Bioinformatics, vol. 20, no. 11, pp. 1682-1689, 2004. (Pubitemid 39162045)
15. M. Neuhaus and H. Bunke, "Edit distance-based kernel functions for structural pattern classification," Pattern Recognition, vol. 39, pp. 1852-1863, 2006. (Pubitemid 43947095)
16. A. Bellet, M. Bernard, T. Murgue, and M. Sebban, "Learning state machine-based string edit kernels," Pattern Recognition, vol. 43, no. 6, pp. 2330-2339, 2010.
17. I. Steinwart, "Sparseness of Support Vector Machines," J. of Mach. Learn. Res. (JMLR), vol. 4, pp. 1071-1105, 2003.
18. J. Zhu, S. Rosset, T. Hastie, and R. Tibshirani, "1-norm Support Vector Machines," in Adv. in Neural Inf. Proc. Sys. (NIPS), vol. 16, 2003.
19. C. J. Burges, "Simplified Support Vector Decision Rules," in Proc. of the Int. Conf. on Machine Learning (ICML), 1996, pp. 71-77.
20. Y.-J. Lee and O. L. Mangasarian, "RSVM: Reduced support vector machines," in Proc. of the SIAM Int. Conf. on Data Mining (ICDM), 2001.
21. M. E. Tipping, "Sparse bayesian learning and the relevance vector machine," J. of Mach. Learn. Res. (JMLR), vol. 1, pp. 211-244, 2001. (Pubitemid 33687203)
22. M. Wu, B. Scholkopf, and G. Bakir, "A Direct Method for Building Sparse Kernel Learning Algorithms," J. of Mach. Learn. Res. (JMLR), vol. 7, pp. 603-624, 2006. (Pubitemid 43668113)
23. T. Joachims and C.-N. J. Yu, "Sparse kernel SVMs via cutting-plane training," Machine Learning, vol. 76, no. 2-3, pp. 179-193, 2009.
24. M.-F. Balcan and A. Blum, "On a Theory of Learning with Similarity Functions," in Proc. of the Int. Conf. on Machine Learning (ICML), 2006, pp. 73-80.
25. M.-F. Balcan, A. Blum, and N. Srebro, "Improved Guarantees for Learning via Similarity Functions," in Proc. of the Annual Conf. on Learning Theory (COLT), 2008, pp. 287-298.
26. L. Wang, C. Yang, and J. Feng, "On Learning with Dissimilarity Functions," in Proc. of the Int. Conf. on Machine Learning (ICML), 2007, pp. 991-998.
27. F. Bach and G. Obozinski, "Sparse Methods for Machine Learning: Theory and Algorithms," ECML/PKDD Tutorial, 2010, http://www.di.ens.fr/ ~fbac/ecml2010tutorial.
28. V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions and reversals," Soviet Physics-Doklandy, vol. 6, pp. 707-710, 1966.
29. H. Freeman, "Computer Processing of Line-Drawing Images," ACM Computing Surveys, vol. 6, pp. 57-97, 1974.
30. C.-C. Chang and C.-J. Lin, LIBSVM: a library for support vector machines, 2001, software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm.