The decision list machine

Advances in Neural Information Processing Systems

Volumn , Issue , 2003, Pages

  Sokolova, Marina ^a   Marchand, Mario ^a   Japkowicz, Nathalie ^a   Shawe Taylor, John ^b  

^a UNIVERSITY OF OTTAWA   (Canada)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION LIST MACHINES; DECISION LISTS; GENERALIZATION ERROR; SET COVERING MACHINES; TRAINING DATA;

CLASSIFICATION (OF INFORMATION);

EID: 84898983029     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Aditi Dhagat and Lisa Hellerstein. PAC learning with irrelevant attributes. In Proc. of the 35rd Annual Symposium on Foundations of Computer Science, pages 64-74. IEEE Computer Society Press, Los Alamitos, CA, 1994.
2. Sally Floyd and Manfred Warmuth. Sample compression, learnability, and the Vapnik-Chervonenkis dimension. Machine Learning, 21(3):269-304, 1995.
3. N. Littlestone and M. Warmuth. Relating data compression and learnability. Technical report, University of California Santa Cruz, 1986.
4. Mario Marchand and Mostefa Golea. On learning simple neural concepts: from halfspace intersections to neural decision lists. Network: Computation in Neural Systems, 4:67-85, 1993.
5. Mario Marchand and John Shawe-Taylor. Learning with the set covering machine. Proceedings of the Eighteenth International Conference on Machine Learning (ICML 2001), pages 345-352, 2001.
6. Mario Marchand and John Shawe-Taylor. The set covering machine. Journal of Machine Learning Reasearch (to appear), 2002.
7. Ronald L. Rivest. Learning decision lists. Machine Learning, 2:229-246, 1987. Canada