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

DOI10.1007/S10994-009-5137-3zbMATH Open1470.68133OpenAlexW2013029345MaRDI QIDQ1959549FDOQ1959549

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)

Cites Work

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

Cited In (3)

• Hierarchical linear support vector machine
• On the fusion of threshold classifiers for categorization and dimensionality reduction
• Learning Reductions to Sparse Sets

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

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