HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

A Parallel Graph Edit Distance Algorithm

Abstract : Graph edit distance (GED) has emerged as a powerful and flexible graph matching paradigm that can be used to address different tasks in pattern recognition, machine learning, and data mining. GED is an error-tolerant graph matching technique that represents the minimum-cost sequence of basic editing operations to transform a graph into another graph by means of insertion, deletion and substitution of nodes or edges. Unfortunately, GED is a NP-hard combinatorial optimization problem. The question of elaborating fast and precise algorithms is of first interest. In this paper, a parallel algorithm for exact GED computation is proposed. Our proposal is based on a branch-and-bound algorithm coupled with a load balancing strategy. Parallel threads run a branch-and-bound algorithm to explore the solution space and to discard misleading partial solutions. In the mean time, the load balancing scheme ensures that no thread remains idle. Experiments on 4 publicly available datasets empirically demonstrated that under time constraints our proposal can drastically improve a sequential approach and a naive parallel approach. Our proposal was compared to 6 other methods and provided more precise solutions while requiring a low memory usage. Experiments also showed that having more precise solutions does not necessarily lead to higher classification rates. Such a result raises a question of the benefit of having more precise solutions in a classification context.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [43 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01476393
Contributor : Zeina Abu-Aisheh Connect in order to contact the contributor
Submitted on : Friday, February 24, 2017 - 6:40:43 PM
Last modification on : Tuesday, January 11, 2022 - 5:56:22 PM
Long-term archiving on: : Thursday, May 25, 2017 - 2:31:37 PM

File

A Parallel GED algorithm - Zei...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01476393, version 1

Citation

Zeina Abu-Aisheh, Romain Raveaux, Jean-Yves Ramel, Patrick Martineau. A Parallel Graph Edit Distance Algorithm. 2017. ⟨hal-01476393⟩

Share

Metrics

Record views

376

Files downloads

459