Approximate tree kernels

MaRDI QIDQ2896041zbMATH OpenFDO

Authors Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Robert Müller

Publication date 13 July 2012

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Full work available at URL http://www.jmlr.org/papers/v11/rieck10a.html

zbMATH Keywords

approximationconvolution kernelskernel methodstree kernels

Mathematics Subject Classification ID

Trees (05C05) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Data structures (68P05) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Fast support vector machines for convolution tree kernels
• Linear-time algorithms for the subpath kernel
• The weight function in the subtree kernel is decisive
• Graph kernels
• On graph kernels: hardness results and efficient alternatives.

Cited in

(8)

• Fast support vector machines for convolution tree kernels
• How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
• On simply structured bases of tree kernels
• Kernel(s) for problems with no kernel
• The weight function in the subtree kernel is decisive
• Linear-time algorithms for the subpath kernel
• scientific article; zbMATH DE number 6739965 (Why is no real title available?)
• Characterization of the average tree solution and its kernel

This page was built for publication: Approximate tree kernels

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