Margin-sparsity trade-off for the set covering machine

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3720 LNAI, Issue , 2005, Pages 206-217

  Laviolette, François ^a   Marchand, Mario ^a   Shah, Mohak ^b  

^a UNIVERSITÉ LAVAL   (Canada)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPRESSION; DATABASE SYSTEMS; LEARNING SYSTEMS; RISK ASSESSMENT;

MARGIN-SPARSITY; SEPARATING MARGIN; SET COVERING MACHINE; TRADEOFF;

LEARNING ALGORITHMS;

EID: 33646407546     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564096_23     Document Type: Conference Paper

References (15)

1. Shai Ben-David and A. Litman. Combinatorial variability of Vapnik-Chervonenkis classes. Discrete Applied Mathematics, 86 (1998) 3-25
2. Kristin P. Bennett. Combining support vector and mathematical programming methods for classifications. In B. Schölkopf, C. J. C. Burges, and A. J. Smola, editors, Advances in Kernel Methods-Support Vector Learning, MIT Press, Cambridge MA, (1999) 307-326.
3. Jinbo Bi, Kristin P. Bennett, Mark Embrechts, Kurt M. Breneman, and Minghu Song. Dimensionality reduction via sparse support vector machines. Journal of Machine Learning Reasearch, 3 (2003) 1229-1245
4. Avrim Blum and John Langford. PAC-MDL bounds. In Proceedings of 16th Annual Conference on Learning Theory, COLT 2003, Washington, DC, August 2003, volume 2777 of Lecture Notes in Artificial Intelligence, Springer, Berlin (2003) 344-357
5. B. E. Boser, I. M. Guyon, and V. N. Vapnik. A training algorithm for optimal margin classifiers. In Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory, ACM Press, (1992) 144-152
6. Sally Floyd and Manfred Warmuth. Sample compression, learnability, and the Vapnik-Chervonenkis dimension. Machine Learning, 213 (1995) 269-304
7. Thore Graepel, Ralf Herbrich, and John Shawe-Taylor. Generalisation error bounds for sparse linear classifiers. In Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (2000) 298-303
8. Thore Graepel, Ralf Herbrich, and Robert C. Williamson. From margin to sparsity. In Advances in neural information processing systems 13, (2001) 210-216
9. John Langford. Tutorial on practical prediction theory for classification. Journal of Machine Learning Reasearch, 3 (2005) 273-306.
10. N. Littlestone and M. Warmuth. Relating data compression and learnability. Technical report, University of California Santa Cruz, Santa Cruz, CA, (1986)
11. Mario Marchand and John Shawe-Taylor. The set covering machine. Journal of Machine Learning Reasearch, 3 (2002) 723-746.
12. Mario Marchand and Marina Sokolova. Learning with decision lists of data-dependent Features, Journal of Machine Learning Reasearch, 6 (2005) 427-451.
13. S. Mendelson. Rademacher averages and phase transitions in Glivenko-Cantelli class. IEEE Transactions on Information Theory, 48 (2002) 251-263
14. Vladimir N. Vapnik. Statistical Learning Theory. Wiley, New York, NY (1998)
15. Ulrike von Luxburg, Olivier Bousquet, and Bernhard Schölkopf. A compression approach to support vector model selection. Journal of Machine Learning Research, 5(2004) 293-323