(Enter summary)
Abstract: This paper introduces a new representation for Boolean functions, called decision lists, (Update)
Cited by: More
Hierarchical Wrapper Induction for Semistructured.. - Ion Muslea Steven
(Correct)
Toward Attribute Efficient Learning of Decision Lists and.. - Klivans, Servedio (2006)
(Correct)
Journal of Machine Learning Research 7 (2006) 55--83.. - Michael Schmitt..
(Correct)
Active bibliography (related documents): More All
0.1: Automated Modeling and Nonlinear Axis Scaling - Leejay Wu (2005)
(Correct)
0.0: Using the Minimum Description Length Principle to.. - Oliveira.. (1996)
(Correct)
0.0: Part 1: Overview of the Probably Approximately Correct (PAC).. - Haussler (1995)
(Correct)
Similar documents based on text: More All
0.4: Learning Decision Lists - Ronald Rivest August (1987)
(Correct)
0.3: The Active KDL Object-Oriented Database System and .. - Miller, Potter.. (1991)
(Correct)
0.3: Model Instantiation for Query Driven Simulation in.. - Miller, Potter.. (1990)
(Correct)
Related documents from co-citation: More All
27: Programs for machine learning (context) - Quinlan - 1993
27: Communications of the ACM (context) - Valiant, of et al. - 1984
22: Induction of Decision Trees (context) - Quinlan - 1986
BibTeX entry: (Update)
R.L. Rivest. Learning decision lists. Machine Learning, 2(3):229--246, 1987. http://citeseer.ist.psu.edu/article/rivest87learning.html More
@article{ rivest87learning,
author = "Ronald L. Rivest",
title = "Learning Decision Lists",
journal = "Machine Learning",
volume = "2",
number = "3",
pages = "229-246",
year = "1987",
url = "citeseer.ist.psu.edu/article/rivest87learning.html" }
Citations (may not include all citations):
493
Modeling by shortest data description (context) - Rissanen - 1978
162
Simplifying decision trees
- Quinlan
144
Computational Limitations on Learning from Examples (context) - Pitt, Valiant - 1986
96
Occam's Razor (context) - Blumer, Ehrenfeucht et al. - 1987
78
the learnability of boolean formulae
- Kearns, Li et al. - 1987
48
Classifying learnable geometric concepts with the Vapnik-Che.. (context) - Blumer, Ehrenfeucht et al. - 1986
22
the connection between the complexity and credibility of inf.. (context) - Pearl - 1978
16
Some NP-Complete Set-Covering Problems (context) - Masek - 1976
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.lcs.mit.edu/~rivest/publications.html): More
Picking the Best Expert from a Sequence - Bergman, Rivest (1995)
(Correct)
Game Tree Searching by Min/Max Approximation - Rivest (1995)
(Correct)
Complete Variable-Length "Fix-Free" Codes - Gillman, Rivest (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC