{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T20:46:06Z","timestamp":1768596366866,"version":"3.49.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030865191","type":"print"},{"value":"9783030865207","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86520-7_42","type":"book-chapter","created":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T15:25:48Z","timestamp":1631201148000},"page":"682-698","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Consequence-Aware Sequential Counterfactual Generation"],"prefix":"10.1007","author":[{"given":"Philip","family":"Naumann","sequence":"first","affiliation":[]},{"given":"Eirini","family":"Ntoutsi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,10]]},"reference":[{"issue":"2","key":"42_CR1","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6(2), 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"89497","DOI":"10.1109\/ACCESS.2020.2990567","volume":"8","author":"J Blank","year":"2020","unstructured":"Blank, J., Deb, K.: Pymoo: multi-objective optimization in python. IEEE Access 8, 89497\u201389509 (2020)","journal-title":"IEEE Access"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Carlini, N., Wagner, D.: Towards evaluating the robustness of neural networks. In: 2017 IEEE Symposium on Security and Privacy (SP), pp. 39\u201357, May 2017","DOI":"10.1109\/SP.2017.49"},{"key":"42_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-030-58112-1_31","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XVI","author":"S Dandl","year":"2020","unstructured":"Dandl, S., Molnar, C., Binder, M., Bischl, B.: Multi-objective counterfactual explanations. In: B\u00e4ck, T., et al. (eds.) PPSN 2020. LNCS, vol. 12269, pp. 448\u2013469. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58112-1_31"},{"key":"42_CR5","unstructured":"Downs, M., Chu, J.L., Yacoby, Y., Doshi-Velez, F., Pan, W.: CRUDS: counterfactual recourse using disentangled subspaces. In: ICML WHI 2020, pp. 1\u201323 (2020)"},{"key":"42_CR6","unstructured":"Dua, D., Graff, C.: UCI Machine Learning Repository. University of California, Irvine (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"42_CR7","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44874-8","volume-title":"Introduction to Evolutionary Computing","author":"A Eiben","year":"2015","unstructured":"Eiben, A., Smith, J.: Introduction to Evolutionary Computing. Natural Computing Series, Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-44874-8"},{"issue":"5","key":"42_CR8","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17(5), 487\u2013525 (2011)","journal-title":"J. Heuristics"},{"issue":"4","key":"42_CR9","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":"42_CR10","unstructured":"Joshi, S., Koyejo, O., Vijitbenjaronk, W., Kim, B., Ghosh, J.: Towards Realistic Individual Recourse and Actionable Explanations in Black-Box Decision Making Systems. arXiv:1907.09615, July 2019"},{"key":"42_CR11","unstructured":"Karimi, A.H., Barthe, G., Balle, B., Valera, I.: Model-agnostic counterfactual explanations for consequential decisions. In: AISTATS, pp. 895\u2013905. PMLR (2020)"},{"key":"42_CR12","unstructured":"Karimi, A.H., Barthe, G., Sch\u00f6lkopf, B., Valera, I.: A survey of algorithmic recourse: definitions, formulations, solutions, and prospects. arXiv:2010.04050 (2020)"},{"key":"42_CR13","unstructured":"Karimi, A.H., von K\u00fcgelgen, B.J., Sch\u00f6lkopf, B., Valera, I.: Algorithmic recourse under imperfect causal knowledge: a probabilistic approach. In: NeurIPS 33 (2020)"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Lash, M.T., Lin, Q., Street, N., Robinson, J.G., Ohlmann, J.: Generalized inverse classification. In: SDM 2017, pp. 162\u2013170. SIAM (2017)","DOI":"10.1137\/1.9781611974973.19"},{"key":"42_CR15","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-319-91473-2_9","volume-title":"Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations","author":"T Laugel","year":"2018","unstructured":"Laugel, T., Lesot, M.-J., Marsala, C., Renard, X., Detyniecki, M.: Comparison-based inverse classification for interpretability in machine learning. In: Medina, J., et al. (eds.) IPMU 2018. CCIS, vol. 853, pp. 100\u2013111. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91473-2_9"},{"key":"42_CR16","unstructured":"Mahajan, D., Tan, C., Sharma, A.: Preserving Causal Constraints in Counterfactual Explanations for Machine Learning Classifiers. arXiv:1912.03277, June 2020"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Mothilal, R.K., Sharma, A., Tan, C.: Explaining machine learning classifiers through diverse counterfactual explanations. In: FAT* 2020, pp. 607\u2013617. ACM, January 2020","DOI":"10.1145\/3351095.3372850"},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"Poyiadzi, R., Sokol, K., Santos-Rodriguez, R., De Bie, T., Flach, P.: FACE: feasible and actionable counterfactual explanations. In: Proceedings of the AAAI\/ACM Conference on AI, Ethics, and Society, AIES 2020, pp. 344\u2013350. ACM, February 2020","DOI":"10.1145\/3375627.3375850"},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, G., Lee, Y.C., Albarghouthi, A.: Synthesizing action sequences for modifying model decisions. In: AAAI, vol. 34, no. 04, pp. 5462\u20135469 (2020)","DOI":"10.1609\/aaai.v34i04.5996"},{"key":"42_CR20","unstructured":"Shavit, Y., Moses, W.S.: Extracting Incentives from Black-Box Decisions. arXiv:1910.05664, October 2019"},{"issue":"3","key":"42_CR21","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas, N., Deb, K.: Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol. Comput. 2(3), 221\u2013248 (1994)","journal-title":"Evol. Comput."},{"key":"42_CR22","doi-asserted-by":"crossref","unstructured":"Ustun, B., Spangher, A., Liu, Y.: Actionable recourse in linear classification. In: Proceedings of the Conference on Fairness, Accountability, and Transparency, pp. 10\u201319. ACM, January 2019","DOI":"10.1145\/3287560.3287566"},{"key":"42_CR23","unstructured":"Van Looveren, A., Klaise, J.: Interpretable Counterfactual Explanations Guided by Prototypes. arXiv:1907.02584, July 2019"},{"key":"42_CR24","doi-asserted-by":"crossref","unstructured":"Wachter, S., Mittelstadt, B., Russell, C.: Counterfactual Explanations Without Opening the Black Box: Automated Decisions and the GDPR. SSRN (2017)","DOI":"10.2139\/ssrn.3063289"}],"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-030-86520-7_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T22:04:40Z","timestamp":1757369080000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86520-7_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030865191","9783030865207"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86520-7_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Bilbao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2021.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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"869","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":"210","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-4","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":"3-9","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":"The conference was held online due to the COVID-19 pandemic.","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)"}}]}}