The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Example-dependent cost-sensitive decision trees
Open accessAbstract
Example-dependent cost-sensitive tree algorithm.Each example is assumed to have different financial cost.Application on credit card fraud detection, credit scoring and direct marketing.Focus on maximizing the financial savings instead of accuracy.Code is open source and available at albahnsen.com/CostSensitiveClassification. Several real-world classification problems are example-dependent cost-sensitive in nature, where the costs due to misclassification vary between examples. However, standard classification methods do not take these costs into account, and assume a constant cost of misclassification errors. State-of-the-art example-dependent cost-sensitive techniques only introduce the cost to the algorithm, either before or after training, therefore, leaving opportunities to investigate the potential impact of algorithms that take into account the real financial example-dependent costs during an algorithm training. In this paper, we propose an example-dependent cost-sensitive decision tree algorithm, by incorporating the different example-dependent costs into a new cost-based impurity measure and a new cost-based pruning criteria. Then, using three different databases, from three real-world applications: credit card fraud detection, credit scoring and direct marketing, we evaluate the proposed method. The results show that the proposed algorithm is the best performing method for all databases. Furthermore, when compared against a standard decision tree, our method builds significantly smaller trees in only a fifth of the time, while having a superior performance measured by cost savings, leading to a method that not only has more business-oriented results, but also a method that creates simpler models that are easier to analyze.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
Data mining for credit card fraud: a comparative study
Bhattacharyya, S., Jha, S., Tharakunnel, K., & Westland, J. C. (2011) · Decision Support Systems · doi:10.1016/j.dss.2010.08.008 · Cited by 1,108 · cited 2×
“, 2002), hybrid models (Krivko, 2010), support vector machines (Bhattacharyya et al., 2011) and random forest (Correa Bahnsen et al.”
BackgroundMethodStatistical Classification Methods in Consumer Credit Scoring: A Review
Hand, D. J., & Henley, W. E. (1997) · Journal of the Royal Statistical Society Series A: Statistics in Society · doi:10.1111/j.1467-985x.1997.00078.x · Cited by 1,042
Cost-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
Transaction aggregation as a strategy for credit card fraud detection
Whitrow, C., Hand, D. J., Juszczak, P., Weston, D., & Adams, N. M. (2009) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-008-0116-z · Cited by 337
Verbraken, T., Bravo, C., Weber, R., & Baesens, B. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2014.04.001 · Cited by 179
Cited by
Credit Card Fraud Detection: A Realistic Modeling and a Novel Learning Strategy
Dal Pozzolo, A., Boracchi, G., Caelen, O., Alippi, C., & Bontempi, G. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2736643 · Cited by 682
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
Sequence classification for credit-card fraud detection
Jurgovsky, J., Granitzer, M., Ziegler, K., Calabretto, S., Portier, P.-E., He-Guelton, L., & Caelen, O. (2018) · Expert Systems with Applications · doi:10.1016/j.eswa.2018.01.037 · Cited by 514
Combining unsupervised and supervised learning in credit card fraud detection
Carcillo, F., Le Borgne, Y.-A., Caelen, O., Kessaci, Y., Oblé, F., & Bontempi, G. (2021) · Information Sciences · doi:10.1016/j.ins.2019.05.042 · Cited by 478
Feature engineering strategies for credit card fraud detection
Correa Bahnsen, A., Aouada, D., Stojanovic, A., & Ottersten, B. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2015.12.030 · Cited by 451
Self-citation
Metadata
- Authors
- Correa Bahnsen, A., Aouada, D., & Ottersten, B.
- Venue
- Expert Systems with Applications
- Publisher
- Elsevier BV
- Published
- 2015-11
- Volume
- 42
- Issue
- 19
- Pages
- 6609-6619
- ISSN
- 0957-4174 (ISSN-L)
- OpenAlex
- W2112627523
- Cited by
- 223
- References
- 6
- FWCI
- 35.14
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Example-dependent cost-sensitive decision trees. https://app.cochat.ai/papers/10.1016/j.eswa.2015.04.042
- The paper
- Correa Bahnsen, A., Aouada, D., & Ottersten, B. (2015). Example-dependent cost-sensitive decision trees. Expert Systems with Applications. https://doi.org/10.1016/j.eswa.2015.04.042
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.