The lumberjack algorithm for learning linked decision forests

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1864, Issue , 2000, Pages 219-232

  Uther, William T B ^a   Veloso, Manuela M ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; DECISION TREES; FORESTRY;

DECISION FOREST; GENERALIZATION ACCURACY; INTERNAL STRUCTURE; TREE STRUCTURES;

LEARNING ALGORITHMS;

EID: 84942907035     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44914-0_13     Document Type: Conference Paper

References (17)

1. Breiman, Leo; Friedman, Jerome H.; Olshen, Richard A.; and Stone, Charles J. 1984. Classification And Regression Trees. Wadsworth and Brooks/Cole Advanced Books and Software, Monterey, CA.
2. Bryant, Randal E. 1992. Symbolic boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys 24(3):293-318.
3. Chapman, David and Kaelbling, Leslie Pack 1991. Input generalization in delayed reinforcement learning: An algorithm and performance comparisons. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI-91), Sydney, Australia. 726-731.
4. Kohavi, Ron 1995. Wrappers for Performance Enhancement and Oblivious Decision Graphs. Ph. d. Thesis, Department of Computer Science, Stanford University.
5. McCallum, Andrew Kachites 1995. Reinforcement Learning with Selective Perception and Hidden State. Ph. D. Dissertation, Department of Computer Science, University of Rochester.
6. Murphy, Patrick M. and Pazzani, Michael J. 1994. Exploring the decision forest: An empirical invesitgation of occam's razor in decision tree induction. Journal of Artificial Intelligence Research 1:257-275.
7. Nevill-Manning, Craig G. and Witten, Ian H. 1997. Identifying hierarchical structures in sequences: A linear-time algorithm. Journal of Artificial Intelligence Research 7:67-82.
8. Nevill-Manning, Craig G. 1996. Inferring Sequential Structure. Ph. d. Thesis, Computer Science, University of Waikato, Hamilton, New Zealand.
9. Oliver, J. andWallace, C. S. 1992. Inferring decision graphs. Technical Report 91/170, Department of Computer Science, Monash University.
10. Pagallo, Giulia and Haussler, David 1990. Boolean feature discovery in empirical learning. Machine Learning 5:71-99.
11. Quinlan, J. R. and Rivest, R. L. 1989. Inferring decision trees using the minimum description length principle. Information and Computation 80(3):227-248.
12. Quinlan, J. Ross 1992. C4. 5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA.
13. Rissanen, Jorma 1983. A universal prior for integers and estimation by minimum description length. The Annals of Statistics 11(2):416-431.
14. Storer, J. A. 1982. Data compression via textual substitution. Journal of the Association for Computing Machinery 29(4):928-951.
15. Uther, William T. B. and Veloso, Manuela M. 1998. Tree based discretization for continuous state space reinforcement learning. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98), Madison, WI. 769-774.
16. Wallace, C. S. and Boulton, D. M. 1968. An information measure for classification. Computer Journal 11(2):185-194.
17. Wallace, C. S. and Patrick, J. D. 1993. Coding decision trees. Machine Learning 11:7-22.