A survey of cost-sensitive decision tree induction algorithms
From MaRDI portal
Recommendations
Cited in
(17)- Correction to: ``Trading off worst and expected cost in decision tree problems
- Cost-sensitive learning and decision making revisited
- Unification: A case-study in data refinement
- Using POMDPs for learning cost sensitive decision trees
- Algorithms for learning parsimonious context trees
- Reusable components in decision tree induction algorithms
- Learning ELM-tree from big data based on uncertainty reduction
- Cost-sensitive decision tree induction with label-dependent late constraints
- Cost-sensitive learning and decision making for massachusetts pip claim fraud data
- Anytime learning of decision trees
- Anytime induction of low-cost, low-error classifiers: a sampling-based approach
- Adding Value to Induced Decision Trees for Time-Sensitive Data
- scientific article; zbMATH DE number 2000826 (Why is no real title available?)
- scientific article; zbMATH DE number 1881093 (Why is no real title available?)
- scientific article; zbMATH DE number 6262887 (Why is no real title available?)
- Combining fuzzy partitioning and incremental methods to construct a scalable decision tree on large datasets
- Cost-sensitive ensemble learning: a unifying framework
This page was built for publication: A survey of cost-sensitive decision tree induction algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2875106)
