{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T21:02:47Z","timestamp":1765486967800,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031434174"},{"type":"electronic","value":"9783031434181"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43418-1_29","type":"book-chapter","created":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T09:02:26Z","timestamp":1694854946000},"page":"479-495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Interpretable Regional Descriptors: Hyperbox-Based Local Explanations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4324-4163","authenticated-orcid":false,"given":"Susanne","family":"Dandl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5324-5966","authenticated-orcid":false,"given":"Giuseppe","family":"Casalicchio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6002-6980","authenticated-orcid":false,"given":"Bernd","family":"Bischl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1471-6582","authenticated-orcid":false,"given":"Ludwig","family":"Bothmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,17]]},"reference":[{"key":"29_CR1","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Wei, D.: Boolean decision rules via column generation. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems, NIPS 2018, pp. 4660\u20134670. Curran Associates Inc., Red Hook, NY, USA (2018)"},{"key":"29_CR2","unstructured":"Dhurandhar, A., et al.: Explanations based on the missing: towards contrastive explanations with pertinent negatives. In: Proceedings of the 32nd International Conference on Neural Information Processing Systems, NIPS 2018, pp. 590\u2013601. Curran Associates Inc., Red Hook, NY, USA (2018)"},{"key":"29_CR3","unstructured":"Doshi-Velez, F., Kim, B.: Towards a rigorous science of interpretable machine learning. arXiv 1702.08608 v2, arXiv.org E-Print Archive (2017). 10.48550\/arXiv. 1702.08608"},{"key":"29_CR4","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017). www.archive.ics.uci.edu\/ml\/datasets\/statlog+(german+credit+data)"},{"issue":"3","key":"29_CR5","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/a:1020546910706","volume":"23","author":"J Eckstein","year":"2002","unstructured":"Eckstein, J., Hammer, P.L., Liu, Y., Nediak, M., Simeone, B.: The maximum box problem and its application to data analysis. Comput. Optim. Appl. 23(3), 285\u2013298 (2002). https:\/\/doi.org\/10.1023\/a:1020546910706","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"29_CR6","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.1111\/coin.12410","volume":"37","author":"R El Shawi","year":"2021","unstructured":"El Shawi, R., Sherif, Y., Al-Mallah, M., Sakr, S.: Interpretability in healthcare: a comparative study of local machine learning interpretability techniques. Comput. Intell. 37(4), 1633\u20131650 (2021). https:\/\/doi.org\/10.1111\/coin.12410","journal-title":"Comput. Intell."},{"key":"29_CR7","doi-asserted-by":"publisher","unstructured":"Emmerich, M.T.M., Deutz, A.H., Kruisselbrink, J.W.: On quality indicators for black-box level set approximation. In: Tantar, E., et al. (eds.) EVOLVE- A Bridge between Probability, Set Oriented Numerics and Evolutionary Computation, pp. 157\u2013185. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-3-642-32726-1_4","DOI":"10.1007\/978-3-642-32726-1_4"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1109\/TIFS.2020.3021924","volume":"16","author":"M Fan","year":"2021","unstructured":"Fan, M., Wei, W., Xie, X., Liu, Y., Guan, X., Liu, T.: Can we trust your explanations? Sanity checks for interpreters in android malware analysis. IEEE Tran. Inf. Forensics Secur. 16, 838\u2013853 (2021). https:\/\/doi.org\/10.1109\/TIFS.2020.3021924","journal-title":"IEEE Tran. Inf. Forensics Secur."},{"issue":"12","key":"29_CR9","doi-asserted-by":"publisher","first-page":"5484","DOI":"10.1109\/tfuzz.2022.3179582","volume":"30","author":"G Fernandez","year":"2022","unstructured":"Fernandez, G., Aledo, J.A., Gamez, J.A., Puerta, J.M.: Factual and counterfactual explanations in fuzzy classification trees. IEEE Trans. Fuzzy Syst. 30(12), 5484\u20135495 (2022). https:\/\/doi.org\/10.1109\/tfuzz.2022.3179582","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"29_CR10","unstructured":"Ferreira, L.: German credit risk (2018). www.kaggle.com\/datasets\/kabure\/german-credit-data-with-risk. Accessed 23 Jan 2023"},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1023\/A:1008894516817","volume":"9","author":"JH Friedman","year":"1999","unstructured":"Friedman, J.H., Fisher, N.I.: Bump hunting in high-dimensional data. Stat. Comput. 9(2), 123\u2013143 (1999). https:\/\/doi.org\/10.1023\/A:1008894516817","journal-title":"Stat. Comput."},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-319-21542-6_4","volume-title":"Rule Technologies: Foundations, Tools, and Applications","author":"J F\u00fcrnkranz","year":"2015","unstructured":"F\u00fcrnkranz, J., Kliegr, T.: A brief overview of rule learning. In: Bassiliades, N., Gottlob, G., Sadri, F., Paschke, A., Roman, D. (eds.) RuleML 2015. LNCS, vol. 9202, pp. 54\u201369. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21542-6_4"},{"issue":"1","key":"29_CR13","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1080\/10618600.2014.907095","volume":"24","author":"A Goldstein","year":"2015","unstructured":"Goldstein, A., Kapelner, A., Bleich, J., Pitkin, E.: Peeking inside the black box: Visualizing statistical learning with plots of individual conditional expectation. J. Comput. Graph. Stat. 24(1), 44\u201365 (2015). https:\/\/doi.org\/10.1080\/10618600.2014.907095","journal-title":"J. Comput. Graph. Stat."},{"issue":"6","key":"29_CR14","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/MIS.2019.2957223","volume":"34","author":"R Guidotti","year":"2019","unstructured":"Guidotti, R., Monreale, A., Giannotti, F., Pedreschi, D., Ruggieri, S., Turini, F.: Factual and counterfactual explanations for black box decision making. IEEE Intell. Syst. 34(6), 14\u201323 (2019). https:\/\/doi.org\/10.1109\/MIS.2019.2957223","journal-title":"IEEE Intell. Syst."},{"key":"29_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-022-00878-5","author":"R Guidotti","year":"2022","unstructured":"Guidotti, R., Monreale, A., Ruggieri, S., Naretto, F., Turini, F., Pedreschi, D., Giannotti, F.: Stable and actionable explanations of black-box models through factual and counterfactual rules. Data Min. Knowl. Disc. (2022). https:\/\/doi.org\/10.1007\/s10618-022-00878-5","journal-title":"Data Min. Knowl. Disc."},{"key":"29_CR16","unstructured":"Guidotti, R., Monreale, A., Ruggieri, S., Pedreschi, D., Turini, F., Giannotti, F.: Local rule-based explanations of black box decision systems. arXiv 1805.10820, arXiv.org E-Print Archive (2018). 10.48550\/arXiv. 1805.10820"},{"issue":"13","key":"29_CR17","doi-asserted-by":"publisher","first-page":"11575","DOI":"10.1609\/aaai.v35i13.17377","volume":"35","author":"EM Kenny","year":"2021","unstructured":"Kenny, E.M., Keane, M.T.: On generating plausible counterfactual and semi-factual explanations for deep learning. Proc. AAAI Conf. Artif. Intell. 35(13), 11575\u201311585 (2021). https:\/\/doi.org\/10.1609\/aaai.v35i13.17377","journal-title":"Proc. AAAI Conf. Artif. Intell."},{"issue":"2","key":"29_CR18","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1007\/s00500-020-05226-7","volume":"25","author":"TT Khuat","year":"2020","unstructured":"Khuat, T.T., Ruta, D., Gabrys, B.: Hyperbox-based machine learning algorithms: a comprehensive survey. Soft Comput. 25(2), 1325\u20131363 (2020). https:\/\/doi.org\/10.1007\/s00500-020-05226-7","journal-title":"Soft Comput."},{"key":"29_CR19","unstructured":"Kingma, D.P., Ba, J.: Adam: a method for stochastic optimization. arXiv 1412.6980 v9, arXiv.org E-Print Archive (2017). 10.48550\/arXiv. 1412.6980"},{"key":"29_CR20","doi-asserted-by":"publisher","unstructured":"Kuratomi, A., Miliou, I., Lee, Z., Lindgren, T., Papapetrou, P.: JUICE: JUstIfied counterfactual explanations. In: Pascal, P., Ienco, D. (eds.) Discovery Science. pp. 493\u2013508. LNCS, Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18840-4_35","DOI":"10.1007\/978-3-031-18840-4_35"},{"key":"29_CR21","doi-asserted-by":"publisher","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497\u2013520 (1960). https:\/\/doi.org\/10.2307\/1910129","DOI":"10.2307\/1910129"},{"key":"29_CR22","unstructured":"Lemhadri, I., Li, H.H., Hastie, T.: RbX: region-based explanations of prediction models. arXiv 2210.08721, arXiv.org E-Print Archive (2022). 10.48550\/arXiv.2210.08721"},{"issue":"3","key":"29_CR23","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10844-008-0069-0","volume":"32","author":"C Nugent","year":"2009","unstructured":"Nugent, C., Doyle, D., Cunningham, P.: Gaining insight through case-based explanation. J. Intell. Inf. Syst. 32(3), 267\u2013295 (2009). https:\/\/doi.org\/10.1007\/s10844-008-0069-0","journal-title":"J. Intell. Inf. Syst."},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: 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 (2016)","DOI":"10.1145\/2939672.2939778"},{"key":"29_CR25","doi-asserted-by":"publisher","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: Anchors: High-precision model-agnostic explanations. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32, no. 1 (2018). https:\/\/doi.org\/10.1609\/aaai.v32i1.11491","DOI":"10.1609\/aaai.v32i1.11491"},{"key":"29_CR26","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: Anchor. Github repository. www.github.com\/marcotcr\/anchor (2022), Commit: b1f5e6ca37428613723597e85c38558e8cd21c2e"},{"key":"29_CR27","unstructured":"Schwartzenberg, C., van Engers, T.M., Li, Y.: The fidelity of global surrogates in interpretable machine learning. BNAIC\/BeneLearn 2020 (2020)"},{"key":"29_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-030-84060-0_21","volume-title":"Machine Learning and Knowledge Extraction","author":"R Sharma","year":"2021","unstructured":"Sharma, R., Reddy, N., Kamakshi, V., Krishnan, N.C., Jain, S.: MAIRE - a model-agnostic interpretable rule extraction procedure for explaining classifiers. In: Holzinger, A., Kieseberg, P., Tjoa, A.M., Weippl, E. (eds.) CD-MAKE 2021. LNCS, vol. 12844, pp. 329\u2013349. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84060-0_21"},{"key":"29_CR29","doi-asserted-by":"publisher","unstructured":"Stepin, I., Alonso, J.M., Catala, A., Pereira-Fari\u00f1a, M.: Generation and evaluation of factual and counterfactual explanations for decision trees and fuzzy rule-based classifiers. In: 2020 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), pp. 1\u20138. IEEE, Glasgow, United Kingdom (2020). https:\/\/doi.org\/10.1109\/FUZZ48607.2020.9177629","DOI":"10.1109\/FUZZ48607.2020.9177629"},{"issue":"2","key":"29_CR30","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/2641190.2641198","volume":"15","author":"J Vanschoren","year":"2014","unstructured":"Vanschoren, J., van Rijn, J.N., Bischl, B., Torgo, L.: OpenML: networked science in machine learning. SIGKDD Explor. Newsl. 15(2), 49\u201360 (2014). https:\/\/doi.org\/10.1145\/2641190.2641198","journal-title":"SIGKDD Explor. Newsl."},{"issue":"2","key":"29_CR31","first-page":"841","volume":"31","author":"S Wachter","year":"2018","unstructured":"Wachter, S., Mittelstadt, B., Russell, C.: Counterfactual explanations without opening the black box: automated decisions and the GDPR. Harvard J. Law Technol. 31(2), 841\u2013887 (2018)","journal-title":"Harvard J. Law Technol."},{"key":"29_CR32","series-title":"Women in Engineering and Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-030-11866-2_6","volume-title":"Women in Industrial and Systems Engineering","author":"ZB Zabinsky","year":"2020","unstructured":"Zabinsky, Z.B., Huang, H.: A partition-based optimization approach for level set approximation: probabilistic branch and bound. In: Smith, A.E. (ed.) Women in Industrial and Systems Engineering. WES, pp. 113\u2013155. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-11866-2_6"},{"key":"29_CR33","doi-asserted-by":"publisher","unstructured":"Zabinsky, Z.B., Wang, W., Prasetio, Y., Ghate, A., Yen, J.W.: Adaptive probabilistic branch and bound for level set approximation. In: Proceedings of the 2011 Winter Simulation Conference (WSC), pp. 4146\u20134157. IEEE, Phoenix, AZ, USA (2011). https:\/\/doi.org\/10.1109\/WSC.2011.6148103","DOI":"10.1109\/WSC.2011.6148103"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases: Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43418-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T13:10:34Z","timestamp":1719407434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43418-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031434174","9783031434181"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43418-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"For this work, no personal data was collected or processed. Only open source datasets were used for the illustrative example and the benchmark study. Furthermore, our work does not aim at a possible use for policing or military.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Statement"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"829","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"196","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.63","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Applied Data Science Track: 239 submissions, 58 accepted papers; Demo Track: 31 submissions, 16 accepted papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}