Rank-r decision trees are a subclass of r-decision lists
Author:
- Avrim BlumABAvrim Blum
- 1 June 1992
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 42 (4) , 183-185
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Learning decision trees from random examplesInformation and Computation, 1989
- LEARNING NESTED DIFFERENCES OF INTERSECTION-CLOSED CONCEPT CLASSES1989
- Learning decision listsMachine Learning, 1987
- On the learnability of Boolean formulae1987
- A theory of the learnableCommunications of the ACM, 1984
- Some special vapnik-chervonenkis classesDiscrete Mathematics, 1981