STABLE DECISION TREES: USING LOCAL ANARCHY FOR EFFICIENT INCREMENTAL LEARNING

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 2000 English Publisher:World Scientific Pub Co Pte LtJournal:International Journal on Artificial Intelligence Tools, volume 9, pages 79-95 (issn: 0218-2130, eissn: 1793-6349,

Copyright policy )

Authors: Dimitrios Kalles; Athanassios Papagelis;

doi: 10.1142/s0218213000000070

STABLE DECISION TREES: USING LOCAL ANARCHY FOR EFFICIENT INCREMENTAL LEARNING

- Summary
- Metrics

Abstract

This work deals with stability 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 introduce a heuristic and an algorithm with theoretical and experimental backing to tackle this problem.

Related Organizations

Research Academic Computer Technology Institute
Greece

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	10
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average