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

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

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

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 bounds; sample compression; bound minimization; margin-sparsity trade-off; set-covering machine

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

68T05: Learning and adaptive systems in artificial intelligence

Related Items

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item