The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Explicitly representing expected cost: an alternative to ROC representation
Abstract
Article Explicitly representing expected cost: an alternative to ROC representation Share on Authors: Chris Drummond School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, Canada, K1N 6N5 School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, Canada, K1N 6N5View Profile , Robert C. Holte School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, Canada, K1N 6N5 School of Information Technology and Engineering, University of Ottawa, Ottawa, Ontario, Canada, K1N 6N5View Profile Authors Info & Claims KDD '00: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data miningAugust 2000 Pages 198–207https://doi.org/10.1145/347090.347126Online:01 August 2000Publication History 110citation909DownloadsMetricsTotal Citations110Total Downloads909Last 12 Months44Last 6 weeks4 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
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
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Cited by
SMOTE synthetic minority over-sampling technique
Chawla, N. V., Bowyer, K. W., Hall, L. O., & Kegelmeyer, W. P. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.953 · Cited by 32,865
“As an example, consider the classification of pixels in mammogram images as possibly cancerous (Woods, Doss, Bowyer, Solka, Priebe, & Kegelmeyer, 1993).”
MethodData Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
He, H., & Garcia, E. A. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.239 · Cited by 10,359
“In order to provide a more comprehensive evaluation metric to address these issues, cost curves were proposed in [128], [129], [130].”
BackgroundThe relationship between Precision-Recall and ROC curves
Davis, J., & Goadrich, M. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143874 · Cited by 6,559
Saito, T., & Rehmsmeier, M. (2015) · PLOS ONE · doi:10.1371/journal.pone.0118432 · Cited by 5,309
Editorial: special issue on learning from imbalanced data sets
Chawla, N. V., Japkowicz, N., & Kotcz, A. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007733 · Cited by 2,063
What's In A Name? Malay Seals As Onomastic Sources
Library, T. B., & Gallop, A. T. (2018) · Malay Literature · doi:10.37052/ml.31(1)no1 · Cited by 1,483
Training cost-sensitive neural networks with methods addressing the class imbalance problem
Zhou, Z.-H., & Liu, X.-Y. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.17 · Cited by 1,326
Robust classification for imprecise environments
Provost, F., & Fawcett, T. (2001) · Machine Learning · doi:10.1023/a:1007601015854 · Cited by 1,250
A Survey of Predictive Modeling on Imbalanced Domains
Branco, P., Torgo, L., & Ribeiro, R. P. (2017) · ACM Computing Surveys · doi:10.1145/2907070 · Cited by 1,129
Data Mining for Imbalanced Datasets: An Overview
Chawla, N. V. (2009) · Data Mining and Knowledge Discovery Handbook · doi:10.1007/978-0-387-09823-4_45 · Cited by 1,082
A unifying view on dataset shift in classification
Moreno-Torres, J. G., Raeder, T., Alaiz-Rodríguez, R., Chawla, N. V., & Herrera, F. (2012) · Pattern Recognition · doi:10.1016/j.patcog.2011.06.019 · Cited by 1,029
Chicco, D., & Jurman, G. (2023) · BioData Mining · doi:10.1186/s13040-023-00322-4 · Cited by 597
Learning to Detect and Classify Malicious Executables in the Wild
Kolter, J. Z., & Maloof, M. A. (2006) · doi:10.5555/1248547.1248646 · Cited by 562
Techniques for evaluating the performance of landslide susceptibility models
Frattini, P., Crosta, G., & Carrara, A. (2010) · Engineering Geology · doi:10.1016/j.enggeo.2009.12.004 · Cited by 504
Learning to detect malicious executables in the wild
Kolter, J. Z., & Maloof, M. A. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014105 · Cited by 475
Data Mining for Imbalanced Datasets: An Overview
Chawla, N. V. (2006) · Data Mining and Knowledge Discovery Handbook · doi:10.1007/0-387-25465-x_40 · Cited by 443
Velez, D. R., White, B. C., Motsinger, A. A., Bush, W. S., Ritchie, M. D., Williams, S. M., & Moore, J. H. (2007) · Genetic Epidemiology · doi:10.1002/gepi.20211 · Cited by 384
A cost-sensitive decision tree approach for fraud detection
Sahin, Y., Bulkan, S., & Duman, E. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.05.021 · Cited by 381
ON MULTI‐CLASS COST‐SENSITIVE LEARNING
Zhou, Z., & Liu, X. (2010) · Computational Intelligence · doi:10.1111/j.1467-8640.2010.00358.x · Cited by 350
Class Imbalances versus Class Overlapping: An Analysis of a Learning System Behavior
Prati, R. C., Batista, G. E. A. P. A., & Monard, M. C. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24694-7_32 · Cited by 339
Cost curves: An improved method for visualizing classifier performance
Drummond, C., & Holte, R. C. (2006) · Machine Learning · doi:10.1007/s10994-006-8199-5 · Cited by 326
Self-citationA multiple combined method for rebalancing medical data with class imbalances
Wang, Y.-C., & Cheng, C.-H. (2021) · Computers in Biology and Medicine · doi:10.1016/j.compbiomed.2021.104527 · Cited by 66
Kim, J., Kim, Y. K., Kim, H., Jung, H., Koh, S., Kim, Y., Yoon, D., Yi, H., & Kim, H.-J. (2023) · JMIR Formative Research · doi:10.2196/44763 · Cited by 18
“However, AUPRC is used as an alternative to AUROC for tasks with highly skewed class distribution [20,21].”
Metadata
- Authors
- Drummond, C., & Holte, R. C.
- Venue
- Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2000-08
- Pages
- 198-207
- OpenAlex
- W2167793421
- Cited by
- 181
- References
- 1
- FWCI
- 3.66
- Type
- conference paper
- Language
- en
- Open access
- closed
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.