Arguments based on domain rules in prediction justifications

Publication date

2024

Authors

Peters, J. G. T.ISNI 0000000492522964
Bex, FlorisORCID 0000-0002-5699-9656ISNI 0000000118066508
Prakken, H.ISNI 000000011466763X

Editors

Advisors

Supervisors

DOI

Document Type

Part of book
Open Access logo

License

cc_by

Abstract

Ensuring the interpretability of trained machine learning models is often paramount, particularly in high-stakes domains such as counter-terrorism and other forms of law enforcement. Post hoc techniques have emerged as a promising avenue for justifying the predictions of complex models. However, while these approaches provide valuable insights, they often lack the ability to directly reference familiar domain rules and make use of these rules to guide explanations. This paper introduces a method for incorporating arguments about the applicability of domain rules in justifying classifier predictions

Keywords

Case-Based Argumentation, Domain Knowledge, Explainable AI, Precedential Constraint, General Computer Science, SDG 16 - Peace, Justice and Strong Institutions

Citation

Peters, J, Bex, F & Prakken, H 2024, Arguments based on domain rules in prediction justifications. in CEUR Workshop Proceedings. vol. 3769, CEUR Workshop Proceedings, vol. 3769, CEUR WS, pp. 90-99.