The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A survey of cost-sensitive decision tree induction algorithms
Open accessAbstract
The past decade has seen a significant interest on the problem of inducing decision trees that take account of costs of misclassification and costs of acquiring the features used for decision making. This survey identifies over 50 algorithms including approaches that are direct adaptations of accuracy-based methods, use genetic algorithms, use anytime methods and utilize boosting and bagging. The survey brings together these different studies and novel approaches to cost-sensitive decision tree learning, provides a useful taxonomy, a historical timeline of how the field has developed and should provide a useful reference point for future research in this field.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Quinlan, J. R. (1987) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(87)80053-6 · Cited by 2,553 · cited 4×
“Figure 1 Decision Tree after ID3 has been applied to the data set in Table 1 The third reason is that noisy, sparse or incomplete data sets can cause very complex decision trees, so pruning is a good way to simplify them [Quinlan 1987].”
BackgroundMethodInfluentialCost-sensitive learning by cost-proportionate example weighting
Zadrozny, B., Langford, J., & Abe, N. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250950 · Cited by 680
Cited by
Recent advances in decision trees: an updated survey
Costa, V. G., & Pedreira, C. E. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10275-5 · Cited by 572
Kovács, G. (2019) · Applied Soft Computing · doi:10.1016/j.asoc.2019.105662 · Cited by 289
Knowledge Learning With Crowdsourcing: A Brief Review and Systematic Perspective
Zhang, J. (2022) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2022.105434 · Cited by 66
“To take advantage of full noisy labels, Sheng [85] proposed five label utilization strategies for weakly supervised learning, which utilized the fact that some learning algorithms such as costsensitive decision trees [86] and neural networks can accept weights for training instances.”
BackgroundUsing POMDPs for learning cost sensitive decision trees
Maliah, S., & Shani, G. (2021) · Artificial Intelligence · doi:10.1016/j.artint.2020.103400 · Cited by 12
Metadata
- Authors
- Lomax, S., & Vadera, S.
- Venue
- ACM Computing Surveys
- Published
- 2013-02
- Volume
- 45
- Issue
- 2
- Pages
- 1-35
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2005530589
- Cited by
- 193
- References
- 4
- FWCI
- 59.46
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.