18 search results - page 1 / 4 » A Probabilistic Approach to Learning Costs for Graph Edit Di... |
ICPR
2004
IEEE
14 years 5 months ago
2004
IEEE
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
ISCI
2007
13 years 4 months ago
2007
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
GBRPR
2007
Springer
13 years 10 months ago
2007
Springer
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...
ICDM
2007
IEEE
13 years 11 months ago
2007
IEEE
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...
ECML
2007
Springer
13 years 10 months ago
2007
Springer
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...