Fast support vector machines for convolution tree kernels

DOI10.1007/S10618-012-0276-8MaRDI QIDQ1944994zbMATH OpenOpenAlexFDO

Authors Aliaksei Severyn, Alessandro Moschitti

Publication date 28 March 2013

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10618-012-0276-8

zbMATH Keywords

kernel methodsnatural language processinglarge scale learningtree kernels

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Natural language processing (68T50)

Recommendations

• Approximate tree kernels
• The support vector tree
• Large scale multiple kernel learning
• Faster Support Vector Machines
• Linear-time algorithms for the subpath kernel

Cites work

• scientific article; zbMATH DE number 1934539 (Why is no real title available?)
• 10.1162/153244303322533197
• 10.1162/1532443041827925
• Approximate tree kernels
• Fast support vector machines for convolution tree kernels
• Hash kernels for structured data
• Large margin methods for structured and interdependent output variables
• Sparse kernel SVMs via cutting-plane training

Cited in

(3)

• Approximate tree kernels
• A feature matching method: sparse feature tree
• Fast support vector machines for convolution tree kernels

Describes a project that uses

Uses Software

• Penn Treebank
• SVMlight

This page was built for publication: Fast support vector machines for convolution tree kernels

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