Skip to Main content Skip to Navigation
Conference papers

A Graph Database Repository and Performance Evaluation Metrics for Graph Edit Distance

Abstract : 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
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01168809
Contributor : Romain Raveaux <>
Submitted on : Friday, June 26, 2015 - 3:29:07 PM
Last modification on : Saturday, October 26, 2019 - 2:06:10 AM

Identifiers

  • HAL Id : hal-01168809, version 1

Citation

Zeina Abu-Aisheh, Romain Raveaux, Jean-Yves Ramel. A Graph Database Repository and Performance Evaluation Metrics for Graph Edit Distance. Graph-Based Representations in Pattern Recognition - 10th IAPR-TC-15 International Workshop, GbRPR 2015, Beijing, China, May 13-15, 2015. Proceedings, May 2015, Beijing, France. ⟨hal-01168809⟩

Share

Metrics

Record views

217