The Lumberjack Algorithm for Learning Linked Decision Forests [chapter]

William T. B. Uther, Manuela M. Veloso
2000 Lecture Notes in Computer Science  
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 a supervised learning algorithm, Lumberjack, that uses the new representation. We then show
more » ... ically that Lumberjack improves generalization accuracy on hierarchically decomposable concepts.
doi:10.1007/3-540-44533-1_19 fatcat:ta3dbuuma5dizdldtcgqxzwvyi