Bridging the Gap between Graph Edit Distance and Kernel Machines
From MaRDI portal
Publication:5754227
DOI10.1142/6523zbMath1140.68473OpenAlexW4300913086MaRDI QIDQ5754227
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
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)
Related Items (13)
Fast processing of graph queries on a large database of small and medium-sized data graphs ⋮ 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 ⋮ Kernel functions for case-based planning ⋮ Depth-based complexity traces of graphs ⋮ Recent advances in graph-based pattern recognition with applications in document analysis ⋮ A theory of subtree matching and tree kernels based on the edit distance concept ⋮ The graph matching problem ⋮ Graph ambiguity ⋮ Modeling the Uncertainty of a Set of Graphs Using Higher-Order Fuzzy Sets ⋮ A quotient space formulation for generative statistical analysis of graphical data ⋮ Improving Graph Classification by Isomap
This page was built for publication: Bridging the Gap between Graph Edit Distance and Kernel Machines
