Sciweavers

136 search results - page 1 / 28
» Learning probabilistic models of tree edit distance
Sort
View
PR
2008
90views more  PR 2008»
13 years 3 months ago
Learning probabilistic models of tree edit distance
Marc Bernard, Laurent Boyer 0002, Amaury Habrard, ...
ICDM
2007
IEEE
187views Data Mining» more  ICDM 2007»
13 years 10 months ago
Statistical Learning Algorithm for Tree Similarity
Tree edit distance is one of the most frequently used distance measures for comparing trees. When using the tree edit distance, we need to determine the cost of each operation, bu...
Atsuhiro Takasu, Daiji Fukagawa, Tatsuya Akutsu
ICPR
2004
IEEE
14 years 4 months ago
A Probabilistic Approach to Learning Costs for Graph Edit Distance
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
Horst Bunke, Michel Neuhaus
ECML
2006
Springer
13 years 7 months ago
Learning Stochastic Tree Edit Distance
Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured...
Marc Bernard, Amaury Habrard, Marc Sebban
ECML
2007
Springer
13 years 9 months ago
Learning Metrics Between Tree Structured Data: Application to Image Recognition
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
Laurent Boyer 0002, Amaury Habrard, Marc Sebban