research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Article
Entered by:chita
TitleConsolidating a Heuristic for Incremental Decision Tree Learning through asymptotic Analysis
Bibtex cite IDRACTI-RU1-2011-80
Journal International Journal on Artificial Intelligence Tools
Year published 2011
Volume 20
Number 1
Pages 29-52
DOI 10.1142/s0218213011000024
Keywords Decision trees,incremental induction,approximation,asymptotic analysis,heuristic
This paper addresses stability issues in incremental induction of decision trees. Stability problems arise when an induction algorithm must revise a decision tree very often and oscillations between similar concepts decrease learning speed. We review a heuristic that solves this problem and subsequently employ asymptotic analysis to approximate the basic parameters related to the estimation of computational effort in incremental learning of decision trees. We then use these approximations to simplify the heuristic, we deliver insight into its amortizing behavior and argue how they can also speed-up its execution and enhance its applicability, also providing experimental evidence to support these claims.
Kalles, D.
Papagelis, Athanasios
Stamatiou, Yannis
Publication ID934