Decision Tree Induction Based on Efficient Tree Restructuring

Authors:
P. Utgoff
Affiliations:
-
Venue:
Decision Tree Induction Based on Efficient Tree Restructuring
Year:
1995

Citing 0
Cited 4

Multi-Layer Hierarchical Rule Learning in Reactive Robot Control Using Incremental Decision Trees

Journal of Intelligent and Robotic Systems
A review of machine learning

The Knowledge Engineering Review
Becoming incrementally reactive: on-line learning of an evolving decision tree array for robot navigation

Robotica
Discovery of Significant Classification Rules from Incrementally Inducted Decision Tree Ensemble for Diagnosis of Disease

ADMA '09 Proceedings of the 5th International Conference on Advanced Data Mining and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The ability to restructure a decision tree efficiently enables a variety of approaches to decision tree induction that would otherwise be prohibitively expensive. This report describes two such approaches, one being incremental tree induction, and the other being non-incremental tree induction using a measure of tree quality instead of test quality. The algorithm ITI for incremental tree induction includes several significant advances from its predecessor ID5R, and the algorithm DMTI for employing a direct metric of tree quality is entirely new.