Please use this identifier to cite or link to this item:
http://drsr.daiict.ac.in//handle/123456789/1191
Title: | Explanations by Counterfactual Argument in Recommendation Systems |
Authors: | Rana, Arpit Pathak, Yash |
Keywords: | Recommendation Systems Artificial Intelligence Machine Learning Counterfactual (CF) arguments |
Issue Date: | 2023 |
Publisher: | Dhirubhai Ambani Institute of Information and Communication Technology |
Citation: | Pathak, Yash (2023). Explanations by Counterfactual Argument in Recommendation Systems. Dhirubhai Ambani Institute of Information and Communication Technology. vii, 43 p. (Acc. # T01132). |
Abstract: | In recent advances in the domains of Artificial Intelligence (AI) and MachineLearning (ML), complex models are used. Due to their complexity and approaches,they have black box type of nature and raise the question of a trustworthy for decisionprocess especially in the high cost decisions scenario. To overcome thisproblem, users of these systems can ask for an explanation about the decisionwhich can be provided by system in various ways. One way of generating theseexplanations is by the help of Counterfactual (CF) arguments. Although there is adebate on how AI can generate these explanations, either by Correlation or CausalInference, in Recommendation Systems (RecSys) the aim is to generate these explanationswith minimum Oracle calls and have near optimal length (eg., in termsof interactions) of provided explanations. In this study we analyze the nature ofCFs and different methods (eg., Model Agnostic approach, Genetic Algorithms(GA)) to generate them along with the quality measures. Extensive experimentsshow that the generation of CFs can be done through multiple approaches andselecting optimal CFs will improve the explanations. |
URI: | http://drsr.daiict.ac.in//handle/123456789/1191 |
Appears in Collections: | M Tech Dissertations |
Files in This Item:
File | Size | Format | |
---|---|---|---|
202111053.pdf | 653.61 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.