Bridging the Gap between Graph Edit Distance and Kernel Machines

DOI10.1142/6523MaRDI QIDQ5754227zbMATH OpenOpenAlexFDO

Authors Michel Neuhaus, Horst Bunke

Publication date 21 August 2007

Published in Series in Machine Perception and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/3887fcb4f74e2592f462a3f61b532189687854ab

zbMATH Keywords

graph matching

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Edit distance-based kernel functions for structural pattern classification
• Graph-Based Representations in Pattern Recognition
• Structural pattern recognition with graph edit distance. Approximation algorithms and applications
• Automatic learning of cost functions for graph edit distance
• Approximation of graph edit distance based on Hausdorff matching

Cited in

(20)

• A long trip in the charming world of graphs for pattern recognition
• Treelet kernel incorporating cyclic, stereo and inter pattern information in chemoinformatics
• Improving bipartite graph edit distance approximation using various search strategies
• A quotient space formulation for generative statistical analysis of graphical data
• The graph matching problem
• Graph ambiguity
• Edit distance-based kernel functions for structural pattern classification
• Modified kernel functions by geodesic distance
• scientific article; zbMATH DE number 1691467 (Why is no real title available?)
• Fast processing of graph queries on a large database of small and medium-sized data graphs
• Modeling the uncertainty of a set of graphs using higher-order fuzzy sets
• Improving Graph Classification by Isomap
• Structural pattern recognition with graph edit distance. Approximation algorithms and applications
• Graph-Based Representations in Pattern Recognition
• GTED: Graph Traversal Edit Distance
• Kernel functions for case-based planning
• Recent advances in graph-based pattern recognition with applications in document analysis
• Automatic learning of cost functions for graph edit distance
• Depth-based complexity traces of graphs
• A theory of subtree matching and tree kernels based on the edit distance concept

This page was built for publication: Bridging the Gap between Graph Edit Distance and Kernel Machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5754227)