{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:54:37Z","timestamp":1774227277471,"version":"3.50.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,6,18]],"date-time":"2022-06-18T00:00:00Z","timestamp":1655510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,18]],"date-time":"2022-06-18T00:00:00Z","timestamp":1655510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["825619"],"award-info":[{"award-number":["825619"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10618-022-00839-y","type":"journal-article","created":{"date-parts":[[2022,6,18]],"date-time":"2022-06-18T05:02:43Z","timestamp":1655528563000},"page":"1521-1574","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Conclusive local interpretation rules for random forests"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7765-7903","authenticated-orcid":false,"given":"Ioannis","family":"Mollas","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6035-1038","authenticated-orcid":false,"given":"Nick","family":"Bassiliades","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7879-669X","authenticated-orcid":false,"given":"Grigorios","family":"Tsoumakas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,18]]},"reference":[{"key":"839_CR1","doi-asserted-by":"publisher","first-page":"52138","DOI":"10.1109\/ACCESS.2018.2870052","volume":"6","author":"A Adadi","year":"2018","unstructured":"Adadi A, Berrada M (2018) Peeking inside the black-box: a survey on explainable artificial intelligence (XAI). IEEE Access 6:52138\u201352160","journal-title":"IEEE Access"},{"key":"839_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. In: ACM sigmod record, vol\u00a022, pp 207\u2013216. ACM","DOI":"10.1145\/170036.170072"},{"key":"839_CR3","unstructured":"Agrawal R, Srikant R et\u00a0al. (1994) Fast algorithms for mining association rules. In: Proceedings of 20th international conference very large data bases, VLDB, vol 1215, pp 487\u2013499"},{"key":"839_CR4","unstructured":"Bodria F, Giannotti F, Guidotti R, Naretto F, Pedreschi D, Rinzivillo S (2021) Benchmarking and survey of explanation methods for black box models. arXiv preprint arXiv:2102.13076"},{"issue":"1","key":"839_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. https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mach Learn"},{"key":"839_CR6","first-page":"151","volume":"432","author":"L Breiman","year":"1984","unstructured":"Breiman L, Friedman JH, Olshen RA, Stone CJ (1984) Classification and regression trees. Int Group 432:151\u2013166","journal-title":"Int Group"},{"key":"839_CR7","doi-asserted-by":"publisher","unstructured":"Bucilua C, Caruana R, Niculescu-Mizil A (2006) Model compression. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201906, pp 535\u2013541. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/1150402.1150464","DOI":"10.1145\/1150402.1150464"},{"key":"839_CR8","unstructured":"Chen A (2018) IBM\u2019s Watson gave unsafe recommendations for treating cancer. https:\/\/cutt.ly\/keHQDma. Accessed 18 Nov 2019"},{"key":"839_CR9","doi-asserted-by":"crossref","unstructured":"Chen T, Guestrin C (2016) Xgboost: a scalable tree boosting system. In: Proceedings of the 22nd ACM sigkdd international conference on knowledge discovery and data mining, pp 785\u2013794. ACM","DOI":"10.1145\/2939672.2939785"},{"key":"839_CR10","unstructured":"Clark D, Schreter Z, Adams A, Williamson RC, Burkitt A, Bartlett P (1996) A quantitative comparison of dystal and backpropagation, Australian conference; 7th, neural networks. In: Neural networks, proceedings of the seventh Australian conference on neural networks, Australian conference; 7th, Neural networks, pp 132\u2013137. Australian National University. https:\/\/www.tib.eu\/de\/suchen\/id\/BLCP%3ACN016972815"},{"key":"839_CR11","unstructured":"Cole S (2019) This trippy t-shirt makes you invisible to AI. https:\/\/cutt.ly\/FeHQHAa. Accessed 18 Nov 2019"},{"issue":"4","key":"839_CR12","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.dss.2009.05.016","volume":"47","author":"P Cortez","year":"2009","unstructured":"Cortez P, Cerdeira A, Almeida F, Matos T, Reis J (2009) Modeling wine preferences by data mining from physicochemical properties. Decis Support Syst 47(4):547\u2013553","journal-title":"Decis Support Syst"},{"issue":"4","key":"839_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s41060-018-0144-8","volume":"7","author":"H Deng","year":"2019","unstructured":"Deng H (2019) Interpreting tree ensembles with InTrees. Int J Data Sci Anal 7(4):277\u2013287","journal-title":"Int J Data Sci Anal"},{"issue":"1\u20134","key":"839_CR14","doi-asserted-by":"publisher","first-page":"187","DOI":"10.3233\/IDA-1998-2303","volume":"2","author":"P Domingos","year":"1998","unstructured":"Domingos P (1998) Knowledge discovery via multiple models. Intell Data Anal 2(1\u20134):187\u2013202","journal-title":"Intell Data Anal"},{"key":"839_CR15","doi-asserted-by":"crossref","unstructured":"Do\u0161ilovi\u0107 FK, Br\u010di\u0107 M, Hlupi\u0107 N (2018) Explainable artificial intelligence: a survey. In: 2018 41st International convention on information and communication technology, electronics and microelectronics (MIPRO), pp. 0210\u20130215. IEEE","DOI":"10.23919\/MIPRO.2018.8400040"},{"key":"839_CR16","unstructured":"Dua D, Graff C (2017) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"issue":"90","key":"839_CR17","first-page":"3133","volume":"15","author":"M Fern\u00e1ndez-Delgado","year":"2014","unstructured":"Fern\u00e1ndez-Delgado M, Cernadas E, Barro S, Amorim D (2014) Do we need hundreds of classifiers to solve real world classification problems? J Mach Learn Res 15(90):3133\u20133181","journal-title":"J Mach Learn Res"},{"key":"839_CR18","unstructured":"Firth N (2019) Apple card is being investigated over claims it gives women lower credit limits. https:\/\/cutt.ly\/oeGYCx5. Accessed 18 Nov 2019"},{"issue":"1","key":"839_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2594473.2594475","volume":"15","author":"AA Freitas","year":"2014","unstructured":"Freitas AA (2014) Comprehensible classification models: a position paper. SIGKDD Explor Newsl 15(1):1\u201310. https:\/\/doi.org\/10.1145\/2594473.2594475","journal-title":"SIGKDD Explor Newsl"},{"key":"839_CR20","first-page":"1189","volume":"22","author":"JH Friedman","year":"2001","unstructured":"Friedman JH (2001) Greedy function approximation: a gradient boosting machine. Ann Stat 22:1189\u20131232","journal-title":"Ann Stat"},{"issue":"4","key":"839_CR21","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/S0167-9473(01)00065-2","volume":"38","author":"JH Friedman","year":"2002","unstructured":"Friedman JH (2002) Stochastic gradient boosting. Comput Stat Data Anal 38(4):367\u2013378","journal-title":"Comput Stat Data Anal"},{"issue":"3","key":"839_CR22","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1214\/07-AOAS148","volume":"2","author":"JH Friedman","year":"2008","unstructured":"Friedman JH, Popescu BE (2008) Predictive learning via rule ensembles. Ann Appl Stat 2(3):916\u2013954","journal-title":"Ann Appl Stat"},{"key":"839_CR23","first-page":"1147","volume":"22","author":"ST Gries","year":"2019","unstructured":"Gries ST (2019) On classification trees and random forests in corpus linguistics: some words of caution and suggestions for improvement. Corpus Linguist Linguistic Theory 22:1147","journal-title":"Corpus Linguist Linguistic Theory"},{"key":"839_CR24","unstructured":"Guidotti R, Monreale A, Ruggieri S, Pedreschi D, Turini F, Giannotti F (2018) Local rule-based explanations of black box decision systems. CoRR abs\/1805.10820"},{"issue":"1","key":"839_CR25","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min Knowl Disc 8(1):53\u201387","journal-title":"Data Min Knowl Disc"},{"key":"839_CR26","unstructured":"Hara S, Hayashi K (2018) Making tree ensembles interpretable: a bayesian model selection approach. In: A\u00a0Storkey, F\u00a0Perez-Cruz (eds.) Proceedings of the twenty-first international conference on artificial intelligence and statistics, proceedings of machine learning research, vol\u00a084, pp 77\u201385. PMLR, Playa Blanca, Lanzarote, Canary Islands. http:\/\/proceedings.mlr.press\/v84\/hara18a.html"},{"issue":"1","key":"839_CR27","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0095-0696(78)90006-2","volume":"5","author":"D Harrison Jr","year":"1978","unstructured":"Harrison D Jr, Rubinfeld DL (1978) Hedonic housing prices and the demand for clean air. J Environ Econ Manag 5(1):81\u2013102","journal-title":"J Environ Econ Manag"},{"issue":"6","key":"839_CR28","doi-asserted-by":"publisher","first-page":"2511","DOI":"10.3390\/app11062511","volume":"11","author":"J Hatwell","year":"2021","unstructured":"Hatwell J, Gaber MM, Azad R (2021) GBT-hips: explaining the classifications of gradient boosted tree ensembles. Appl Sci 11(6):2511","journal-title":"Appl Sci"},{"issue":"8","key":"839_CR29","doi-asserted-by":"publisher","first-page":"5747","DOI":"10.1007\/s10462-020-09833-6","volume":"53","author":"J Hatwell","year":"2020","unstructured":"Hatwell J, Gaber MM, Azad RMA (2020) CHIRPS: explaining random forest classification. Artif Intell Rev 53(8):5747\u20135788. https:\/\/doi.org\/10.1007\/s10462-020-09833-6","journal-title":"Artif Intell Rev"},{"key":"839_CR30","unstructured":"Hinton G, Vinyals O, Dean J (2015) Distilling the knowledge in a neural network. In: NIPS deep learning and representation learning workshop. http:\/\/arxiv.org\/abs\/1503.02531"},{"key":"839_CR31","unstructured":"Ioannis M, Nick B, Ioannis V, Grigorios T (2020) Lionforests: local interpretation of random forests. In: S\u00a0Alessandro, S\u00a0Luciano, L\u00a0Paul (eds.) First International workshop on new foundations for human-centered AI (NeHuAI 2020), no 2659 in CEUR Workshop Proceedings, pp 17\u201324. Aachen. http:\/\/ceur-ws.org\/Vol-2659\/mollas.pdf"},{"key":"839_CR32","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-981-15-5285-4_18","volume-title":"Intelligence in big data technologies-beyond the hype","author":"T Jemima Jebaseeli","year":"2021","unstructured":"Jemima Jebaseeli T, Venkatesan R, Ramalakshmi K (2021) Fraud detection for credit card transactions using random forest algorithm. In: Peter JD, Fernandes SL, Alavi AH (eds) Intelligence in big data technologies-beyond the hype. Springer, Singapore, pp 189\u2013197"},{"key":"839_CR33","first-page":"405","volume-title":"Statistical data analysis based on the l1 norm","author":"L Kaufman","year":"1987","unstructured":"Kaufman L, Rousseeuw PJ (1987) Clustering by means of medoids. In: Dodge Y (ed) Statistical data analysis based on the l1 norm. Springer, Berlin, pp 405\u2013416"},{"key":"839_CR34","unstructured":"Kohavi R (1996) Scaling up the accuracy of naive-bayes classifiers: a decision-tree hybrid. In: Proceedings of the second international conference on knowledge discovery and data mining"},{"issue":"1","key":"839_CR35","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1038\/s42256-019-0138-9","volume":"2","author":"SM Lundberg","year":"2020","unstructured":"Lundberg SM, Erion G, Chen H, DeGrave A, Prutkin JM, Nair B, Katz R, Himmelfarb J, Bansal N, Lee SI (2020) From local explanations to global understanding with explainable AI for trees. Nat Mach Intell 2(1):56\u201367. https:\/\/doi.org\/10.1038\/s42256-019-0138-9","journal-title":"Nat Mach Intell"},{"key":"839_CR36","unstructured":"Lundberg SM, Lee SI (2017) A unified approach to interpreting model predictions. In: I\u00a0Guyon, UV Luxburg, S\u00a0Bengio, H\u00a0Wallach, R\u00a0Fergus, S\u00a0Vishwanathan, R\u00a0Garnett (eds.) Advances in neural information processing systems, vol 30, pp 4765\u20134774. Curran Associates, Inc. http:\/\/papers.nips.cc\/paper\/7062-a-unified-approach-to-interpreting-model-predictions.pdf"},{"key":"839_CR37","first-page":"2579","volume":"9","author":"LVD Maaten","year":"2008","unstructured":"Maaten LVD, Hinton G (2008) Visualizing data using T-sne. J Mach Learn Res 9:2579\u20132605","journal-title":"J Mach Learn Res"},{"key":"839_CR38","first-page":"2049","volume":"2","author":"N Meinshausen","year":"2010","unstructured":"Meinshausen N (2010) Node harvest. Ann Appl Stat 2:2049\u20132072","journal-title":"Ann Appl Stat"},{"key":"839_CR39","doi-asserted-by":"crossref","unstructured":"Moore A, Murdock V, Cai Y, Jones K (2018) Transparent tree ensembles. In: The 41st international ACM SIGIR conference on research and development in information retrieval, pp 1241\u20131244. ACM","DOI":"10.1145\/3209978.3210151"},{"issue":"8","key":"839_CR40","first-page":"1148","volume":"5","author":"B Nigam","year":"2017","unstructured":"Nigam B, Nigam A, Dalal P (2017) Comparative study of top 10 algorithms for association rule mining. Int J Comput Sci Eng 5(8):1148","journal-title":"Int J Comput Sci Eng"},{"key":"839_CR41","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, Vanderplas J, Passos A, Cournapeau D, Brucher M, Perrot M, Duchesnay E (2011) Scikit-learn: machine learning in python. J Mach Learn Res 12:2825\u20132830","journal-title":"J Mach Learn Res"},{"key":"839_CR42","unstructured":"Prokhorenkova LO, Gusev G, Vorobev A, Dorogush AV, Gulin A (2018) Catboost: unbiased boosting with categorical features. In: S\u00a0Bengio, HM Wallach, H\u00a0Larochelle, K\u00a0Grauman, N\u00a0Cesa-Bianchi, R\u00a0Garnett (eds.) Advances in neural information processing systems 31: annual conference on neural information processing systems 2018, NeurIPS 2018, December 3-8, 2018, Montr\u00e9al, Canada, pp 6639\u20136649. https:\/\/proceedings.neurips.cc\/paper\/2018\/hash\/14491b756b3a51daac41c24863285549-Abstract.html"},{"key":"839_CR43","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-981-15-7241-8_16","volume-title":"Adv Smart Grid Technol","author":"S Ravikumar","year":"2021","unstructured":"Ravikumar S, Muralidharan V, Ramesh P, Pandian C (2021) Fault diagnosis of self-aligning conveyor idler in coal handling belt conveyor system by statistical features using random forest algorithm. In: Zhou N, Hemamalini S (eds) Adv Smart Grid Technol. Springer, Singapore, pp 207\u2013219"},{"issue":"1\u201388","key":"839_CR44","first-page":"294","volume":"59","author":"GDP Regulation","year":"2016","unstructured":"Regulation GDP (2016) Regulation (EU) 2016\/679 of the European parliament and of the council of 27 April 2016 on the protection of natural persons with regard to the processing of personal data and on the free movement of such data, and repealing directive 95\/46. Off J Eur Union (OJ) 59(1\u201388):294","journal-title":"Off J Eur Union (OJ)"},{"issue":"3","key":"839_CR45","first-page":"1158","volume":"51","author":"PAA Resende","year":"2018","unstructured":"Resende PAA, Drummond AC (2018) A survey of random forest based methods for intrusion detection systems. ACM Comput Surv 51(3):1158","journal-title":"ACM Comput Surv"},{"key":"839_CR46","doi-asserted-by":"crossref","unstructured":"Ribeiro MT, Singh S, Guestrin C (2016) Why should i trust you?: Explaining the predictions of any classifier. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp 1135\u20131144. ACM","DOI":"10.1145\/2939672.2939778"},{"key":"839_CR47","doi-asserted-by":"crossref","unstructured":"Ribeiro MT, Singh S, Guestrin C (2018) Anchors: high-precision model-agnostic explanations. In: Thirty-second AAAI conference on artificial intelligence. www.aaai.org","DOI":"10.1609\/aaai.v32i1.11491"},{"key":"839_CR48","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1007\/978-3-030-31635-8_140","volume-title":"XV mediterranean conference on medical and biological engineering and computing-MEDICON 2019","author":"C Ricciardi","year":"2020","unstructured":"Ricciardi C, Amboni M, De Santis C, Ricciardelli G, Improta G, Iuppariello L, D\u2019Addio G, Barone P, Cesarelli M (2020) Classifying different stages of Parkinson\u2019s disease through random forests. In: Henriques J, Neves N, de Carvalho P (eds) XV mediterranean conference on medical and biological engineering and computing-MEDICON 2019. Springer International Publishing, Cham, pp 1155\u20131162"},{"issue":"5","key":"839_CR49","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1038\/s42256-019-0048-x","volume":"1","author":"C Rudin","year":"2019","unstructured":"Rudin C (2019) Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead. Nat Mach Intell 1(5):206\u2013215","journal-title":"Nat Mach Intell"},{"key":"839_CR50","unstructured":"Schubert E, Gertz M (2018) Improving the cluster structure extracted from OPTICS plots. In: R\u00a0Gemulla, SP Ponzetto, C\u00a0Bizer, M\u00a0Keuper, H\u00a0Stuckenschmidt (eds.) Proceedings of the conference \"Lernen, Wissen, Daten, Analysen\", LWDA 2018, Mannheim, Germany, August 22\u201324. CEUR workshop proceedings, vol 2191, pp 318\u2013329. CEUR-WS.org. http:\/\/ceur-ws.org\/Vol-2191\/paper37.pdf"},{"key":"839_CR51","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2020.107186","volume":"204","author":"MCE Simsekler","year":"2020","unstructured":"Simsekler MCE, Qazi A, Alalami MA, Ellahham S, Ozonoff A (2020) Evaluation of patient safety culture using a random forest algorithm. Reliabil Eng Syst Saf 204:107186. https:\/\/doi.org\/10.1016\/j.ress.2020.107186","journal-title":"Reliabil Eng Syst Saf"},{"issue":"3","key":"839_CR52","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s10115-013-0679-x","volume":"41","author":"E \u0160trumbelj","year":"2014","unstructured":"\u0160trumbelj E, Kononenko I (2014) Explaining prediction models and individual predictions with feature contributions. Knowl Inf Syst 41(3):647\u2013665","journal-title":"Knowl Inf Syst"},{"key":"839_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103404","volume":"291","author":"J van der Waa","year":"2021","unstructured":"van der Waa J, Nieuwburg E, Cremers A, Neerincx M (2021) Evaluating XAI: a comparison of rule-based and example-based explanations. Artifi Intell 291:103404. https:\/\/doi.org\/10.1016\/j.artint.2020.103404","journal-title":"Artifi Intell"},{"key":"839_CR54","doi-asserted-by":"publisher","unstructured":"Vens C, Costa F (2011) Random forest based feature induction. In: DJ Cook, J\u00a0Pei, W\u00a0Wang, OR Za\u00efane, X\u00a0Wu (eds.) 11th IEEE international conference on data mining, ICDM 2011, Vancouver, BC, Canada, 2011, pp 744\u2013753. IEEE Computer Society. https:\/\/doi.org\/10.1109\/ICDM.2011.121","DOI":"10.1109\/ICDM.2011.121"},{"issue":"4","key":"839_CR55","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U von Luxburg","year":"2007","unstructured":"von Luxburg U (2007) A tutorial on spectral clustering. Stat Comput 17(4):395\u2013416. https:\/\/doi.org\/10.1007\/s11222-007-9033-z","journal-title":"Stat Comput"},{"key":"839_CR56","doi-asserted-by":"publisher","unstructured":"Yao S, Wei M, Yan L, Wang C, Dong X, Liu F, Xiong Y (2020) Prediction of crime hotspots based on spatial factors of random forest. In: 15th international conference on computer science and education, ICCSE 2020, Delft, The Netherlands, August 18\u201322, 2020, pp 811\u2013815. IEEE. https:\/\/doi.org\/10.1109\/ICCSE49874.2020.9201899","DOI":"10.1109\/ICCSE49874.2020.9201899"},{"key":"839_CR57","first-page":"279","volume":"7","author":"R Yusuf","year":"2016","unstructured":"Yusuf R, Lawal Z (2016) Performance analysis of apriori and FP-growth algorithms (association rule mining). Int J Comput Appl Technol 7:279\u2013293","journal-title":"Int J Comput Appl Technol"},{"key":"839_CR58","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-981-15-8101-4_37","volume-title":"Artificial intelligence and security","author":"H Zhang","year":"2020","unstructured":"Zhang H, Bi Y, Jiang W, Luo C, Cao S, Guo P, Zhang J (2020) Application of random forest classifier in loan default forecast. In: Sun X, Wang J, Bertino E (eds) Artificial intelligence and security. Springer, Singapore, pp 410\u2013420"},{"issue":"1","key":"839_CR59","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1109\/TVCG.2018.2864475","volume":"25","author":"X Zhao","year":"2018","unstructured":"Zhao X, Wu Y, Lee DL, Cui W (2018) Iforest: interpreting random forests via visual analytics. IEEE Trans Visual Comput Gr 25(1):407\u2013416","journal-title":"IEEE Trans Visual Comput Gr"},{"key":"839_CR60","unstructured":"Zhou Y, Hooker G (2016) Interpreting models via single tree approximation. arXiv:1610.09036"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-022-00839-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-022-00839-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-022-00839-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T07:11:01Z","timestamp":1699859461000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-022-00839-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,18]]},"references-count":60,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["839"],"URL":"https:\/\/doi.org\/10.1007\/s10618-022-00839-y","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,18]]},"assertion":[{"value":"9 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Experiments\u2019 code is available in the GitHub repository: . The experiments\u2019 code related to the revision is also uploaded.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}