{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:33:12Z","timestamp":1743147192638,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031789793"},{"type":"electronic","value":"9783031789809"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T00:00:00Z","timestamp":1738022400000},"content-version":"vor","delay-in-days":27,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Counterfactual explanations play a crucial role in interpreting and understanding the decision-making process of complex machine learning models, offering insights into why a particular prediction was made and how it could be altered. However, individual counterfactual explanations generated by different methods may vary significantly in terms of their quality, diversity, and coherence to the black-box prediction. This is especially important in financial applications such as churn analysis, where customer retention officers could explore different approaches and solutions with the clients to prevent churning. The officer\u2019s capability to modify and explore different explanations is pivotal to his ability to provide feasible solutions. To address this challenge, we propose an evaluation framework through the implementation of an ensemble approach that combines state-of-the-art counterfactual generation methods and a linear combination score of desired properties to select the most appropriate explanation. We conduct our experiments on three publicly available churn datasets in different domains. Our experimental results demonstrate that the ensemble of counterfactual explanations provides more diverse and comprehensive insights into model behavior compared to individual methods alone that suffer from specific weaknesses. By aggregating, evaluating, and selecting multiple explanations, our approach enhances the diversity of the explanation, highlights common patterns, and mitigates the limitations of any single method, offering to the user the ability to tweak the explanation properties to their needs.<\/jats:p>","DOI":"10.1007\/978-3-031-78980-9_21","type":"book-chapter","created":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T10:25:48Z","timestamp":1737973548000},"page":"332-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ensemble Counterfactual Explanations for\u00a0Churn Analysis"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-8080-6478","authenticated-orcid":false,"given":"Samuele","family":"Tonati","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8884-5432","authenticated-orcid":false,"given":"Marzio","family":"Di Vece","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3268-9271","authenticated-orcid":false,"given":"Roberto","family":"Pellungrini","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3099-3835","authenticated-orcid":false,"given":"Fosca","family":"Giannotti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,28]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"11974","DOI":"10.1109\/ACCESS.2021.3051315","volume":"9","author":"I Stepin","year":"2021","unstructured":"Stepin, I., Alonso, J.M., Catal\u00e1, A., Pereira-Fari\u00f1a, M.: A survey of contrastive and counterfactual explanation generation methods for explainable artificial intelligence. IEEE Access 9, 11974\u201312001 (2021)","journal-title":"IEEE Access"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Guidotti, R.: Counterfactual explanations and how to find them: literature review and benchmarking. Data Mining and Knowledge Discovery (2022)","DOI":"10.1007\/s10618-022-00831-6"},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s41060-022-00312-5","volume":"14","author":"L Geiler","year":"2022","unstructured":"Geiler, L., Affeldt, S., Nadif, M.: A survey on machine learning methods for churn prediction. Int. J. Data Sci. Anal. 14(3), 217\u2013242 (2022)","journal-title":"Int. J. Data Sci. Anal."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"69130","DOI":"10.1109\/ACCESS.2024.3401247","volume":"12","author":"UG Joy","year":"2024","unstructured":"Joy, U.G., Hoque, K.E., Uddin, M.N., Chowdhury, L., Park, S.-B.: A big data-driven hybrid model for enhancing streaming service customer retention through churn prediction integrated with explainable AI. IEEE Access 12, 69130\u201369150 (2024)","journal-title":"IEEE Access"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Chen, W.: Customer churn analysis for telecom operators based on SVM. In: Proceedings of the 3rd International Conference on Signal and Information Processing, Networking and Computers (ICSINC), vol. 473, pp. 327\u2013332. Springer (2017)","DOI":"10.1007\/978-981-10-7521-6_39"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Mishra, A., Reddy, U.S.: A comparative study of customer churn prediction in telecom industry using ensemble based classifiers. In: International Conference on Inventive Computing and Informatics (ICICI), pp. 721\u2013725. IEEE (2017)","DOI":"10.1109\/ICICI.2017.8365230"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Petkovski, A.J., Stojkoska, B.L.R., Trivodaliev, K.V., Kalajdziski, S.A.: Analysis of churn prediction: a case study on telecommunication services in Macedonia. In: 2016 24th Telecommunications Forum (TELFOR), pp. 1\u20134. IEEE (2016)","DOI":"10.1109\/TELFOR.2016.7818903"},{"issue":"3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"4626","DOI":"10.1016\/j.eswa.2008.05.027","volume":"36","author":"J Burez","year":"2009","unstructured":"Burez, J., Van den Poel, D.: Handling class imbalance in customer churn prediction. Expert Syst. Appl. 36(3), 4626\u20134636 (2009)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"21_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.ejor.2019.12.007","volume":"284","author":"S Maldonado","year":"2020","unstructured":"Maldonado, S., L\u00f3pez, J., Vairetti, C.: Profit-based churn prediction based on minimax probability machines. Eur. J. Oper. Res. 284(1), 273\u2013284 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"113523","DOI":"10.1016\/j.dss.2021.113523","volume":"150","author":"KW De Bock","year":"2021","unstructured":"De Bock, K.W., De Caigny, A.: Spline-rule ensemble classifiers with structured sparsity regularization for interpretable customer churn modeling. Decis. Support Syst. 150, 113523 (2021)","journal-title":"Decis. Support Syst."},{"key":"21_CR11","first-page":"1","volume":"80","author":"DD Adhikary","year":"2020","unstructured":"Adhikary, D.D., Gupta, D.: Applying over 100 classifiers for churn prediction in telecom companies. Multimed. Tools Appl. 80, 1\u201322 (2020)","journal-title":"Multimed. Tools Appl."},{"issue":"6","key":"21_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1509\/jm.15.0420","volume":"80","author":"KN Lemon","year":"2016","unstructured":"Lemon, K.N., Verhoef, P.C.: Understanding customer experience throughout the customer journey. J Mark. 80(6), 69\u201396 (2016)","journal-title":"J Mark."},{"issue":"2","key":"21_CR13","first-page":"264","volume":"50","author":"X Luo","year":"2013","unstructured":"Luo, X., Kumar, V.: Operational efficiency and customer retention in outsourced customer service operations. J. Mark. Res. 50(2), 264\u2013278 (2013)","journal-title":"J. Mark. Res."},{"issue":"22","key":"21_CR14","doi-asserted-by":"publisher","first-page":"19501","DOI":"10.1007\/s00521-022-07603-9","volume":"34","author":"G Theodoridis","year":"2022","unstructured":"Theodoridis, G., Tsadiras, A.: Applying machine learning techniques to predict and explain subscriber churn of an online drug information platform. Neural Comput. Appl. 34(22), 19501\u201319514 (2022)","journal-title":"Neural Comput. Appl."},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1109\/TG.2022.3173399","volume":"15","author":"J Tao","year":"2023","unstructured":"Tao, J., et al.: Explainable AI for cheating detection and churn prediction in online games. IEEE Trans. Games 15(2), 242\u2013251 (2023)","journal-title":"IEEE Trans. Games"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Guidotti, R., Ruggieri, S.: Ensemble of counterfactual explainers. In: DS 2021. LNCS, vol. 12986, pp. 358\u2013368. Springer (2021)","DOI":"10.1007\/978-3-030-88942-5_28"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Sharma, S., Henderson, J., Ghosh, J.: CERTIFAI: counterfactual explanations for robustness, transparency, interpretability, and fairness of artificial intelligence models (2019)","DOI":"10.1145\/3375627.3375812"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Laugel, T., Lesot, M.-J., Marsala, C., Renard, X., Detyniecki, M.: The dangers of post-hoc interpretability: unjustified counterfactual explanations (2019)","DOI":"10.24963\/ijcai.2019\/388"},{"key":"21_CR19","unstructured":"Samoilescu, R.-F., Van Looveren, A., Klaise, J.: Model-agnostic and scalable counterfactual explanations via reinforcement learning. CoRR, abs\/2106.02597 (2021)"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Bodria, F., Guidotti, R., Giannotti, F., Pedreschi, D.: Transparent latent space counterfactual explanations for tabular data. In: DSAA, pp. 1\u201310. IEEE (2022)","DOI":"10.1109\/DSAA54385.2022.10032407"},{"key":"21_CR21","unstructured":"Ke, G., et al.:. LightGBM: a highly efficient gradient boosting decision tree. In: NIPS, pp. 3146\u20133154 (2017)"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: XGBoost: a scalable tree boosting system. In: KDD, pp. 785\u2013794. ACM (2016)","DOI":"10.1145\/2939672.2939785"},{"issue":"1","key":"21_CR23","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. 45(1), 5\u201332 (2001)","journal-title":"Mach. Learn."},{"key":"21_CR24","unstructured":"Lundberg, S.M., Lee, S.-I.: A unified approach to interpreting model predictions. In: NIPS, pp. 4765\u20134774 (2017)"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78980-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,27]],"date-time":"2025-01-27T10:25:59Z","timestamp":1737973559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78980-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031789793","9783031789809"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78980-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discovery Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pisa","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dis2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ds2024.isti.cnr.it\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}