Learning Decision Lists

@article{Rivest2005LearningDL,
  title={Learning Decision Lists},
  author={R. Rivest},
  journal={Machine Learning},
  year={2005},
  volume={2},
  pages={229-246}
}
  • R. Rivest
  • Published 2005
  • Mathematics
  • Machine Learning
This paper introduces a new representation for Boolean functions, called decision lists, and shows that they are efficiently learnable from examples. More precisely, this result is established for k-;DL – the set of decision lists with conjunctive clauses of size k at each decision. Since k-DL properly includes other well-known techniques for representing Boolean functions such as k-CNF (formulae in conjunctive normal form with at most k literals per clause), k-DNF (formulae in disjunctive… Expand
334 Citations

Figures and Tables from this paper

Toward Attribute Efficient Learning of Decision Lists and Parities
  • 70
  • PDF
An Algebraic Perspective on Boolean Function Learning
  • 10
  • PDF
Learning Conjunctions of Horn Clauses
  • 1
  • PDF
Research Note on Decision Lists
  • 1
  • PDF
On the isomorphism problem for decision trees and decision lists
  • 2
Algebraic Characterizations of Small Classes of Boolean Functions
  • 16
  • Highly Influenced
Alkemy: A Learning System based on an Expressive Knowledge Representation Formalism
  • 3
  • Highly Influenced
Collisions Lead to Shallower Decision Trees
  • 1
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 11 REFERENCES
On the learnability of Boolean formulae
  • 339
  • PDF
Computational limitations on learning from examples
  • 558
  • PDF
A theory of the learnable
  • 1,783
  • Highly Influential
  • PDF
Induction of Decision Trees
  • 13,008
  • Highly Influential
  • PDF
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
  • 205
  • Highly Influential
  • PDF
Generating Production Rules from Decision Trees
  • 550
  • PDF
ON THE CONNECTION BETWEEN THE COMPLEXITY AND CREDIBILITY OF INFERRED MODELS
  • 113
  • PDF
Occam's Razor
  • 655
Modeling By Shortest Data Description*
  • 6,052
  • PDF
Modeling by shortest data
  • description. Automatica,
  • 1978
...
1
2
...