Structural Matching in Computer Vision Using Probabilistic Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Polynomial-Time Metrics for Attributed Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
On graphs with unique node labels
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Feature selection for graph-based image classifiers
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
A graph matching based approach to fingerprint classification using directional variance
AVBPA'05 Proceedings of the 5th international conference on Audio- and Video-Based Biometric Person Authentication
Reducing the dimensionality of dissimilarity space embedding graph kernels
Engineering Applications of Artificial Intelligence
Median graph: A new exact algorithm using a distance based on the maximum common subgraph
Pattern Recognition Letters
Graph self-organizing maps for cyclic and unbounded graphs
Neurocomputing
Approximate graph edit distance computation by means of bipartite graph matching
Image and Vision Computing
Median graphs: A genetic approach based on new theoretical properties
Pattern Recognition
A Recursive Embedding Approach to Median Graph Computation
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Dissimilarity Based Vector Space Embedding of Graphs Using Prototype Reduction Schemes
MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
Comparing stars: on approximating graph edit distance
Proceedings of the VLDB Endowment
Bipartite graph matching for computing the edit distance of graphs
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
A quadratic programming approach to the graph edit distance problem
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
A family of novel graph kernels for structural pattern recognition
CIARP'07 Proceedings of the Congress on pattern recognition 12th Iberoamerican conference on Progress in pattern recognition, image analysis and applications
A comparison between two representatives of a set of graphs: median vs. barycenter graph
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Many-to-many graph matching: a continuous relaxation approach
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
Improved call graph comparison using simulated annealing
Proceedings of the 2011 ACM Symposium on Applied Computing
A generic framework for median graph computation based on a recursive embedding approach
Computer Vision and Image Understanding
Graph indexing and retrieval based on median graphs
MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
Improving vector space embedding of graphs through feature selection algorithms
Pattern Recognition
Inexact graph matching based on kernels for object retrieval in image databases
Image and Vision Computing
Malware classification based on call graph clustering
Journal in Computer Virology
Summarization and matching of density-based clusters in streaming environments
Proceedings of the VLDB Endowment
Towards the unification of structural and statistical pattern recognition
Pattern Recognition Letters
Graph database retrieval based on metric-trees
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
Component retrieval based on a database of graphs for Hand-Written Electronic-Scheme Digitalisation
Expert Systems with Applications: An International Journal
Discriminative prototype selection methods for graph embedding
Pattern Recognition
Optimized dissimilarity space embedding for labeled graphs
Information Sciences: an International Journal
Hi-index | 0.04 |
Graph edit distance is one of the most flexible mechanisms for error-tolerant graph matching. Its key advantage is that edit distance is applicable to unconstrained attributed graphs and can be tailored to a wide variety of applications by means of specific edit cost functions. Its computational complexity, however, is exponential in the number of vertices, which means that edit distance is feasible for small graphs only. In this paper, we propose two simple, but effective modifications of a standard edit distance algorithm that allow us to suboptimally compute edit distance in a faster way. In experiments on real data, we demonstrate the resulting speedup and show that classification accuracy is mostly not affected. The suboptimality of our methods mainly results in larger inter-class distances, while intra-class distances remain low, which makes the proposed methods very well applicable to distance-based graph classification.