Linear-time algorithms for the subpath kernel

DOI10.4230/LIPICS.CPM.2018.22zbMATH Open1497.68555OpenAlexW2803142167MaRDI QIDQ5140787FDOQ5140787

Authors: Taichi Ishikawa, Kil-Ho Shin 

Publication date: 16 December 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.CPM.2018.22

Recommendations

• The weight function in the subtree kernel is decisive
• Approximate tree kernels
• On simply structured bases of tree kernels
• Graph kernels
• On graph kernels: hardness results and efficient alternatives.

zbMATH Keywords

treesuffix treesubpath kernel

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Data structures (68P05) Nonnumerical algorithms (68W05)

Cites Work

• XRules: an effective algorithm for structural classification of XML data
• Statistical comparisons of classifiers over multiple data sets
• Title not available (Why is that?)
• The Tree-to-Tree Correction Problem

Cited In (6)

• The weight function in the subtree kernel is decisive
• Title not available (Why is that?)
• Fast support vector machines for convolution tree kernels
• 10.1162/1532443041424328
• A subpath kernel for learning hierarchical image representations
• Approximate tree kernels

Uses Software

• LIBSVM
• XRules

This page was built for publication: Linear-time algorithms for the subpath kernel

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