Bridging the Gap between Graph Edit Distance and Kernel Machines
From MaRDI portal
Publication:5754227
DOI10.1142/6523zbMath1140.68473MaRDI 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
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68T05: Learning and adaptive systems in artificial intelligence
68R10: Graph theory (including graph drawing) in computer science
68T10: Pattern recognition, speech recognition
Related Items
Kernel functions for case-based planning, Recent advances in graph-based pattern recognition with applications in document analysis, Depth-based complexity traces of graphs, A theory of subtree matching and tree kernels based on the edit distance concept, The graph matching problem, Graph ambiguity, Improving Graph Classification by Isomap