Kernels for Structured Data

DOI10.1142/6855zbMATH Open1168.68039OpenAlexW4300177848MaRDI QIDQ3528031FDOQ3528031

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

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

zbMATH Keywords

kernel methodssupport vector machineskernel functionsstructured datamachine learning problemsdata kernels

Mathematics Subject Classification ID

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

Cited In (12)

• Structure spaces
• New efficient algorithms for multiple change-point detection with reproducing kernels
• Improving Graph Classification by Isomap
• Recent advances in graph-based pattern recognition with applications in document analysis
• Kernels and distances for structured data
• Title not available (Why is that?)
• Effective feature construction by maximum common subgraph sampling
• An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
• kLog: a language for logical and relational learning with kernels
• Weighted partition consensus via kernels
• A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
• The graph matching problem

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)