Oblivious Decision Trees, Graphs, and Top-Down Pruning

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2, Issue , 1995, Pages 1071-1077

  Kohavi, Ron ^a   Li, Chia Hsin ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; MERGING;

DECISION GRAPHS; MUTUAL INFORMATIONS; TOPDOWN; TREE GRAPH; TREE TOPS;

DECISION TREES;

EID: 85168103975     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Breiman, L , Friedman, J H , Olshen, R A& Stonp, C J (1984), Classification and Regression Trees, Wadsworth International Group
2. Bryant, R E (1986), 'Graph-based algorithms for boolean function manipulation , IEEE Transac tions on Computers C-35(8), G77-691
3. Cover, T M & Thomas, J A (1991) Elements of Information Theory, John Wiley & Sons lnc
4. Fayyad, U M (1991), On the induction of decision trees for multiple concept learning PhD thesis EECS Dept, Michigan University
5. Fayyad U M (1994), Branching on attribute values in decision tree generation, in Proceedings of the twelfth national conference on artificial intelligence AAA! Press and MIT Press pp 601-606
6. Fayyad U M & Irani, K B (1993), Multi-interval dis- cretization of continuous attributes for classification learning, in R Bajcsy, ed "Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence' , Morgan Kaufmann
7. Kohavi, R (1994a), Bottom-up induction of oblivious, read-once decision graphs in "Proceedings of the European Conference on Machine Learning"Available by anonymous ftp from starry Stanford EDU pub/ronnyk/suroHL94 ps
8. Kohavi, R (19946), Bottom up induction of oblivious read-once decision graphs strengths and limitations, in "Twelfth National Conference on Artificial Intelligence pp 613-618 Available by anonymous ftp from Starry Stanford EDU pub/ronnyk/aaai94 pa
9. Murph P M & Aha D W (1994), UCI repository of machine learning databases For information contact ml-repositorv'QJics uci cdu
10. Pagallo, G & Ilaussler D (1990), Boolean feature discovery in empirical learning ' Machine Learning 5,71-99
11. Quinlan, J R (1993), C4 5 Proqrams for Machine Learning Morgan Kaufmann, Los Alios, California
12. Spackman, A K (1988) Learning c ategoncal criteria in biomedical domains, in Proceedings of the Fifth lnternati )nal Machine Learning ( onference , Morgan Kaufmann, pp 36-46
13. Thrun etal (1991) The monk s problems A performance comparison of different learning algorithms Technical Report (. MU-CS-01-197 Carnegie Mellon University