Kernels for Structured Data

DOI10.1142/6855MaRDI QIDQ3528031zbMATH OpenOpenAlexFDO

Authors Thomas Gärtner

Publication date 2 October 2008

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

Full work available at URL https://doi.org/10.1142/6855

zbMATH Keywords

data kernelskernel functionskernel methodsmachine learning problemsstructured datasupport vector machines

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Data structures (68P05) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Kernels and distances for structured data
• Graph kernels
• scientific article; zbMATH DE number 1950771
• On graph kernels: hardness results and efficient alternatives.
• scientific article; zbMATH DE number 5003286

Cited in

(13)

• New efficient algorithms for multiple change-point detection with reproducing kernels
• A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
• The graph matching problem
• Structure spaces
• Improving Graph Classification by Isomap
• Effective feature construction by maximum common subgraph sampling
• scientific article; zbMATH DE number 1950771 (Why is no real title available?)
• An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
• kLog: a language for logical and relational learning with kernels
• Recent advances in graph-based pattern recognition with applications in document analysis
• Kernels and distances for structured data
• The GeometricKernels package: heat and Matérn kernels for geometric learning on manifolds, meshes, and graphs
• Weighted partition consensus via kernels

This page was built for publication: Kernels for Structured Data

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