Edit distance based kernel functions for attributed graph matching

DOI10.1007/978-3-540-31988-7_34MaRDI QIDQ5316485zbMATH OpenOpenAlexFDO

Authors Michel Neuhaus, Horst Bunke

Publication date 13 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b107037

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Bridging the Gap between Graph Edit Distance and Kernel Machines
• Edit distance-based kernel functions for structural pattern classification
• Automatic learning of cost functions for graph edit distance
• A theory of subtree matching and tree kernels based on the edit distance concept
• A survey of graph edit distance

Cited in

(12)

• Kronecker product graph matching.
• Edit distance-based kernel functions for structural pattern classification
• On the geometry of graph spaces
• Orthonormal kernel Kronecker product graph matching
• String edit distance, random walks and graph matching
• Protein classification with kernelized Softassign
• Local entropic graphs for globally-consistent graph matching
• A significant improvement of Softassign with diffusion kernels
• Bridging the Gap between Graph Edit Distance and Kernel Machines
• GTED: Graph Traversal Edit Distance
• A survey of graph edit distance
• A theory of subtree matching and tree kernels based on the edit distance concept

This page was built for publication: Edit distance based kernel functions for attributed graph matching

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