An efficient algorithm for graph edit distance computation

doi:10.1016/j.knosys.2018.10.002

An efficient algorithm for graph edit distance computation

2019-01-01

25

OA

AI

DOI：10.1016/j.knosys.2018.10.002

Original

Save

View PDF

Abstract

En 中文

The graph edit distance (GED) is a well-established distance measure widely used in many applications, such as bioinformatics, data mining, pattern recognition, and graph classification. However, existing solutions for computing the GED suffer from several drawbacks: large search spaces, excessive memory requirements, and many expensive backtracking calls. In this paper, we present BSS_GED, a novel vertex-based mapping method that calculates the GED in a reduced search space created by identifying invalid and redundant mappings. BSS_GED employs the beam-stack search paradigm, a widely utilized search algorithm in Al, combined with two specially designed heuristics to improve the GED computation, achieving a trade-off between memory utilization and expensive backtracking calls. Through extensive experiments, we demonstrate that BSS_GED is highly efficient on both sparse and dense graphs and out-performs the state-of-the-art methods. Furthermore, we apply BSS_GED to solve the well-investigated graph similarity search problem. The experimental results show that this method is dozens of times faster than state-of-the-art graph similarity search methods. (C) 2018 Elsevier B.V. All rights reserved.

Keywords:

Graph edit distance

Reduced search space

Beam-stack search

Heuristics

Graph similarity search

An efficient algorithm for graph edit distance computation

Abstract

AI Summary

Journal

Organization