{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T21:12:17Z","timestamp":1781039537117,"version":"3.54.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030581114","type":"print"},{"value":"9783030581121","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T00:00:00Z","timestamp":1598832000000},"content-version":"vor","delay-in-days":243,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58112-1_31","type":"book-chapter","created":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T16:04:30Z","timestamp":1599062670000},"page":"448-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":176,"title":["Multi-Objective Counterfactual Explanations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4324-4163","authenticated-orcid":false,"given":"Susanne","family":"Dandl","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2331-868X","authenticated-orcid":false,"given":"Christoph","family":"Molnar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Binder","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6002-6980","authenticated-orcid":false,"given":"Bernd","family":"Bischl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,8,31]]},"reference":[{"key":"31_CR1","unstructured":"Allaire, J., Chollet, F.: keras: R Interface to \u2018Keras\u2019 (2019). https:\/\/keras.rstudio.com , R package version 2.3.0"},{"key":"31_CR2","unstructured":"Avila, S.L., Kr\u00e4henb\u00fchl, L., Sareni, B.: A multi-niching multi-objective genetic algorithm for solving complex multimodal problems. In: OIPE. Sorrento, Italy (2006). https:\/\/hal.archives-ouvertes.fr\/hal-00398660"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Binder, M., Moosbauer, J., Thomas, J., Bischl, B.: Multi-Objective Hyperparameter Tuning and Feature Selection using Filter Ensembles (2019). Accepted at GECCO 2020","DOI":"10.1145\/3377930.3389815"},{"key":"31_CR4","unstructured":"Bischl, B., et al.: mlr: Machine Learning in R. J. Mach. Learn. Res. 17(170), 1\u20135 (2016). http:\/\/jmlr.org\/papers\/v17\/15-066.html , R package version 2.17"},{"key":"31_CR5","doi-asserted-by":"publisher","unstructured":"Breiman, L.: Statistical modeling: the two cultures. Stat. Sci. 16(3), 199\u2013231 (2001). https:\/\/doi.org\/10.1214\/ss\/1009213726","DOI":"10.1214\/ss\/1009213726"},{"key":"31_CR6","first-page":"115","volume":"9","author":"K Deb","year":"1995","unstructured":"Deb, K., Agarwal, R.B.: Simulated binary crossover for continuous search space. Complex Syst. 9, 115\u2013148 (1995)","journal-title":"Complex Syst."},{"issue":"2","key":"31_CR7","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002). https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans. Evol. Comput."},{"key":"31_CR8","unstructured":"Dhurandhar, A., Pedapati, T., Balakrishnan, A., Chen, P., Shanmugam, K., Puri, R.: Model Agnostic Contrastive Explanations for Structured Data. CoRR abs\/1906.00117 (2019). http:\/\/arxiv.org\/abs\/1906.00117"},{"key":"31_CR9","doi-asserted-by":"publisher","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","DOI":"10.1080\/10618600.2014.907095"},{"issue":"4","key":"31_CR10","doi-asserted-by":"publisher","first-page":"857","DOI":"10.2307\/2528823","volume":"27","author":"JC Gower","year":"1971","unstructured":"Gower, J.C.: A general coefficient of similarity and some of its properties. Biometrics 27(4), 857\u2013871 (1971)","journal-title":"Biometrics"},{"key":"31_CR11","unstructured":"Grath, R.M., et al.: Interpretable Credit Application Predictions With Counterfactual Explanations. CoRR (abs\/1811.05245) (2018). http:\/\/arxiv.org\/abs\/1811.05245"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Greenwell, B.M., Boehmke, B.C., McCarthy, A.J.: A simple and effective model-based variable importance measure. arXiv preprint arXiv:1805.04755 (2018)","DOI":"10.32614\/CRAN.package.vip"},{"key":"31_CR13","unstructured":"Hofmann, H.: German Credit Risk (2016). https:\/\/www.kaggle.com\/uciml\/german-credit . Accessed 25 Jan 2020"},{"key":"31_CR14","unstructured":"Hothorn, T., Zeileis, A.: Transformation Forests (2017)"},{"key":"31_CR15","unstructured":"Joshi, S., Koyejo, O., Vijitbenjaronk, W., Kim, B., Ghosh, J.: Towards Realistic Individual Recourse and Actionable Explanations in black-box decision making systems. CoRR abs\/1907.09615 (2019). http:\/\/arxiv.org\/abs\/1907.09615"},{"key":"31_CR16","unstructured":"Karimi, A., Barthe, G., Balle, B., Valera, I.: Model-Agnostic Counterfactual Explanations for Consequential Decisions. CoRR (abs\/1905.11190) (2019). http:\/\/arxiv.org\/abs\/1905.11190"},{"key":"31_CR17","unstructured":"Kingma, D., Ba, J.: Adam: a method for stochastic optimization. In: International Conference on Learning Representations, December 2014"},{"key":"31_CR18","unstructured":"Laugel, T., Lesot, M.J., Marsala, C., Renard, X., Detyniecki, M.: Comparison-Based Inverse Classification for Interpretability in Machine Learning. CoRR (abs\/1712.08443) (2017). http:\/\/arxiv.org\/abs\/1712.08443"},{"issue":"1","key":"31_CR19","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1162\/EVCO_a_00059","volume":"21","author":"R Li","year":"2013","unstructured":"Li, R., et al.: Mixed integer evolution strategies for parameter optimization. Evol. Comput. 21(1), 29\u201364 (2013)","journal-title":"Evol. Comput."},{"key":"31_CR20","unstructured":"Looveren, A.V., Klaise, J.: Interpretable Counterfactual Explanations Guided by Prototypes. CoRR abs\/1907.02584 (2019). http:\/\/arxiv.org\/abs\/1907.02584"},{"key":"31_CR21","doi-asserted-by":"publisher","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016). https:\/\/doi.org\/10.1016\/j.orp.2016.09.002 , http:\/\/www.sciencedirect.com\/science\/article\/pii\/S2214716015300270 , R package version 3.4.1","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"31_CR22","unstructured":"Lundberg, S.M., Lee, S.I.: A unified approach to interpreting model predictions. In: Advances in Neural Information Processing Systems, pp. 4765\u20134774 (2017)"},{"key":"31_CR23","doi-asserted-by":"publisher","unstructured":"Molnar, C., Bischl, B., Casalicchio, G.: iml: an R package for interpretable machine learning. JOSS 3(26), 786 (2018). https:\/\/doi.org\/10.21105\/joss.00786","DOI":"10.21105\/joss.00786"},{"key":"31_CR24","unstructured":"Mothilal, R.K., Sharma, A., Tan, C.: Explaining Machine Learning Classifiers through Diverse Counterfactual explanations. CoRR (abs\/1905.07697) (2019). http:\/\/arxiv.org\/abs\/1905.07697"},{"key":"31_CR25","doi-asserted-by":"crossref","unstructured":"Poyiadzi, R., Sokol, K., Santos-Rodriguez, R., Bie, T.D., Flach, P.: FACE: Feasible and Actionable Counterfactual Explanations (2019)","DOI":"10.1145\/3375627.3375850"},{"key":"31_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/978-3-642-37140-0_61","volume-title":"Evolutionary Multi-Criterion Optimization","author":"A Radulescu","year":"2013","unstructured":"Radulescu, A., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Automatically improving the anytime behaviour of multiobjective evolutionary algorithms. In: Purshouse, R.C., Fleming, P.J., Fonseca, C.M., Greco, S., Shaw, J. (eds.) EMO 2013. LNCS, vol. 7811, pp. 825\u2013840. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37140-0_61"},{"key":"31_CR27","doi-asserted-by":"crossref","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: \u201cWhy should i trust you?\u201d 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":"31_CR28","unstructured":"Russell, C.: Efficient Search for Diverse Coherent Explanations. CoRR (abs\/1901.04909) (2019). http:\/\/arxiv.org\/abs\/1901.04909"},{"key":"31_CR29","unstructured":"Sharma, S., Henderson, J., Ghosh, J.: CERTIFAI: Counterfactual Explanations for Robustness, Transparency, Interpretability, and Fairness of Artificial Intelligence models. CoRR abs\/1905.07857 (2019). http:\/\/arxiv.org\/abs\/1905.07857"},{"key":"31_CR30","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1109\/TEVC.2019.2890858","volume":"23","author":"J Su","year":"2017","unstructured":"Su, J., Vargas, D.V., Sakurai, K.: One pixel attack for fooling deep neural networks. IEEE Trans. Evol. Comput. 23, 828\u2013841 (2017)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"31_CR31","unstructured":"Syswerda, G.: Uniform crossover in genetic algorithms. In: Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 2\u20139. Morgan Kaufmann Publishers Inc., San Francisco (1989)"},{"key":"31_CR32","doi-asserted-by":"publisher","unstructured":"Tolomei, G., Silvestri, F., Haines, A., Lalmas, M.: Interpretable predictions of tree-based ensembles via actionable feature tweaking. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2017, pp. 465\u2013474. ACM, New York (2017). https:\/\/doi.org\/10.1145\/3097983.3098039","DOI":"10.1145\/3097983.3098039"},{"key":"31_CR33","doi-asserted-by":"publisher","unstructured":"Ustun, B., Spangher, A., Liu, Y.: Actionable recourse in linear classification. In: Proceedings of the Conference on Fairness, Accountability, and Transparency, FAT* 2019, pp. 10\u201319. ACM, New York (2019). https:\/\/doi.org\/10.1145\/3287560.3287566","DOI":"10.1145\/3287560.3287566"},{"key":"31_CR34","doi-asserted-by":"publisher","unstructured":"Vanschoren, J., van Rijn, J.N., Bischl, B., Torgo, L.: OpenML: networked science in machine learning. SIGKDD Explor. 15(2), 49\u201360 (2013). https:\/\/doi.org\/10.1145\/2641190.2641198","DOI":"10.1145\/2641190.2641198"},{"key":"31_CR35","unstructured":"Wachter, S., Mittelstadt, B.D., Russell, C.: Counterfactual Explanations without Opening the Black Box: Automated Decisions and the GDPR. CoRR (abs\/1711.00399) (2017). http:\/\/arxiv.org\/abs\/1711.00399"},{"key":"31_CR36","unstructured":"Wexler, J., Pushkarna, M., Bolukbasi, T., Wattenberg, M., Vi\u00e9gas, F.B., Wilson, J.: The What- If Tool: Interactive Probing of Machine Learning Models. CoRR abs\/1907.04135 (2019). http:\/\/arxiv.org\/abs\/1907.04135"},{"key":"31_CR37","unstructured":"White, A., d\u2019Avila Garcez, A.: Measurable Counterfactual Local Explanations for Any Classifier (2019)"},{"key":"31_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0056872","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN V","author":"E Zitzler","year":"1998","unstructured":"Zitzler, E., Thiele, L.: Multiobjective optimization using evolutionary algorithms\u2014a comparative case study. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 292\u2013301. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056872"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58112-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,13]],"date-time":"2024-08-13T02:33:41Z","timestamp":1723516421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58112-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581114","9783030581121"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58112-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"31 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leiden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2020.liacs.leidenuniv.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"268","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":"99","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":"37% - 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","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":"2.2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}