Learning probabilistic models of tree edit distance

Pattern Recognition

Volumn 41, Issue 8, 2008, Pages 2611-2629

  Bernard, Marc ^a   Boyer, Laurent ^a   Habrard, Amaury ^b   Sebban, Marc ^a  

^a UNIVERSITÉ JEAN MONNET   (France)

^b AIX MARSEILLE UNIVERSITY   (France)

Author keywords

Discriminative model; EM algorithm; Generative model; Tree edit distance

Indexed keywords

COMPUTER MUSIC; LEARNING SYSTEMS; MATHEMATICAL MODELS; PATTERN RECOGNITION; TREES (MATHEMATICS); XML;

DISCRIMINATIVE MODEL; GENERATIVE MODEL; TREE EDIT DISTANCE;

PROBABILISTIC LOGICS;

EID: 42749094100     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2008.01.011     Document Type: Article

References (18)

1. P. Bille A survey on tree edit distance and related problem Theoret. Comput. Sci. 337 1–3 2005 217 239
2. S. Ristad P. Yianilos Learning string-edit distance IEEE Transactions on Pattern Anal. Mach. Intell. 20 5 1998 522 532
3. J. Oncina M. Sebban Learning stochastic edit distance: application in handwritten character recognition J. Pattern Recognition 39 9 2006 1575 1587
4. A. McCallum, K. Bellare, P. Pereira, A conditional random field for discriminatively-trained finite-state sting edit distance, in: Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (UAI’2005), 2005, pp. 388–400.
5. R. Durbin S. Eddy A. Krogh G. Mitchison Biological Sequence Analysis 1998 Cambridge University Press
6. M. Neuhaus, H. Bunke, A probabilistic approach to learning costs for graph edit distance, in: 17th International Conference on Pattern Recognition, IEEE, 2004, pp. 389–393.
7. M. Bernard, A. Habrard, M. Sebban, Learning stochastic tree edit distance, in: European Conference on Machine Learning (ECML), Lecture Notes in Computer Science, vol. 4212, Springer, Berlin, 2006, pp. 42–53.
8. K. Zhang, D. Shasha, Simple fast algorithms for the editing distance between trees and related problems, SIAM J. Comput. (1989) 1245–1262.
9. P. Klein Computing the edit-distance between unrooted ordered trees Proceedings of the Sixth European Symposium on Algorithms (ESA) 1998 Springer Berlin 91 102
10. S. Dulucq L. Tichit RNA secondary structure comparison: exact analysis of the Zhang–Shasha tree edit algorithm Theoret. Comput. Sci. 306 1–3 2003 471 484
11. S. Dulucq H. Touzet Decomposition algorithms for the tree edit distance problem J. Discrete Algorithms 3 2-4 2005 448 471
12. S. Selkow The tree-to-tree editing problem Inform. Process. Lett. 6 6 1977 184 186
13. G. Bouchard B. Triggs The trade-off between generative and discriminative classifiers Proceedings of the 16th IASC International Symposium on Computational Statistics (COMPSTAT’2004) 2004 Springer Berlin 697 704
14. A. Dempster M. Laird D. Rubin Maximum likelihood from incomplete data via the EM algorithm J. R. Statist. Soc. B. 39) 1977 1 38
15. P. Kilpelainen, Tree matching problems with applications to structured text databases, Ph.D. thesis, Department of Computer Science, University of Helsinki, 1992.
16. E. Gómez, L. Micó, J. Oncina, Testing the linear approximating eliminating search algorithm in handwritten character recognition tasks, in: VI Symposium Nacional de reconocimiento de Formas y Análisis de Imágenes, 1995, pp. 212–217.
17. L. Micó J. Oncina Comparison of fast nearest neighbour classifiers for handwritten character recognition Pattern Recognition Lett. 19 1998 351 356
18. E.S. Ristad P.N. Yianilos Learning string-edit distance IEEE Trans. Pattern Anal. Mach. Intell. 20 5 1998 522 532