{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T02:17:56Z","timestamp":1772504276873,"version":"3.50.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030937355","type":"print"},{"value":"9783030937362","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-93736-2_37","type":"book-chapter","created":{"date-parts":[[2022,2,17]],"date-time":"2022-02-17T21:02:28Z","timestamp":1645131748000},"page":"489-504","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Exploring Counterfactual Explanations for\u00a0Classification and\u00a0Regression Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5681-6832","authenticated-orcid":false,"given":"Suryabhan Singh","family":"Hada","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3297-9375","authenticated-orcid":false,"given":"Miguel \u00c1.","family":"Carreira-Perpi\u00f1\u00e1n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,17]]},"reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s00607-010-0129-5","volume":"91","author":"A Bella","year":"2011","unstructured":"Bella, A., Ferri, C., Hern\u00e1ndez-Orallo, J., Ram\u00edrez-Quintana, M.J.: Using negotiable features for prescription problems. Computing 91, 135\u2013168 (2011)","journal-title":"Computing"},{"key":"37_CR2","volume-title":"Classification and Regression Trees","author":"LJ Breiman","year":"1984","unstructured":"Breiman, L.J., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth, Belmont (1984)"},{"key":"37_CR3","unstructured":"Carreira-Perpi\u00f1\u00e1n, M.\u00c1.: The Tree Alternating Optimization (TAO) algorithm: a new way to learn decision trees and tree-based models (2021). arXIV"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Carreira-Perpi\u00f1\u00e1n, M.\u00c1., Hada, S.S.: Counterfactual explanations for oblique decision trees: exact, efficient algorithms. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI 2021), 2\u20139 February 2021, pp. 6903\u20136911 (2021)","DOI":"10.1609\/aaai.v35i8.16851"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Carreira-Perpi\u00f1\u00e1n, M.\u00c1., Hada, S.S.: Counterfactual explanations for oblique decision trees: exact, efficient algorithms. arXiv:2103.01096 (2021)","DOI":"10.1609\/aaai.v35i8.16851"},{"key":"37_CR6","unstructured":"Carreira-Perpi\u00f1\u00e1n, M.\u00c1., Hada, S.S.: Inverse classification with logistic and softmax classifiers: efficient optimization (2021). arXIV"},{"key":"37_CR7","first-page":"1211","volume-title":"Advances in Neural Information Processing Systems (NEURIPS)","author":"M\u00c1 Carreira-Perpi\u00f1\u00e1n","year":"2018","unstructured":"Carreira-Perpi\u00f1\u00e1n, M.\u00c1., Tavallali, P.: Alternating optimization of decision trees, with application to learning sparse oblique trees. In: Bengio, S., Wallach, H., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems (NEURIPS), vol. 31, pp. 1211\u20131221. MIT Press, Cambridge (2018)"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Carreira-Perpi\u00f1\u00e1n, M.\u00c1., Zharmagambetov, A.: Ensembles of bagged TAO trees consistently improve over random forests, AdaBoost and gradient boosting. In: Proceedings of the 2020 ACM-IMS Foundations of Data Science Conference (FODS 2020), Seattle, WA, 19\u201320 October 2020, pp. 35\u201346(2020)","DOI":"10.1145\/3412815.3416882"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Cui, Z., Chen, W., He, Y., Chen, Y.: Optimal action extraction for random forests and boosted trees. In: Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD 2015), Sydney, Australia, 10\u201313 August 2015, pp. 179\u2013188 (2015)","DOI":"10.1145\/2783258.2783281"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Dosovitskiy, A., Brox, T.: Inverting visual representations with convolutional networks. In: Proceedings of the 2016 IEEE Computer Society Conference Computer Vision and Pattern Recognition (CVPR\u201916), Las Vegas, NV, 26 June\u20131 July 2016 (2016)","DOI":"10.1109\/CVPR.2016.522"},{"issue":"1","key":"37_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2594473.2594475","volume":"15","author":"AA Freitas","year":"2014","unstructured":"Freitas, A.A.: Comprehensible classification models: a position paper. SIGKDD Explor. 15(1), 1\u201310 (2014)","journal-title":"SIGKDD Explor."},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Gabidolla, M., Zharmagambetov, A., Carreira-Perpi\u00f1\u00e1n, M.\u00c1.: Improved multiclass adaboost using sparse oblique decision trees (2021), submitted","DOI":"10.1109\/IJCNN55064.2022.9892743"},{"key":"37_CR13","unstructured":"Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. In: Proceedings of the 3rd International Conference on Learning Representations (ICLR 2015), San Diego, CA, 7\u20139 May 2015 (2015)"},{"issue":"5","key":"37_CR14","first-page":"93","volume":"51","author":"R Guidotti","year":"2018","unstructured":"Guidotti, R., Monreale, A., Ruggieri, S., Turini, F., Giannotti, F., Pedreschi, D.: A survey of methods for explaining black box models. ACM Comput. Surv. 51(5), 93 (2018)","journal-title":"ACM Comput. Surv."},{"key":"37_CR15","unstructured":"Gurobi Optimization, LLC: Gurobi optimizer reference manual (2019)"},{"key":"37_CR16","unstructured":"Hada, S.S., Carreira-Perpi\u00f1\u00e1n, M.\u00c1.: Sampling the \u201cinverse set\u201d of a neuron: an approach to understanding neural nets. arXiv:1910.04857 (2019)"},{"key":"37_CR17","doi-asserted-by":"crossref","unstructured":"Hada, S.S., Carreira-Perpi\u00f1\u00e1n, M.\u00c1.: Sampling the \u201cinverse set\u201d of a neuron. In: IEEE International Conference on Image Processing (ICIP 2021), Anchorage, AK, 9\u201312 September 2021 (2021)","DOI":"10.1109\/ICIP42928.2021.9506500"},{"key":"37_CR18","unstructured":"Hada, S.S., Carreira-Perpi\u00f1\u00e1n, M.\u00c1., Zharmagambetov, A.: Sparse oblique decision trees: a tool to understand and manipulate neural net features. arXiv:2104.02922 (2021)"},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"Hada, S.S., Carreira-Perpi\u00f1\u00e1n, M.\u00c1., Zharmagambetov, A.: Understanding and manipulating neural net features using sparse oblique classification trees. In: IEEE International Conference on Image Processing (ICIP 2021), Anchorage, AK, 19\u201312 September 2021 (2021)","DOI":"10.1109\/ICIP42928.2021.9506373"},{"key":"37_CR20","unstructured":"Idelbayev, Y., Zharmagambetov, A., Gabidolla, M., Carreira-Perpi\u00f1\u00e1n, M.\u00c1.: Faster neural net inference via forests of sparse oblique decision trees (2021). arXIV"},{"issue":"10","key":"37_CR21","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/3233231","volume":"81","author":"ZC Lipton","year":"2018","unstructured":"Lipton, Z.C.: The mythos of model interpretability. Comm. ACM 81(10), 36\u201343 (2018)","journal-title":"Comm. ACM"},{"issue":"3","key":"37_CR22","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s11263-016-0911-8","volume":"120","author":"A Mahendran","year":"2016","unstructured":"Mahendran, A., Vedaldi, A.: Visualizing deep convolutional neural networks using natural pre-images. Int. J. Comput. Vision 120(3), 233\u2013255 (2016)","journal-title":"Int. J. Comput. Vision"},{"issue":"1","key":"37_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.25300\/MISQ\/2014\/38.1.04","volume":"38","author":"D Martens","year":"2014","unstructured":"Martens, D., Provost, F.: Explaining data-driven document classifications. MIS Q. 38(1), 73\u201399 (2014)","journal-title":"MIS Q."},{"key":"37_CR24","doi-asserted-by":"crossref","unstructured":"Russell, C.: Efficient search for diverse coherent explanations. In: Proceedings of ACM Conference Fairness, Accountability, and Transparency (FAT 2019), Atlanta, GA, 29\u201331 January 2019, pp. 20\u201328 (2019)","DOI":"10.1145\/3287560.3287569"},{"key":"37_CR25","unstructured":"Simonyan, K., Vedaldi, A., Zisserman, A.: Deep inside convolutional networks: visualising image classification models and saliency maps. In: Proceedings of the 2nd International Conference Learning Representations (ICLR 2014), Banff, Canada, 14\u201316 April 2014 (2014)"},{"key":"37_CR26","unstructured":"Szegedy, C., et al.: Intriguing properties of neural networks. In: Proceedings of the 2nd International Conference on Learning Representations (ICLR 2014), Banff, Canada, 14\u201316 April 2014 (2014)"},{"key":"37_CR27","doi-asserted-by":"crossref","unstructured":"Ustun, B., Spangher, A., Liu, Y.: Actionable recourse in linear classification. In: Proceedings of ACM Conference Fairness, Accountability, and Transparency (FAT 2019), Atlanta, GA, 29\u201331 January 2019, pp. 10\u201319 (2019)","DOI":"10.1145\/3287560.3287566"},{"issue":"2","key":"37_CR28","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":"37_CR29","unstructured":"Wu, X., Kumar, V. (eds.): The Top Ten Algorithms in Data Mining. Chapman & Hall\/CRC Data Mining and Knowledge Discovery Series, CRC Publishers, Boca Raton (2009)"},{"issue":"1","key":"37_CR30","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TKDE.2007.250584","volume":"18","author":"Q Yang","year":"2006","unstructured":"Yang, Q., Yin, J., Ling, C.X., Pan, R.: Extracting actionable knowledge from decision trees. IEEE Trans. Knowl. Data Eng. 18(1), 43\u201356 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"37_CR31","doi-asserted-by":"crossref","unstructured":"Zeiler, M.D., Fergus, R.: Visualizing and understanding convolutional networks. In: Proceedings of 13th European Conference Computer Vision (ECCV\u201914), Z\u00fcrich, Switzerland, 6\u201312 September 2014, pp. 818\u2013833 (2014)","DOI":"10.1007\/978-3-319-10590-1_53"},{"key":"37_CR32","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.eswa.2017.04.003","volume":"82","author":"C Zhang","year":"2017","unstructured":"Zhang, C., Liu, C., Zhang, X., Almpanidis, G.: An up-to-date comparison of state-of-the-art classification algorithms. Expert Syst. Appl. 82, 128\u2013150 (2017)","journal-title":"Expert Syst. Appl."},{"key":"37_CR33","unstructured":"Zharmagambetov, A., Carreira-Perpi\u00f1\u00e1n, M.\u00c1.: Smaller, more accurate regression forests using tree alternating optimization. In: Daum\u00e9 III, H., Singh, A. (eds.) Proceedings of the 37th International Conference on Machine Learning (ICML 2020), 13\u201318 July 2020, pp. 11398\u201311408 (2020)"},{"key":"37_CR34","doi-asserted-by":"crossref","unstructured":"Zharmagambetov, A., Carreira-Perpi\u00f1\u00e1n, M.\u00c1.: Learning a tree of neural nets. In: Proceedings of the IEEE International Conference Acoustics, Speech and Signal Processing (ICASSP\u201921), , Toronto, Canada, 6\u201311 June 2021, pp. 3140\u20133144 (2021)","DOI":"10.1109\/ICASSP39728.2021.9413718"},{"key":"37_CR35","doi-asserted-by":"crossref","unstructured":"Zharmagambetov, A., Gabidolla, M., Carreira-Perpi\u00f1\u00e1n, M.\u00c1.: Improved boosted regression forests through non-greedy tree optimization. In: International Joint Conference Neural Networks (IJCNN\u201921), Virtual Event, 18\u201322 July 2021 (2021)","DOI":"10.1109\/IJCNN52387.2021.9534446"},{"key":"37_CR36","doi-asserted-by":"crossref","unstructured":"Zharmagambetov, A., Gabidolla, M., Carreira-Perpi\u00f1\u00e1n, M.\u00c1.: Improved multiclass AdaBoost for image classification: the role of tree optimization. In: IEEE International Conference on Image Processing (ICIP 2021), Anchorage, AK, 19\u201322 September 2021 (2021)","DOI":"10.1109\/ICIP42928.2021.9506569"},{"key":"37_CR37","doi-asserted-by":"crossref","unstructured":"Zharmagambetov, A., Gabidolla, M., Carreira-Perpi\u00f1\u00e1n, M.\u00c1.: Softmax tree: an accurate, fast classifier when the number of classes is large (2021), submitted","DOI":"10.18653\/v1\/2021.emnlp-main.838"},{"key":"37_CR38","doi-asserted-by":"crossref","unstructured":"Zharmagambetov, A., Hada, S.S., Gabidolla, M., Carreira-Perpi\u00f1\u00e1n, M.\u00c1.: Non-greedy algorithms for decision tree optimization: an experimental comparison. In: International Joint Conference on Neural Networks (IJCNN\u201921), Virtual event, 18\u201322 July 2021 (2021)","DOI":"10.1109\/IJCNN52387.2021.9533597"}],"container-title":["Communications in Computer and Information Science","Machine Learning and Principles and Practice of Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93736-2_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T08:29:04Z","timestamp":1674808144000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93736-2_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030937355","9783030937362"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93736-2_37","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 February 2022","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)"}}]}}