Sciweavers

1154 search results - page 1 / 231
» On the editing distance of graphs
Sort
View
GBRPR
2007
Springer
13 years 11 months ago
A Quadratic Programming Approach to the Graph Edit Distance Problem
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 ed...
Michel Neuhaus, Horst Bunke
ICPR
2004
IEEE
14 years 5 months ago
A Probabilistic Approach to Learning Costs for Graph Edit Distance
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
Horst Bunke, Michel Neuhaus
ICCV
2003
IEEE
13 years 10 months ago
Edit Distance From Graph Spectra
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the fo...
Antonio Robles-Kelly, Edwin R. Hancock
ISCI
2007
170views more  ISCI 2007»
13 years 4 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
PAMI
2006
164views more  PAMI 2006»
13 years 4 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero