DMCA
Interruptible anytime algorithms for iterative improvement of decision trees (2005)
Cached
Download Links
| Venue: | In Proceedings of Workshop on the Utility-Based Data Mining (UBDM-2005), held with The 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'05 |
| Citations: | 4 - 0 self |
BibTeX
@INPROCEEDINGS{Esmeir05interruptibleanytime,
author = {Saher Esmeir},
title = {Interruptible anytime algorithms for iterative improvement of decision trees},
booktitle = {In Proceedings of Workshop on the Utility-Based Data Mining (UBDM-2005), held with The 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'05},
year = {2005}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Finding a minimal decision tree consistent with the examples is an NP-complete problem. Therefore, most of the existing algorithms for decision tree induction use a greedy approach based on local heuristics. These algorithms usually require a fixed small amount of time and result in trees that are not globally optimal. Recently, the LSID3 contract anytime algorithm was introduced to allow using extra resources for building better decision trees. A contract anytime algorithm needs to get its resource allocation a priori. In many cases, however, the time allocation is not known in advance, disallowing the use of contract algorithms. To overcome this problem, in this work we present two interruptible anytime algorithms for inducing decision trees. Interruptible anytime algorithms do not require their resource allocation in advance and thus must be ready to be interrupted and return a valid solution at any moment. The first interruptible algorithm we propose is based on a general technique for converting a contract algorithm to an interruptible one by sequencing. The second is an iterative improvement algorithm that repeatedly selects a subtree whose reconstruction is estimated to yield the highest marginal utility and rebuilds it with higher resource allocation. Empirical evaluation shows a good anytime behavior for both algorithms. The iterative improvement algorithm shows smoother performance profiles which allow more refined control.
Keyphrases
decision tree interruptible anytime algorithm iterative improvement resource allocation contract algorithm iterative improvement algorithm time allocation valid solution contract anytime algorithm need fixed small amount marginal utility many case lsid3 contract minimal decision tree consistent decision tree induction good anytime behavior performance profile extra resource greedy approach refined control np-complete problem local heuristic general technique first interruptible algorithm empirical evaluation
