Comparing stars: on approximating graph edit distance

Authors:
Zhiping Zeng;Anthony K. H. Tung;Jianyong Wang;Jianhua Feng;Lizhu Zhou
Affiliations:
Tsinghua University, Beijing, P.R. China;National University of Singapore, Singapore;Tsinghua University, Beijing, P.R. China;Tsinghua University, Beijing, P.R. China;Tsinghua University, Beijing, P.R. China
Venue:
Proceedings of the VLDB Endowment
Year:
2009

Citing 32
Cited 16

Structural Matching by Discrete Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence
A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection

IEEE Transactions on Pattern Analysis and Machine Intelligence
A graph distance metric based on the maximal common subgraph

Pattern Recognition Letters
Graph structure in the Web

Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Bayesian Graph Edit Distance

IEEE Transactions on Pattern Analysis and Machine Intelligence
A graph distance metric combining maximum common subgraph and minimum common supergraph

Pattern Recognition Letters
Efficient Matching and Indexing of Graph Models in Content-Based Retrieval

IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Algorithmics and applications of tree and graph searching

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computational Chemical Graph Theory: Characterization, Enumeration and Generation of Chemical Structures by Computer Methods

Computational Chemical Graph Theory: Characterization, Enumeration and Generation of Chemical Structures by Computer Methods
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Similarity Searching in Medical Image Databases

IEEE Transactions on Knowledge and Data Engineering
A Linear Programming Approach for the Weighted Graph Matching Problem

IEEE Transactions on Pattern Analysis and Machine Intelligence
Frequent Subgraph Discovery

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Mining Molecular Fragments: Finding Relevant Substructures of Molecules

ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
gSpan: Graph-Based Substructure Pattern Mining

ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Graph indexing: a frequent structure-based approach

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Similarity evaluation on tree-structured data

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Approximate matching of hierarchical data using pq-grams

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Bidirectional expansion for keyword search on graph databases

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Mining coherent dense subgraphs across massive biological networks for functional discovery

Bioinformatics
Closure-Tree: An Index Structure for Graph Queries

ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
A Binary Linear Programming Formulation of the Graph Edit Distance

IEEE Transactions on Pattern Analysis and Machine Intelligence
An incrementally maintainable index for approximate lookups in hierarchical data

VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Feature-based similarity search in graph structures

ACM Transactions on Database Systems (TODS)
Computational Modeling of Genetic and Biochemical Networks (Computational Molecular Biology)

Computational Modeling of Genetic and Biochemical Networks (Computational Molecular Biology)
SAGA: a subgraph matching tool for biological graphs

Bioinformatics
BLINKS: ranked keyword searches on graphs

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Fast and practical indexing and querying of very large graphs

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
A platform based on the multi-dimensional data modal for analysis of bio-molecular structures

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Towards graph containment search and indexing

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Graph indexing: tree + delta

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Fast suboptimal algorithms for the computation of graph edit distance

SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition

Connected substructure similarity search

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Untangling the cross-lingual link structure of Wikipedia

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
A tool for fast indexing and querying of graphs

Proceedings of the 20th international conference companion on World wide web
Improved call graph comparison using simulated annealing

Proceedings of the 2011 ACM Symposium on Applied Computing
Classifying graphs using theoretical metrics: a study of feasibility

DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
Efficient retrieval of 3D building models using embeddings of attributed subgraphs

Proceedings of the 20th ACM international conference on Information and knowledge management
Malware classification based on call graph clustering

Journal in Computer Virology
Indexing and mining topological patterns for drug discovery

Proceedings of the 15th International Conference on Extending Database Technology
Efficient algorithms for generalized subgraph query processing

Proceedings of the 21st ACM international conference on Information and knowledge management
On the relation between the common labelling and the median graph

SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
BinSlayer: accurate comparison of binary executables

PPREW '13 Proceedings of the 2nd ACM SIGPLAN Program Protection and Reverse Engineering Workshop
Coloring based approach for matching unrooted and/or unordered trees

Pattern Recognition Letters
A similarity measure for approximate querying over RDF data

Proceedings of the Joint EDBT/ICDT 2013 Workshops
Graph similarity search with edit distance constraint in large graph databases

Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Efficient geometric graph matching using vertex embedding

Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Efficient processing of graph similarity queries with edit distance constraints

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graph data have become ubiquitous and manipulating them based on similarity is essential for many applications. Graph edit distance is one of the most widely accepted measures to determine similarities between graphs and has extensive applications in the fields of pattern recognition, computer vision etc. Unfortunately, the problem of graph edit distance computation is NP-Hard in general. Accordingly, in this paper we introduce three novel methods to compute the upper and lower bounds for the edit distance between two graphs in polynomial time. Applying these methods, two algorithms AppFull and AppSub are introduced to perform different kinds of graph search on graph databases. Comprehensive experimental studies are conducted on both real and synthetic datasets to examine various aspects of the methods for bounding graph edit distance. Result shows that these methods achieve good scalability in terms of both the number of graphs and the size of graphs. The effectiveness of these algorithms also confirms the usefulness of using our bounds in filtering and searching of graphs.