Anytime learning of decision trees

MaRDI QIDQ3174106zbMATH OpenFDO

Authors Saher Esmeir, S. Markovitch

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v8/esmeir07a.html

zbMATH Keywords

anytime algorithmsdecision tree inductionhard conceptslookaheadresource-bounded reasoning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Anytime induction of low-cost, low-error classifiers: a sampling-based approach
• Anytime classification for a pool of instances
• A survey of cost-sensitive decision tree induction algorithms
• Building decision trees
• Decision tree induction based on efficient tree restructuring

Cited in

(8)

• Classifying under computational resource constraints: anytime classification using probabilistic estimators
• Tree-based reinforcement learning for estimating optimal dynamic treatment regimes
• Anytime classification for a pool of instances
• An eager splitting strategy for online decision trees in ensembles
• Cost-sensitive decision tree induction with label-dependent late constraints
• Anytime induction of low-cost, low-error classifiers: a sampling-based approach
• Optimal classification trees
• An integrated data envelopment analysis and regression tree method for new product price estimation

This page was built for publication: Anytime learning of decision trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174106)