On online learning of decision lists

Journal of Machine Learning Research

Volumn 3, Issue 2, 2003, Pages 271-301

  Nevo, Ziv ^a   El Yaniv, Ran ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FEATURE EXTRACTION; LEARNING ALGORITHMS; ONLINE SYSTEMS; THEOREM PROVING;

DECISION LISTS;

LEARNING SYSTEMS;

EID: 0041965972     PISSN: 15324435     EISSN: None     Source Type: Journal    
DOI: 10.1162/153244303765208395     Document Type: Article

References (18)

1. Dana Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, 1988
2. Martin Anthony and Norman Biggs. Computational Learning Theory: An Introduction, Cambridge University Press, Cambridge, 1992
3. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K. Warmuth. Occam's Razor. Information Processing Letters, 24:377-380, 1987.
4. Avrim Blum. Rank-r decision trees are a subclass of r-decision lists. Information Processing Letters, 42(4):183-185, 1992.
5. Avrim Blum. On-line algorithms in machine learning. In Proceedings of the Work-shop on On-Line Algorithms, Dagstuhl, June 1996. Available electronically at http://www-2.cs.emu.edu/̃avrim
6. Avrim Blum, Lisa Hellerstein, and Nicholas Littlstone. Learning in the presence of finitely or infintely many irrelevant attributes. Journal of Computer and System Sciences, 50(1) :32-40, 1995.
7. Avrim Blum and Mona Singh, Learning functions of k terms. In Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 144-153, Morgan Kaufmann, 1990.
8. Nader H. Bshouty and Lisa Hellerstein. Attribute-efficient learning in query and mistake-bound models. Journal of Computer and System Sciences, 56:310-319, 1998.
9. Aditi Dhagat and Lisa Hellerstein. PAC learning with irrelevant attributes. In Proceedings of the IEEE symposium on Foundation of Computer Science, pages 67-74, Santa Fe, New Mexico, 1994.
10. Thomas Eiter, Toshihide Ibaraki, and Kazuhisa Makino. Decision lists and related boolean functions. Research Report 9804, Institute of Informatics, University of Giessen, 1998.
11. David Guijarro, Victor Lavin and Vijay Raghavan. Monotone term decision lists. Theoretical Computer Science, 259(1-2):549-575, 2001.
12. David Helmbold, Robert Sloan, and Manfred K. Warmuth. Learning nested differences of intersection closed concept classes. Machine Learning, 5(2): 165-196, 1990.
13. Nicholas Littlestone. Learning when irrelevant attributes abound: a new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
14. Nicholas Littlestone. Mistake Bounds and Logarithmic Linear-Threshold Learning Algorithms. PhD thesis, University of California, Santa Cruz, March 1989.
15. Ronald L. Rivest. Learning decision lists. Machine Learning, 2(3):229-246, 1987.
16. Rocco A. Servadio. Computational sample complexity and attribute efficient learning. Journal of Computer and System Sciences, 60(1):161-178, 2000.
17. Leslie G. Valiant. A theory of the learnable. Communications of the ACM, 27(11) :1134-1142, 1984.
18. Leslie G. Valiant. Projection learning. Machine Learning, 37(2):115-130, 1999.