A Graph Database Repository and Performance Evaluation Metrics for Graph Edit Distance
Résumé
Graph edit distance (GED) is an error tolerant graph matching
paradigm whose methods are often evaluated in a classification context
and less deeply assessed in terms of the accuracy of the found solution.
To evaluate the accuracy of GED methods, low level information
is required not only at the classification level but also at the matching
level. Most of the publicly available repositories with associated ground
truths are dedicated to evaluating graph classification or exact graph
matching methods and so the matching correspondences as well as the
distance between each pair of graphs are not directly evaluated. This
paper consists of two parts. First, we provide a graph database repository
annotated with low level information like graph edit distances and
their matching correspondences. Second, we propose a set of performance