TY - GEN
T1 - Prince
T2 - 13th ACM International Conference on Web Search and Data Mining, WSDM 2020
AU - Ghazimatin, Azin
AU - Balalau, Oana
AU - Roy, Rishiraj Saha
AU - Weikum, Gerhard
N1 - Publisher Copyright:
© 2020 Association for Computing Machinery.
PY - 2020/1/20
Y1 - 2020/1/20
N2 - Interpretable explanations for recommender systems and other machine learning models are crucial to gain user trust. Prior works that have focused on paths connecting users and items in a heterogeneous network have several limitations, such as discovering relationships rather than true explanations, or disregarding other users’ privacy. In this work, we take a fresh perspective, and present Prince: a provider-side mechanism to produce tangible explanations for end-users, where an explanation is defined to be a set of minimal actions performed by the user that, if removed, changes the recommendation to a different item. Given a recommendation, Prince uses a polynomial-time optimal algorithm for finding this minimal set of a user’s actions from an exponential search space, based on random walks over dynamic graphs. Experiments on two real-world datasets show that Prince provides more compact explanations than intuitive baselines, and insights from a crowdsourced user-study demonstrate the viability of such action-based explanations. We thus posit that Prince produces scrutable, actionable, and concise explanations, owing to its use of counterfactual evidence, a user’s own actions, and minimal sets, respectively.
AB - Interpretable explanations for recommender systems and other machine learning models are crucial to gain user trust. Prior works that have focused on paths connecting users and items in a heterogeneous network have several limitations, such as discovering relationships rather than true explanations, or disregarding other users’ privacy. In this work, we take a fresh perspective, and present Prince: a provider-side mechanism to produce tangible explanations for end-users, where an explanation is defined to be a set of minimal actions performed by the user that, if removed, changes the recommendation to a different item. Given a recommendation, Prince uses a polynomial-time optimal algorithm for finding this minimal set of a user’s actions from an exponential search space, based on random walks over dynamic graphs. Experiments on two real-world datasets show that Prince provides more compact explanations than intuitive baselines, and insights from a crowdsourced user-study demonstrate the viability of such action-based explanations. We thus posit that Prince produces scrutable, actionable, and concise explanations, owing to its use of counterfactual evidence, a user’s own actions, and minimal sets, respectively.
U2 - 10.1145/3336191.3371824
DO - 10.1145/3336191.3371824
M3 - Conference contribution
AN - SCOPUS:85079513965
T3 - WSDM 2020 - Proceedings of the 13th International Conference on Web Search and Data Mining
SP - 196
EP - 204
BT - WSDM 2020 - Proceedings of the 13th International Conference on Web Search and Data Mining
PB - Association for Computing Machinery, Inc
Y2 - 3 February 2020 through 7 February 2020
ER -