Metric Indexing for Graph Similarity Search

10/04/2021
by   Franka Bause, et al.
0

Finding the graphs that are most similar to a query graph in a large database is a common task with various applications. A widely-used similarity measure is the graph edit distance, which provides an intuitive notion of similarity and naturally supports graphs with vertex and edge attributes. Since its computation is NP-hard, techniques for accelerating similarity search have been studied extensively. However, index-based approaches for this are almost exclusively designed for graphs with categorical vertex and edge labels and uniform edit costs. We propose a filter-verification framework for similarity search, which supports non-uniform edit costs for graphs with arbitrary attributes. We employ an expensive lower bound obtained by solving an optimal assignment problem. This filter distance satisfies the triangle inequality, making it suitable for acceleration by metric indexing. In subsequent stages, assignment-based upper bounds are used to avoid further exact distance computations. Our extensive experimental evaluation shows that a significant runtime advantage over both a linear scan and state-of-the-art methods is achieved.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2021

EmbAssi: Embedding Assignment Costs for Similarity Search in Large Graph Databases

The graph edit distance is an intuitive measure to quantify the dissimil...
research
04/18/2019

Convex Graph Invariant Relaxations For Graph Edit Distance

The edit distance between two graphs is a widely used measure of similar...
research
06/30/2020

Hierarchical Graph Matching Network for Graph Similarity Computation

Graph edit distance / similarity is widely used in many tasks, such as g...
research
09/20/2017

Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation

Graph edit distance (GED) is an important similarity measure adopted in ...
research
12/24/2021

A Neural Framework for Learning Subgraph and Graph Similarity Measures

Subgraph similarity search is a fundamental operator in graph analysis. ...
research
08/01/2019

New Techniques for Graph Edit Distance Computation

Due to their capacity to encode rich structural information, labeled gra...
research
06/29/2019

Upper Bounding GED via Transformations to LSAPE Based on Rings and Machine Learning

The graph edit distance (GED) is a flexible distance measure which is wi...

Please sign up or login with your details

Forgot password? Click here to reset