The Lumberjack Algorithm for Learning Linked Decision Forests

Authors:
William T. B. Uther;Manuela M. Veloso
Affiliations:
-;-
Venue:
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Year:
2000

Citing 12
Cited 0

Inferring decision trees using the minimum description length principle

Information and Computation
Boolean Feature Discovery in Empirical Learning

Machine Learning
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
C4.5: programs for machine learning

C4.5: programs for machine learning
Coding Decision Trees

Machine Learning
Wrappers for performance enhancement and oblivious decision graphs

Wrappers for performance enhancement and oblivious decision graphs
Tree based discretization for continuous state space reinforcement learning

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Data compression via textual substitution

Journal of the ACM (JACM)
Reinforcement learning with selective perception and hidden state

Reinforcement learning with selective perception and hidden state
Exploring the decision forest: an empirical investigation of Occam's razor in decision tree induction

Journal of Artificial Intelligence Research
Identifying hierarchical structure in sequences: a linear-time algorithm

Journal of Artificial Intelligence Research
Input generalization in delayed reinforcement learning: an algorithm and performance comparisons

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

While the decision tree is an effective representation that has been used in many domains, a tree can often encode a concept inefficiently. This happens when the tree has to represent a subconcept multiple times in different parts of the tree. In this paper we introduce a new representation based on trees, the linked decision forest, that does not need to repeat internal structure. We also introduce the Lumberjack algorithm for growing these forests in a supervised learning setting. Lumberjack induces new subconcepts from repeated internal structure. This allows Lumberjack to represent many concepts more efficiently than a normal tree structure. We then show empirically that Lumberjack improves generalization accuracy on these hierarchically decomposable concepts.