Learning stochastic tree edit distance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4212 LNAI, Issue , 2006, Pages 42-53

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

^a UNIVERSITÉ JEAN MONNET   (France)

^b AIX MARSEILLE UNIV   (France)

Author keywords

Discriminative models; EM algorithm; Generative models; Stochastic tree edit distance

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; RANDOM PROCESSES; TREES (MATHEMATICS); WORLD WIDE WEB;

DISCRIMINATIVE MODELS; EDIT DISTANCE (ED); EM ALGORITHM; GENERATIVE MODELS; STOCHASTIC TREE EDIT DISTANCE;

LEARNING SYSTEMS;

EID: 33750334601     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11871842_9     Document Type: Conference Paper

References (11)

1. Bille, P.: A survey on tree edit distance and related problem. Theoretical Computer Science 337(1-3) (2005) 217-239
2. Ristad, S., Yianilos, P.: Learning string-edit distance. IEEE Transactions on Pattern Analysis and Machine Intelligence 20(5) (1998) 522-532
3. Oncina, J., Sebban, M.: Learning stochastic edit distance: application in handwritten character recognition. Journal of Pattern Recognition (2006) to appear.
4. McCallum, A., Bellare, K., Pereira, P.: A conditional random field for disciminatively-trained finite-state sting edit distance. In: UAI2005. (2005)
5. Durbin, R., Eddy, S., Krogh, A., Mitchison, G.: Biological sequence analysis. Cambridge University Press (1998)
6. Neuhaus, M., Bunke, H.: A probabilistic approach to learning costs for graph edit distance. In: 17th Int. Conf. on Pattern Recognition, IEEE (2004) 389-393
7. Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing (1989) 1245-1262
8. Klein, P.: Computing the edit-distance between unrooted ordered trees. In: Proc. of the 6th European Symposium on Algorithms (ESA), Springer (1998) 91-102
9. Selkow, S.: The tree-to-tree editing problem. Information Processing Letters 6(6) (1977) 184-186
10. Bouchard, G., Triggs, B.: The trade-off between generative and discrminative classifiers. In: COMPSTAT'2004, Springer (2004)
11. Dempster, A., Laird. M., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc B(39) (1977) 1-38