Sciweavers

56 search results - page 2 / 12
» Bayesian Graph Edit Distance
Sort
View
PAMI
2006
164views more  PAMI 2006»
13 years 5 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
JGT
2008
91views more  JGT 2008»
13 years 5 months ago
On the editing distance of graphs
An edge-operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs G, the editing distance fro...
Maria Axenovich, André E. Kézdy, Rya...
GBRPR
2007
Springer
13 years 11 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke
ICPR
2006
IEEE
14 years 6 months ago
A Convolution Edit Kernel for Error-tolerant Graph Matching
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...
Horst Bunke, Michel Neuhaus