A compression approach to support vector model selection

MaRDI QIDQ3093187zbMATH OpenFDO

Authors Ulrike Von Luxburg, Olivier Bousquet, Bernhard Schölkopf

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v5/luxburg04a.html

zbMATH Keywords

compression coefficientminimum description lengthmodel selectionsupport vector machine

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Statistical performance of support vector machines
• Choosing multiple parameters for support vector machines
• Support-vector networks
• SVM Model Selection with the VC Bound
• Adaptive kernels for support vector classification

Cited in

(14)

• Kernel selection with spectral perturbation stability of kernel matrix
• Selecting the length of a principal curve within a Gaussian model
• Learning the set covering machine by bound minimization and margin-sparsity trade-off
• Some new maximum VC classes
• scientific article; zbMATH DE number 1700013 (Why is no real title available?)
• Reconstructing a sparse solution from a compressed support vector machine
• Compression method based on training dataset of SVM
• On the suitable domain for SVM training in image coding
• scientific article; zbMATH DE number 5957476 (Why is no real title available?)
• Classification via Minimum Incremental Coding Length
• 10.1162/jmlr.2003.3.4-5.723
• Compressed classification learning with Markov chain samples
• Radius Margin Bounds for Support Vector Machines with the RBF Kernel
• SVM Model Selection with the VC Bound

This page was built for publication: A compression approach to support vector model selection

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