Learning decision trees from random examples
- 1 September 1989
- journal article
- Published by Elsevier BV in Information and Computation
- Vol. 82 (3), 231-246
- https://doi.org/10.1016/0890-5401(89)90001-1
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Inferring decision trees using the minimum description lenght principleInformation and Computation, 1989
- Computational limitations on learning from examplesJournal of the ACM, 1988
- Quantifying inductive bias: AI learning algorithms and Valiant's learning frameworkArtificial Intelligence, 1988
- Learning quickly when irrelevant attributes abound: A new linear-threshold algorithmMachine Learning, 1988
- Learning decision listsMachine Learning, 1987
- Occam's RazorInformation Processing Letters, 1987
- Induction of decision treesMachine Learning, 1986
- A theory of the learnableCommunications of the ACM, 1984