Using the minimum description length principle to infer reduced ordered decision graphs

Machine Learning

Volumn 25, Issue 1, 1996, Pages 23-50

  Oliveira, Arlindo L ^a   Sangiovanni Vincentelli, Alberto ^b  

^a INESC   (Portugal)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Decision trees; Inductive learning; MDL principle

Indexed keywords

BOOLEAN FUNCTIONS; DECISION THEORY; DESCRIBING FUNCTIONS; GRAPH THEORY; HEURISTIC METHODS; LEARNING ALGORITHMS; TREES (MATHEMATICS);

INDUCTIVE LEARNING; MINIMUM DESCRIPTION LENGTH (MDL) PRINCIPLE; REDUCED ORDER DECISION GRAPHS;

LEARNING SYSTEMS;

EID: 0030263540     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf00115299     Document Type: Article

References (8)

1. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1987). Occam's razor. Information Processing Letters, 24, 377-380.
2. Brayton, R. K., Hachtel, G. D., & Vincentelli, A. S. (1990). Multilevel logic synthesis. Proceedings of the IEEE, 78, 264-300.
3. Friedman, S. J. & Supowit, K. J. (1990). Finding the optimal variable ordering for binary decision diagrams. IEEE Transactions on Computers, 39, 710-713.
4. Pagallo, G. & Haussler, D. (1990). Boolean feature discovery in empirical learning. Machine Learning, 5, 71-100.
5. Pearl, J. (1978). On the connection between the complexity and credibility of inferred models. Journal of General Systems, 4, 255-264.
6. Quinlan, J. R. (1986). Induction of decision trees. Machine Learning, 1, 81-106.
7. Rissanen, J. (1978). Modeling by shortest data description. Automatica, 14, 465-471.
8. Rissanen, J. (1986). Stochastic complexity and modeling. Annals of Statististics, 14, 1080-1100.