ML Anthology

Margin-Sparsity Trade-Off for the Set Covering Machine

François Laviolette, Mario Marchand, Mohak Shah
ECML-PKDD 2005 pp. 206-217
doi:10.1007/11564096_23 /ecmlpkdd/2005/laviolette2005ecml-marginsparsity/

Abstract

We propose a new learning algorithm for the set covering machine and a tight data-compression risk bound that the learner can use for choosing the appropriate tradeoff between the sparsity of a classifier and the magnitude of its separating margin.

PDF ECML-PKDD Semantic Scholar

Cite

Text

Laviolette et al. "Margin-Sparsity Trade-Off for the Set Covering Machine." European Conference on Machine Learning, 2005. doi:10.1007/11564096_23

Markdown

[Laviolette et al. "Margin-Sparsity Trade-Off for the Set Covering Machine." European Conference on Machine Learning, 2005.](https://mlanthology.org/ecmlpkdd/2005/laviolette2005ecml-marginsparsity/) doi:10.1007/11564096_23

BibTeX

@inproceedings{laviolette2005ecml-marginsparsity,
  title     = {{Margin-Sparsity Trade-Off for the Set Covering Machine}},
  author    = {Laviolette, François and Marchand, Mario and Shah, Mohak},
  booktitle = {European Conference on Machine Learning},
  year      = {2005},
  pages     = {206-217},
  doi       = {10.1007/11564096_23},
  url       = {https://mlanthology.org/ecmlpkdd/2005/laviolette2005ecml-marginsparsity/}
}