This paper proposes a method to improve ID5R, an incremental TDIDT algorithm. The new method evaluates the quality of attributes selected at the nodes of a decision tree and estimates a minimum number of steps for which these attributes are guaranteed such a selection. This results in reducing overheads during incremental learning. The method is supported by theoretical analysis and experimental results. © 1994, Kluwer Academic Publishers. All rights reserved.
CITATION STYLE
Kalles, D., & Morris, T. (1994). Efficient Incremental Induction of Decision Trees. Machine Learning, 24(3), 231–242. https://doi.org/10.1023/A:1018295910873
Mendeley helps you to discover research relevant for your work.