Anytime induction of low-cost, low-error classifiers: a sampling-based approach

MaRDI QIDQ3624157zbMATH OpenFDO

Authors Saher Esmeir, S. Markovitch

Publication date 28 April 2009

Full work available at URL https://arxiv.org/abs/1401.3447

zbMATH Keywords

anytime cost-sensitive tree learner

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Anytime learning of decision trees
• Anytime classification for a pool of instances
• Classifying under computational resource constraints: anytime classification using probabilistic estimators
• A survey of cost-sensitive decision tree induction algorithms
• scientific article; zbMATH DE number 2000826

Cited in

(5)

• Classifying under computational resource constraints: anytime classification using probabilistic estimators
• Anytime classification for a pool of instances
• Using POMDPs for learning cost sensitive decision trees
• Cost-sensitive decision tree induction with label-dependent late constraints
• Anytime learning of decision trees

This page was built for publication: Anytime induction of low-cost, low-error classifiers: a sampling-based approach

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