Learning the set covering machine by bound minimization and margin-sparsity trade-off

DOI10.1007/s10994-009-5137-3zbMath1470.68133OpenAlexW2013029345MaRDI QIDQ1959549

François Laviolette, Sara Shanian, Mario Marchand, Mohak Shah

Publication date: 7 October 2010

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-009-5137-3

zbMATH Keywords

risk boundssample compressionbound minimizationmargin-sparsity trade-offset-covering machine

Mathematics Subject Classification ID

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

Related Items (2)

Hierarchical linear support vector machine ⋮ On the fusion of threshold classifiers for categorization and dimensionality reduction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
• Occam's razor
• Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes
• PAC-Bayesian stochastic model selection
• A theory of the learnable
• A Greedy Heuristic for the Set-Covering Problem
• Rademacher averages and phase transitions in Glivenko-Cantelli classes
• 10.1162/jmlr.2003.3.4-5.723
• Learning Theory and Kernel Machines
• PAC-Bayesian compression bounds on the prediction error of learning algorithms for classification

This page was built for publication: Learning the set covering machine by bound minimization and margin-sparsity trade-off