Inferring decision trees using the minimum description lenght principle

Information and Computation

Volumn 80, Issue 3, 1989, Pages 227-248

  Ross Quinlan, J ^a   Rivest, Ronald L ^b  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; DECISION THEORY AND ANALYSIS; MATHEMATICAL TECHNIQUES--TREES;

COMPLEXITY OF ALGORITHMS; DECISION TREES;

AUTOMATA THEORY;

EID: 0024627518     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/0890-5401(89)90010-2     Document Type: Article

References (15)

1. An information measure for hierarchic classification
2. An information measure for single-link classification
3. A general selection criterion for inductive inference
4. Minimum Information Estimation of Structure
5. Constructing optimal binary decision trees is NP-complete
6. Induction of decision trees
7. Simplifying decision trees
8. Modeling by shortest data description
9. Stochastic complexity and modeling
10. A universal prior for integers and estimation by minimum description lenght
11. Universal modeling and coding
12. An information measure for classification