Automatic learning of cost functions for graph edit distance

DOI10.1016/j.ins.2006.02.013zbMath1142.68492OpenAlexW1983203670MaRDI QIDQ867614

Michel Neuhaus, Horst Bunke

Publication date: 16 February 2007

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2006.02.013

zbMATH Keywords

graph matchinggraph edit distanceedit cost function

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Related Items (9)

Graph characterization by counting sink star subgraphs ⋮ Path lengths in tree-child time consistent hybridization networks ⋮ Approximation of graph edit distance based on Hausdorff matching ⋮ The journey of graph kernels through two decades ⋮ The graph matching problem ⋮ Structure-based graph distance measures of high degree of precision ⋮ A distance measure for large graphs based on prime graphs ⋮ Dissimilarity between two skeletal trees in a context ⋮ Distance metric learning for graph structured data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence properties of the EM algorithm
• A greedy EM algorithm for Gaussian mixture learning
• Mixture Densities, Maximum Likelihood and the EM Algorithm
• QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
• A graph distance metric based on the maximal common subgraph
• The String-to-String Correction Problem
• Handbook of Fingerprint Recognition
• Inexact graph matching for structural pattern recognition
• A distance measure between attributed relational graphs for pattern recognition
• Graph distances using graph union
• A graph distance metric combining maximum common subgraph and minimum common supergraph

This page was built for publication: Automatic learning of cost functions for graph edit distance