Decision list

Decision lists are a representation for Boolean functions which can be easily learnable from examples.^[1] Single term decision lists are more expressive than disjunctions and conjunctions; however, 1-term decision lists are less expressive than the general disjunctive normal form and the conjunctive normal form.

The language specified by a k-length decision list includes as a subset the language specified by a k-depth decision tree.

Learning decision lists can be used for attribute efficient learning.^[2]

^ Ronald L. Rivest (Nov 1987). "Learning decision lists" (PDF). Machine Learning. 2 (3): 229–246. doi:10.1023/A:1022607331053.
^ Adam R. Klivans and Rocco A. Servedio, "Toward Attribute Efficient Learning of Decision Lists and Parities", Journal of Machine Learning Research 7:12:587-602 ACM Digital Library full text

[1] Ronald L. Rivest (Nov 1987). "Learning decision lists" (PDF). Machine Learning. 2 (3): 229–246. doi:10.1023/A:1022607331053.

[2] Adam R. Klivans and Rocco A. Servedio, "Toward Attribute Efficient Learning of Decision Lists and Parities", Journal of Machine Learning Research 7:12:587-602 ACM Digital Library full text

[1]

[2]