{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T14:11:55Z","timestamp":1784297515274,"version":"3.55.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T00:00:00Z","timestamp":1683331200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T00:00:00Z","timestamp":1683331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Output thresholding is well-suited for addressing class imbalance, since the technique does not increase dataset size, run the risk of discarding important instances, or modify an existing learner. Through the use of the Credit Card Fraud Detection Dataset, this study proposes a threshold optimization approach that factors in the constraint <jats:italic> True Positive Rate<\/jats:italic> (TPR)\u2009\u2265\u2009<jats:italic>True Negative Rate<\/jats:italic> (TNR). Our findings indicate that an increase of the <jats:italic>Area Under the Precision\u2013Recall Curve<\/jats:italic> (AUPRC) score is associated with an improvement in threshold-based classification scores, while an increase of positive class prior probability causes optimal thresholds to increase. In addition, we discovered that best overall results for the selection of an optimal threshold are obtained without the use of <jats:italic>Random Undersampling<\/jats:italic> (RUS). Furthermore, with the exception of AUPRC, we established that the default threshold yields good performance scores at a balanced class ratio. Our evaluation of four threshold optimization techniques, eight threshold-dependent metrics, and two threshold-agnostic metrics defines the uniqueness of this research.<\/jats:p>","DOI":"10.1186\/s40537-023-00738-z","type":"journal-article","created":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T04:01:37Z","timestamp":1683345697000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":49,"title":["Threshold optimization and random undersampling for imbalanced credit card data"],"prefix":"10.1186","volume":"10","author":[{"given":"Joffrey L.","family":"Leevy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Justin M.","family":"Johnson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Hancock","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Taghi M.","family":"Khoshgoftaar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,5,6]]},"reference":[{"issue":"1","key":"738_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1186\/s40537-018-0151-6","volume":"5","author":"JL Leevy","year":"2018","unstructured":"Leevy JL, Khoshgoftaar TM, Bauder RA, Seliya N. A survey on addressing high-class imbalance in big data. J Big Data. 2018;5(1):42.","journal-title":"J Big Data"},{"key":"738_CR2","doi-asserted-by":"crossref","unstructured":"Kesici M, Saner CB, Yaslan Y, Genc VI. Cost sensitive class-weighting approach for transient instability prediction using convolutional neural networks. In: 2019 11th international conference on electrical and electronics engineering (ELECO). IEEE; 2019. p. 141\u20135.","DOI":"10.23919\/ELECO47770.2019.8990370"},{"key":"738_CR3","doi-asserted-by":"crossref","unstructured":"Johnson JM, Khoshgoftaar TM. Output thresholding for ensemble learners and imbalanced big data. In: 2021 IEEE 33rd international conference on tools with artificial intelligence (ICTAI). IEEE; 2021. p. 1449\u201354.","DOI":"10.1109\/ICTAI52525.2021.00230"},{"issue":"1","key":"738_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-019-0274-4","volume":"6","author":"T Hasanin","year":"2019","unstructured":"Hasanin T, Khoshgoftaar TM, Leevy JL, Bauder RA. Severely imbalanced big data challenges: investigating data sampling approaches. J Big Data. 2019;6(1):1\u201325.","journal-title":"J Big Data"},{"key":"738_CR5","doi-asserted-by":"crossref","unstructured":"Seiffert C, Khoshgoftaar TM, Van\u00a0Hulse J, Napolitano A. A comparative study of data sampling and cost sensitive learning. In: 2008 IEEE international conference on data mining workshops. IEEE; 2008. p. 46\u201352.","DOI":"10.1109\/ICDMW.2008.119"},{"key":"738_CR6","doi-asserted-by":"crossref","unstructured":"Chen T, Guestrin C. Xgboost: a scalable tree boosting system. In: Proceedings of the 22nd Acm Sigkdd international conference on knowledge discovery and data mining; 2016. p. 785\u201394.","DOI":"10.1145\/2939672.2939785"},{"issue":"1","key":"738_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-020-00369-8","volume":"7","author":"JT Hancock","year":"2020","unstructured":"Hancock JT, Khoshgoftaar TM. CatBoost for big data: an interdisciplinary review. J Big Data. 2020;7(1):1\u201345.","journal-title":"J Big Data"},{"issue":"1","key":"738_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L. Random forests. Mach Learn. 2001;45(1):5\u201332.","journal-title":"Mach Learn"},{"key":"738_CR9","doi-asserted-by":"publisher","first-page":"19921","DOI":"10.1109\/ACCESS.2020.2968934","volume":"8","author":"MRC Acosta","year":"2020","unstructured":"Acosta MRC, Ahmed S, Garcia CE, Koo I. Extremely randomized trees-based scheme for stealthy cyber-attack detection in smart grid networks. IEEE Access. 2020;8:19921\u201333.","journal-title":"IEEE Access"},{"issue":"9","key":"738_CR10","first-page":"955","volume":"53","author":"Q Wang","year":"2019","unstructured":"Wang Q, Yu S, Qi X, Hu Y, Zheng W, Shi J, Yao H. Overview of logistic regression model analysis and application. Zhonghua yu fang yi xue za zhi [Chin J Prev Med]. 2019;53(9):955\u201360.","journal-title":"Zhonghua yu fang yi xue za zhi [Chin J Prev Med]"},{"key":"738_CR11","unstructured":"Kaggle: credit card fraud detection. https:\/\/www.kaggle.com\/mlg-ulb\/creditcardfraud."},{"key":"738_CR12","doi-asserted-by":"crossref","unstructured":"Zhang X, Gweon H, Provost S. Threshold moving approaches for addressing the class imbalance problem and their application to multi-label classification. In: 2020 4th international conference on advances in image processing; 2020. p. 72\u20137.","DOI":"10.1145\/3441250.3441274"},{"key":"738_CR13","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.neunet.2018.07.011","volume":"106","author":"M Buda","year":"2018","unstructured":"Buda M, Maki A, Mazurowski MA. A systematic study of the class imbalance problem in convolutional neural networks. Neural Netw. 2018;106:249\u201359.","journal-title":"Neural Netw"},{"key":"738_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2020.107315","volume":"177","author":"H Zhang","year":"2020","unstructured":"Zhang H, Huang L, Wu CQ, Li Z. An effective convolutional neural network based on smote and gaussian mixture model for intrusion detection in imbalanced dataset. Comput Netw. 2020;177: 107315.","journal-title":"Comput Netw"},{"key":"738_CR15","doi-asserted-by":"crossref","unstructured":"Cohen G, Afshar S, Tapson J, Van\u00a0Schaik A. EMNIST: extending MNIST to handwritten letters. In: 2017 international joint conference on neural networks (IJCNN). IEEE; 2017. p. 2921\u20136.","DOI":"10.1109\/IJCNN.2017.7966217"},{"key":"738_CR16","doi-asserted-by":"crossref","unstructured":"Yang L, Bankman D, Moons B, Verhelst M, Murmann B. Bit error tolerance of a CIFAR-10 binarized convolutional neural network processor. In: 2018 IEEE international symposium on circuits and systems (ISCAS). IEEE; 2018. p. 1\u20135.","DOI":"10.1109\/ISCAS.2018.8351255"},{"issue":"6","key":"738_CR17","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/3065386","volume":"60","author":"A Krizhevsky","year":"2017","unstructured":"Krizhevsky A, Sutskever I, Hinton GE. Imagenet classification with deep convolutional neural networks. Commun ACM. 2017;60(6):84\u201390.","journal-title":"Commun ACM"},{"key":"738_CR18","doi-asserted-by":"crossref","unstructured":"Calvert CL, Khoshgoftaar TM. Threshold based optimization of performance metrics with severely imbalanced big security data. In: 2019 IEEE 31st international conference on tools with artificial intelligence (ICTAI). IEEE; 2019. p. 1328\u201334.","DOI":"10.1109\/ICTAI.2019.00184"},{"key":"738_CR19","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.bdr.2015.12.001","volume":"5","author":"Q Zou","year":"2016","unstructured":"Zou Q, Xie S, Lin Z, Wu M, Ju Y. Finding the best classification threshold in imbalanced classification. Big Data Res. 2016;5:2\u20138.","journal-title":"Big Data Res"},{"key":"738_CR20","doi-asserted-by":"crossref","unstructured":"Salekshahrezaee Z, Leevy JL, Khoshgoftaar TM. Feature extraction for class imbalance using a convolutional autoencoder and data sampling. In: 2021 IEEE 33rd international conference on tools with artificial intelligence (ICTAI). IEEE; 2021. p. 217\u201323.","DOI":"10.1109\/ICTAI52525.2021.00037"},{"key":"738_CR21","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa F, Varoquaux G, Gramfort A, Michel V, Thirion B, Grisel O, Blondel M, Prettenhofer P, Weiss R, Dubourg V, et al. Scikit-learn: machine learning in python. J Mach Learn Res. 2011;12:2825\u201330.","journal-title":"J Mach Learn Res"},{"issue":"3","key":"738_CR22","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1287\/moor.2016.0831","volume":"42","author":"A Gupta","year":"2017","unstructured":"Gupta A, Nagarajan V, Ravi R. Approximation algorithms for optimal decision trees and adaptive TSP problems. Math Oper Res. 2017;42(3):876\u201396.","journal-title":"Math Oper Res"},{"key":"738_CR23","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.inffus.2020.07.007","volume":"64","author":"S Gonz\u00e1lez","year":"2020","unstructured":"Gonz\u00e1lez S, Garc\u00eda S, Del Ser J, Rokach L, Herrera F. A practical tutorial on bagging and boosting based ensembles for machine learning: algorithms, software tools, performance study, practical perspectives and opportunities. Inf Fusion. 2020;64:205\u201337.","journal-title":"Inf Fusion"},{"issue":"1","key":"738_CR24","first-page":"559","volume":"18","author":"G Lema\u00eetre","year":"2017","unstructured":"Lema\u00eetre G, Nogueira F, Aridas CK. Imbalanced-learn: a python toolbox to tackle the curse of imbalanced datasets in machine learning. J Mach Learn Res. 2017;18(1):559\u201363.","journal-title":"J Mach Learn Res"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-023-00738-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-023-00738-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-023-00738-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T04:05:32Z","timestamp":1683345932000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofbigdata.springeropen.com\/articles\/10.1186\/s40537-023-00738-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,6]]},"references-count":24,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["738"],"URL":"https:\/\/doi.org\/10.1186\/s40537-023-00738-z","relation":{},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,6]]},"assertion":[{"value":"24 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"58"}}