{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T15:24:45Z","timestamp":1776525885416,"version":"3.51.2"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,9,28]],"date-time":"2021-09-28T00:00:00Z","timestamp":1632787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,9,28]],"date-time":"2021-09-28T00:00:00Z","timestamp":1632787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004744","name":"Innoviris","doi-asserted-by":"crossref","award":["Secur\u2019IT"],"award-info":[{"award-number":["Secur\u2019IT"]}],"id":[{"id":"10.13039\/501100004744","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Over the years, a plethora of cost-sensitive methods have been proposed for learning on data when different types of misclassification errors incur different costs. Our contribution is a unifying framework that provides a comprehensive and insightful overview on cost-sensitive ensemble methods, pinpointing their differences and similarities via a fine-grained categorization. Our framework contains natural extensions and generalisations of ideas across methods, be it AdaBoost, Bagging or Random Forest, and as a result not only yields all methods known to date but also some not previously considered.<\/jats:p>","DOI":"10.1007\/s10618-021-00790-4","type":"journal-article","created":{"date-parts":[[2021,9,28]],"date-time":"2021-09-28T07:08:59Z","timestamp":1632812939000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Cost-sensitive ensemble learning: a unifying framework"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1125-4343","authenticated-orcid":false,"given":"George","family":"Petrides","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8438-0535","authenticated-orcid":false,"given":"Wouter","family":"Verbeke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,28]]},"reference":[{"issue":"4","key":"790_CR1","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1214\/aoms\/1177728423","volume":"26","author":"M Ayer","year":"1955","unstructured":"Ayer M, Brunk H, Ewing G, Reid W, Silverman E (1955) An empirical distribution function for sampling with incomplete information. Ann Math Stat 26(4):641\u2013647","journal-title":"Ann Math Stat"},{"key":"790_CR2","doi-asserted-by":"publisher","first-page":"6609","DOI":"10.1016\/j.eswa.2015.04.042","volume":"42","author":"AC Bahnsen","year":"2015","unstructured":"Bahnsen AC, Aouada D, Ottersten B (2015) Example-dependent cost-sensitive decision trees. Expert Syst Appl 42:6609\u20136619","journal-title":"Expert Syst Appl"},{"key":"790_CR3","doi-asserted-by":"crossref","unstructured":"Bradford J, Kuntz C, Kohavi R, Brunk C, Brodley C (1998) Pruning decision trees with misclassification costs. In: European conference on machine learning ECML, LNCS, vol 1398, pp 131\u2013136","DOI":"10.1007\/BFb0026682"},{"issue":"2","key":"790_CR4","first-page":"123","volume":"26","author":"L Breiman","year":"1996","unstructured":"Breiman L (1996) Bagging predictors. Mach Learn 26(2):123\u2013140","journal-title":"Mach Learn"},{"issue":"1","key":"790_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L (2001) Random forests. Mach Learn 45(1):5\u201332","journal-title":"Mach Learn"},{"key":"790_CR6","doi-asserted-by":"publisher","unstructured":"Breiman L, Friedman JH, Olshen RA, Stone CJ (1984) Classification and regression trees, 1st edn. Routledge. https:\/\/doi.org\/10.1201\/9781315139470","DOI":"10.1201\/9781315139470"},{"key":"790_CR7","unstructured":"Cestnik B (1990) Estimating probabilities: a crucial task in machine learning. In: European conference on artificial intelligence ECAI, pp 147\u2013149"},{"key":"790_CR8","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1613\/jair.953","volume":"16","author":"N Chawla","year":"2002","unstructured":"Chawla N, Bowyer K, Hall L, Kegelmeyer W (2002) SMOTE: synthetic minority over-sampling technique. J Artif Intell Res 16:321\u2013357","journal-title":"J Artif Intell Res"},{"key":"790_CR9","doi-asserted-by":"crossref","unstructured":"Chawla N, Lazarevic A, Hall L, Bowyer K (2003) SMOTEboost: improving prediction of the minority class in boosting. In: Knowledge discovery in databases PKDD, LNAI, vol 2838, pp 107\u2013119","DOI":"10.1007\/978-3-540-39804-2_12"},{"key":"790_CR10","doi-asserted-by":"crossref","unstructured":"Chen T, Guestrin CE (2016) XGBoost: a scalable tree boosting system. In: ACM SIGKDD International conference on knowledge discovery and data mining KDD, pp 785\u2013794","DOI":"10.1145\/2939672.2939785"},{"key":"790_CR11","unstructured":"Chen C, Liaw A, Breiman L (2004) Using random forest to learn imbalanced data. Statistics Technical Report 666, University of California, Berkley"},{"key":"790_CR12","doi-asserted-by":"crossref","unstructured":"Choi S, Kim YJ, Briceno S, Mavris D (2017) Cost-sensitive prediction of airline delays using machine learning. In: IEEE\/AIAA digital avionics systems conference DASC, pp 1\u20138","DOI":"10.1109\/DASC.2017.8102035"},{"issue":"3\/4","key":"790_CR13","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1108\/EJM-03-2012-0180","volume":"48","author":"K Coussement","year":"2014","unstructured":"Coussement K (2014) Improving customer retention management through cost-sensitive learning. Eur J Mark 48(3\/4):477\u2013495","journal-title":"Eur J Mark"},{"key":"790_CR14","doi-asserted-by":"crossref","unstructured":"Domingos P (1999) Metacost: a general method for making classifiers cost-sensitive. In: ACM SIGKDD International conference on knowledge discovery and data mining KDD, pp 155\u2013164","DOI":"10.1145\/312129.312220"},{"key":"790_CR15","unstructured":"Elkan C (2001) The foundations of cost-sensitive learning. In: International joint conference on artificial intelligence IJCAI, pp 973\u2013978"},{"key":"790_CR16","unstructured":"Fan W, Stolfo SJ, Zhang J, Chan PK (1999) AdaCost: misclassification cost-sensitive boosting. In: International conference on machine learning ICML, pp 97\u2013105"},{"issue":"1","key":"790_CR17","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund Y, Schapire R (1997) A decision\u2013theoretic generalization of on-line learning and an application to boosting. J Comput Syst Sci 55(1):119\u2013139","journal-title":"J Comput Syst Sci"},{"issue":"5","key":"790_CR18","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1214\/aos\/1013203451","volume":"29","author":"J Friedman","year":"2001","unstructured":"Friedman J (2001) Greedy function approximation: a gradient boosting machine. Ann Stat 29(5):1189\u20131232","journal-title":"Ann Stat"},{"issue":"2","key":"790_CR19","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1214\/aos\/1016218223","volume":"28","author":"J Friedman","year":"2000","unstructured":"Friedman J, Hastie T, Tibshirani R (2000) Additive logistic regression: a statistical view of boosting. Ann Stat 28(2):337\u2013374","journal-title":"Ann Stat"},{"issue":"4","key":"790_CR20","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1109\/TSMCC.2011.2161285","volume":"42","author":"M Galar","year":"2011","unstructured":"Galar M, Fern\u00e1ndez A, Barrenechea E, Bustince H, Herrera F (2011) A review on ensembles for the class imbalance problem: bagging-, boosting-, and hybrid-based approaches. IEEE Trans Syst Man Cybern Part C Appl Rev 42(4):463\u2013484","journal-title":"IEEE Trans Syst Man Cybern Part C Appl Rev"},{"key":"790_CR21","doi-asserted-by":"crossref","unstructured":"Georges J, Milley AH (2000) Kdd\u201999 competition: knowledge discovery contest. ACM SIGKDD Explor Newsl 1(2):79\u201384","DOI":"10.1145\/846183.846203"},{"issue":"9","key":"790_CR22","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1109\/TKDE.2008.239","volume":"21","author":"H He","year":"2009","unstructured":"He H, Garcia EA (2009) Learning from imbalanced data. IEEE Trans Knowl Data Eng 21(9):1263\u20131284","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"790_CR23","unstructured":"Ho TK (1995) Random decision forests. In: International conference on document analysis and recognition, vol 1, pp 278\u2013282"},{"issue":"8","key":"790_CR24","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1109\/34.709601","volume":"20","author":"TK Ho","year":"1998","unstructured":"Ho TK (1998) The random subspace method for constructing decision forests. IEEE Trans Pattern Anal Mach Intell 20(8):832\u2013844","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"790_CR25","first-page":"253","volume":"11","author":"G Karakoulas","year":"1999","unstructured":"Karakoulas G, Shawe-Taylor J (1999) Optimising classifiers for imbalanced training sets. Adv Neural Inf Process Syst 11:253\u2013259","journal-title":"Adv Neural Inf Process Syst"},{"key":"790_CR26","doi-asserted-by":"crossref","unstructured":"Knoll U, Nakhaeizadeh G, Tausend B (1994) Cost-sensitive pruning of decision trees. In: European conference on machine learning ECML, LNCS, vol 784, pp 383\u2013386","DOI":"10.1007\/3-540-57868-4_79"},{"key":"790_CR27","doi-asserted-by":"publisher","first-page":"113539","DOI":"10.1016\/j.dss.2021.113539","volume":"147","author":"N Lawrance","year":"2021","unstructured":"Lawrance N, Petrides G, Guerry MA (2021) Predicting employee absenteeism for cost effective interventions. Decis Support Syst 147:113539","journal-title":"Decis Support Syst"},{"issue":"1","key":"790_CR28","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.ejor.2015.05.030","volume":"247","author":"S Lessmann","year":"2015","unstructured":"Lessmann S, Baesens B, Seow HV, Thomas L (2015) Benchmarking state-of-the-art classification algorithms for credit scoring: an update of research. Eur J Oper Res 247(1):124\u2013136","journal-title":"Eur J Oper Res"},{"key":"790_CR29","doi-asserted-by":"crossref","unstructured":"Ling C, Yang Q, Wang J, Zhang S (2004) Decision trees with minimal costs. In: International conference on machine learning ICML, pp 64\u201371","DOI":"10.1145\/1015330.1015369"},{"issue":"2","key":"790_CR30","first-page":"539","volume":"39","author":"X Liu","year":"2008","unstructured":"Liu X, Wu J, Zhou Z (2008) Exploratory undersampling for class-imbalance learning. IEEE Trans Syst Man Cybern Part B Cybern 39(2):539\u2013550","journal-title":"IEEE Trans Syst Man Cybern Part B Cybern"},{"key":"790_CR31","doi-asserted-by":"crossref","unstructured":"Lomax S, Vadera S (2013) A survey of cost-sensitive decision tree induction algorithms. ACM Comput Surv 45(2):Article 16","DOI":"10.1145\/2431211.2431215"},{"issue":"2","key":"790_CR32","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1109\/TPAMI.2010.71","volume":"33","author":"H Masnadi-Shirazi","year":"2011","unstructured":"Masnadi-Shirazi H, Vasconcelos N (2011) Cost-sensitive boosting. IEEE Trans Pattern Anal Mach Intell 33(2):294\u2013309","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"790_CR33","unstructured":"Niculescu-Mizil A, Caruana R (2005) Obtaining calibrated probabilities from boosting. In: Conference on uncertainty in artificial intelligence UAI, pp 413\u2013420"},{"key":"790_CR34","doi-asserted-by":"crossref","unstructured":"Nikolaou N, Brown G (2015) Calibrating adaboost for asymmetric learning. In: Multiple classifier systems MCS, LNCS, vol 9132, pp 112\u2013124","DOI":"10.1007\/978-3-319-20248-8_10"},{"issue":"2","key":"790_CR35","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10994-016-5572-x","volume":"104","author":"N Nikolaou","year":"2016","unstructured":"Nikolaou N, Edakunni N, Kull M, Flach P, Brown G (2016) Cost-sensitive boosting algorithms: do we really need them? Mach Learn 104(2):359\u2013384","journal-title":"Mach Learn"},{"key":"790_CR36","doi-asserted-by":"crossref","unstructured":"Pazzani M, Merz C, Murphy P, Ali K, Hume T, Brunk C (1994) Reducing misclassification costs. In: International conference on machine learning ICML, pp 217\u2013225","DOI":"10.1016\/B978-1-55860-335-6.50034-9"},{"key":"790_CR37","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2020.1843975","author":"G Petrides","year":"2020","unstructured":"Petrides G, Moldovan D, Coenen L, Guns T, Verbeke W (2020) Cost-sensitive learning for profit-driven credit scoring. J Oper Res Soc. https:\/\/doi.org\/10.1080\/01605682.2020.1843975","journal-title":"J Oper Res Soc"},{"issue":"3","key":"790_CR38","first-page":"61","volume":"10","author":"J Platt","year":"1999","unstructured":"Platt J (1999) Probabilistic outputs for support vector machines and comparison to regularised likelihood methods. Adv Large Margin Classif 10(3):61\u201374","journal-title":"Adv Large Margin Classif"},{"key":"790_CR39","unstructured":"Prati R, Batista G, Monard M (2009) Data mining with imbalanced class distributions: concepts and methods. In: Indian international conference on artificial intelligence IICAI, pp 359\u2013376"},{"issue":"3","key":"790_CR40","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/A:1007601015854","volume":"42","author":"F Provost","year":"2001","unstructured":"Provost F, Fawcett T (2001) Robust classification for imprecise environments. Mach Learn 42(3):203\u2013231","journal-title":"Mach Learn"},{"key":"790_CR41","volume-title":"C4.5: programs for machine learning","author":"R Quinlan","year":"1993","unstructured":"Quinlan R (1993) C4.5: programs for machine learning. Morgan Kaufmann, London"},{"key":"790_CR42","unstructured":"R Core Team (2021) R: a language and environment for statistical computing. R Foundation for Statistical Computing, Vienna. https:\/\/www.R-project.org\/"},{"key":"790_CR43","volume-title":"Order restricted statistical inference","author":"T Robertson","year":"1988","unstructured":"Robertson T, Wright F, Dykstra R (1988) Order restricted statistical inference. Wiley, New York"},{"issue":"1","key":"790_CR44","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1109\/TSMCA.2009.2029559","volume":"40","author":"C Seiffert","year":"2010","unstructured":"Seiffert C, Khoshgoftaar T, Hulse JV, Napolitano A (2010) RUSBoost: a hybrid approach to alleviating class imbalance. IEEE Trans Syst Man Cybern Part A Syst Hum 40(1):185\u2013197","journal-title":"IEEE Trans Syst Man Cybern Part A Syst Hum"},{"issue":"3","key":"790_CR45","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"RE Shapire","year":"1999","unstructured":"Shapire RE, Singer Y (1999) Improved boosting algorithms using confidence-rated predictions. Mach Learn 37(3):297\u2013336","journal-title":"Mach Learn"},{"key":"790_CR46","unstructured":"Sheng V, Ling C (2006) Thresholding for making classifiers cost-sensitive. In: National conference on artificial intelligence AAAI, vol 1, pp 476\u2013481"},{"key":"790_CR47","doi-asserted-by":"publisher","first-page":"3358","DOI":"10.1016\/j.patcog.2007.04.009","volume":"40","author":"Y Sun","year":"2007","unstructured":"Sun Y, Kamel M, Wong A, Wang Y (2007) Cost-sensitive boosting for classification of imbalanced data. Pattern Recognit 40:3358\u20133378","journal-title":"Pattern Recognit"},{"issue":"4","key":"790_CR48","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1142\/S0218001409007326","volume":"23","author":"Y Sun","year":"2009","unstructured":"Sun Y, Wong A, Kamel M (2009) Classification of imbalanced data: a review. Int J Pattern Recognit Artif Intell 23(4):687\u2013719","journal-title":"Int J Pattern Recognit Artif Intell"},{"key":"790_CR49","doi-asserted-by":"crossref","unstructured":"Ting K (1998) Inducing cost-sensitive trees via instance weighting. In: European symposium on principles of data mining and knowledge discovery PKDD, LNCS, vol 1510, pp 139\u2013147","DOI":"10.1007\/BFb0094814"},{"key":"790_CR50","unstructured":"Ting K (2000a) A comparative study of cost-sensitive boosting algorithms. In: International conference on machine learning ICML, pp 983\u2013990"},{"key":"790_CR51","doi-asserted-by":"crossref","unstructured":"Ting K (2000b) An empirical study of metacost using boosting algorithms. In: European conference on machine learning ECML, LNAI, vol 1810, pp 413\u2013425","DOI":"10.1007\/3-540-45164-1_42"},{"issue":"3","key":"790_CR52","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1109\/TKDE.2002.1000348","volume":"14","author":"K Ting","year":"2002","unstructured":"Ting K (2002) An instance-weighting method to induce cost-sensitive trees. IEEE Trans Knowl Data Eng 14(3):659\u2013665","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"790_CR53","doi-asserted-by":"crossref","unstructured":"Ting K, Zheng Z (1998a) Boosting cost-sensitive trees. In: International conference on discovery science DS, LNAI, vol 1532, pp 244\u2013255","DOI":"10.1007\/3-540-49292-5_22"},{"key":"790_CR54","doi-asserted-by":"crossref","unstructured":"Ting K, Zheng Z (1998b) Boosting trees for cost-sensitive classifications. In: European conference on machine learning ECML, LNAI, vol 1398, pp. 190\u2013195","DOI":"10.1007\/BFb0026689"},{"key":"790_CR55","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1613\/jair.120","volume":"2","author":"P Turney","year":"1995","unstructured":"Turney P (1995) Cost-sensitive classification: empirical evaluation of a hybrid genetic decision tree induction algorithm. J Artif Intell Res 2:369\u2013409","journal-title":"J Artif Intell Res"},{"key":"790_CR56","unstructured":"Turney P (2000) Types of cost in inductive concept learning. In: International conference on machine learning ICML, pp 15\u201321"},{"key":"790_CR57","first-page":"1311","volume":"14","author":"P Viola","year":"2001","unstructured":"Viola P, Jones M (2001) Fast and robust classification using assymetric adaboost and a detector cascade. Adv Neural Inf Process Syst 14:1311\u20131318","journal-title":"Adv Neural Inf Process Syst"},{"key":"790_CR58","doi-asserted-by":"crossref","unstructured":"Wang S, Yao X (2009) Diversity analysis on imbalanced data sets by using ensemble models. In: IEEE Symposium on computational intelligence and data mining CIDM, pp 324\u2013331","DOI":"10.1109\/CIDM.2009.4938667"},{"key":"790_CR59","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0893-6080(05)80023-1","volume":"5","author":"DH Wolpert","year":"1992","unstructured":"Wolpert DH (1992) Stacked generalisation. Neural Netw 5:241\u2013259","journal-title":"Neural Netw"},{"key":"790_CR60","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.elerap.2017.06.004","volume":"24","author":"Y Xia","year":"2017","unstructured":"Xia Y, Liu C, Liu N (2017) Cost-sensitive boosted tree for loan evaluation in peer-to-peer lending. Electron Commerce Res Appl 24:30\u201349","journal-title":"Electron Commerce Res Appl"},{"key":"790_CR61","doi-asserted-by":"crossref","unstructured":"Zadrozny B, Elkan C (2001a) Learning and making decisions when costs and probabilities are both unknown. In: ACM SIGKDD International conference on knowledge discovery and data mining, pp 204\u2013213","DOI":"10.1145\/502512.502540"},{"key":"790_CR62","unstructured":"Zadrozny B, Elkan C (2001b) Obtaining calibrated probability estimates from decision trees and naive bayesian classifiers. In: International conference on machine learning ICML, pp 609\u2013616"},{"key":"790_CR63","doi-asserted-by":"crossref","unstructured":"Zadrozny B, Elkan C (2002) Transforming classifier scores into accurate multiclass probability estimates. In: ACM SIGKDD International conference on knowledge discovery and data mining, pp 694\u2013699","DOI":"10.1145\/775047.775151"},{"key":"790_CR64","doi-asserted-by":"crossref","unstructured":"Zadrozny B, Langford J, Abe N (2003) Cost-sensitive learning by cost-proportionate example weighting. In: IEEE International conference on data mining ICDM, pp 435\u2013442","DOI":"10.1109\/ICDM.2003.1250950"},{"key":"790_CR65","doi-asserted-by":"publisher","DOI":"10.1201\/b12207","volume-title":"Ensemble methods foundations and algorithms","author":"Z Zhou","year":"2012","unstructured":"Zhou Z (2012) Ensemble methods foundations and algorithms. CRC Press, Boca Raton"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-021-00790-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-021-00790-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-021-00790-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,22]],"date-time":"2022-01-22T06:22:47Z","timestamp":1642832567000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-021-00790-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,28]]},"references-count":65,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["790"],"URL":"https:\/\/doi.org\/10.1007\/s10618-021-00790-4","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,28]]},"assertion":[{"value":"15 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}