A quadratic programming approach to the graph edit distance problem

Authors:
Michel Neuhaus;Horst Bunke
Affiliations:
LIP6, Université Pierre et Marie Curie, Paris, France;Institute of Computer Science, University of Bern, Bern, Switzerland
Venue:
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Year:
2007

Citing 8
Cited 3

Structural Matching by Discrete Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence
The String-to-String Correction Problem

Journal of the ACM (JACM)
Structural Matching in Computer Vision Using Probabilistic Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Binary Linear Programming Formulation of the Graph Edit Distance

IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph edit distance with node splitting and merging, and its application to diatom identification

GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
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
Feature selection for graph-based image classifiers

IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part II
Theoretical and algorithmic framework for hypergraph matching

ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing

Median graphs: A genetic approach based on new theoretical properties

Pattern Recognition
Multi-instance learning by treating instances as non-I.I.D. samples

ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Review:

The Knowledge Engineering Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost edit path between graphs, we introduce the notion of fuzzy edit paths between graphs and provide a quadratic programming formulation for the minimization of fuzzy edit costs. Experiments on real-world graph data demonstrate that our proposed method is able to outperform the standard edit distance method in terms of recognition accuracy on two out of three data sets.