A survey of graph edit distance

Authors:
Xinbo Gao;Bing Xiao;Dacheng Tao;Xuelong Li
Affiliations:
Xidian University, School of Electronic Engineering, 710071, Xi’an, People’s Republic of China;Xidian University, School of Electronic Engineering, 710071, Xi’an, People’s Republic of China;Nanyang Technological University, School of Computer Engineering, 50 Nanyang Avenue, Blk N4, 639798, Singapore, Singapore;University of London, School of Computer Science and Information Systems, Birkbeck College, WC1E 7HX, London, UK
Venue:
Pattern Analysis & Applications
Year:
2010

Citing 0
Cited 36

A new clustering algorithm for coordinate-free data

Pattern Recognition
Interactive searching and visualization of patterns in attributed graphs

Proceedings of Graphics Interface 2010
Graph of words embedding for molecular structure-activity relationship analysis

CIARP'10 Proceedings of the 15th Iberoamerican congress conference on Progress in pattern recognition, image analysis, computer vision, and applications
Improved call graph comparison using simulated annealing

Proceedings of the 2011 ACM Symposium on Applied Computing
Learning graph prototypes for shape recognition

Computer Vision and Image Understanding
Learning cellular sorting pathways using protein interactions and sequence motifs

RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
Exploration of the labelling space given graph edit distance costs

GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Indexing with well-founded total order for faster subgraph isomorphism detection

GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Automatic human action recognition in videos by graph embedding

ICIAP'11 Proceedings of the 16th international conference on Image analysis and processing - Volume Part II
On the usefulness of similarity based projection spaces for transfer learning

SIMBAD'11 Proceedings of the First international conference on Similarity-based pattern recognition
Biometric identification based on the eye movements and graph matching techniques

Pattern Recognition Letters
Clustering with proximity knowledge and relational knowledge

Pattern Recognition
Fast subgraph isomorphism detection for graph-based retrieval

ICCBR'11 Proceedings of the 19th international conference on Case-Based Reasoning Research and Development
Graph structure analysis based on complex network

Digital Signal Processing
A wikipedia based semantic graph model for topic tracking in blogosphere

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Discovering configuration templates of virtualized tenant networks in multi-tenancy datacenters via graph-mining

ACM SIGCOMM Computer Communication Review
Approximate graph isomorphism

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Faster subgraph isomorphism detection by well-founded total order indexing

Pattern Recognition Letters
What is the IQ of your data transformation system?

Proceedings of the 21st ACM international conference on Information and knowledge management
Reordering video shots for event classification using bag-of-words models and string kernels

Proceedings of the 27th Conference on Image and Vision Computing New Zealand
Reconstructing provenance

ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part II
Human action recognition in video by fusion of structural and spatio-temporal features

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
Biview face recognition in the shape-texture domain

Pattern Recognition
A similarity metric method of obfuscated malware using function-call graph

Journal in Computer Virology
Graph ambiguity

Fuzzy Sets and Systems
MeshGit: diffing and merging meshes for polygonal modeling

ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
NABEECO: biological network alignment with bee colony optimization algorithm

Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
SynopSys: large graph analytics in the SAP HANA database through summarization

First International Workshop on Graph Data Management Experiences and Systems
Efficient geometric graph matching using vertex embedding

Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Automated grading of DFA constructions

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Knowledge-based graph document modeling

Proceedings of the 7th ACM international conference on Web search and data mining
Graph-based retrieval of building information models for supporting the early design stages

Advanced Engineering Informatics
Towards the estimation of feature-based semantic similarity using multiple ontologies

Knowledge-Based Systems
Optimized dissimilarity space embedding for labeled graphs

Information Sciences: an International Journal
Semantizing complex 3D scenes using constrained attribute grammars

SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inexact graph matching has been one of the significant research foci in the area of pattern analysis. As an important way to measure the similarity between pairwise graphs error-tolerantly, graph edit distance (GED) is the base of inexact graph matching. The research advance of GED is surveyed in order to provide a review of the existing literatures and offer some insights into the studies of GED. Since graphs may be attributed or non-attributed and the definition of costs for edit operations is various, the existing GED algorithms are categorized according to these two factors and described in detail. After these algorithms are analyzed and their limitations are identified, several promising directions for further research are proposed.