Tree decomposition for large-scale SVM problems

MaRDI QIDQ2896172zbMATH OpenFDO

Authors Fu Chang, Chien-Yang Guo, Xiao-Rong Lin, Chi-Jen Lu

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/chang10b.html

zbMATH Keywords

binary treegeneralization error ïboundmargin-based theorypattern classificationsupport vector machinetree decompositionVC theory

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A fast SVM classification method based on a decision tree
• Core vector machines: fast SVM training on very large data sets
• The support vector tree
• A Parallel Mixture of SVMs for Very Large Scale Problems
• scientific article; zbMATH DE number 2087272

Cited in

(9)

• General twin support vector machine with pinball loss function
• A fast reduced kernel extreme learning machine
• A fast SVD-hidden-nodes based extreme learning machine for large-scale data analytics
• Learning with deep cascades
• Hierarchical linear support vector machine
• Histogram transform ensembles for large-scale regression
• Advances in Neural Networks – ISNN 2005
• On multivariate randomized classification trees: \(l_0\)-based sparsity, VC dimension and decomposition methods
• Tracking full posterior in online Bayesian classification learning: a particle filter approach

Describes a project that uses

Uses Software

• LIBLINEAR

This page was built for publication: Tree decomposition for large-scale SVM problems

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