Debiased Explainable Pairwise Ranking from Implicit Feedback

被引:12
作者
Damak, Khalil [1 ]
Khenissi, Sami [1 ]
Nasraoui, Olfa [1 ]
机构
[1] Univ Louisville, Knowledge Discovery & Web Min Lab, Dept Comp Sci & Engn, Louisville, KY 40292 USA
来源
15TH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS 2021) | 2021年
基金
美国国家科学基金会;
关键词
Fairness in AI; Debiased Machine Learning; Pairwise Ranking; Explainability; Exposure Bias;
D O I
10.1145/3460231.3474274
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recent work in recommender systems has emphasized the importance of fairness, with a particular interest in bias and transparency, in addition to predictive accuracy. In this paper, we focus on the state of the art pairwise ranking model, Bayesian Personalized Ranking (BPR), which has previously been found to outperform pointwise models in predictive accuracy, while also being able to handle implicit feedback. Specifically, we address two limitations of BPR: (1) BPR is a black box model that does not explain its outputs, thus limiting the user's trust in the recommendations, and the analyst's ability to scrutinize a model's outputs; and (2) BPR is vulnerable to exposure bias due to the data being Missing Not At Random (MNAR). This exposure bias usually translates into an unfairness against the least popular items because they risk being under-exposed by the recommender system. In this work, we first propose a novel explainable loss function and a corresponding Matrix Factorization-based model called Explainable Bayesian Personalized Ranking (EBPR) that generates recommendations along with item-based explanations. Then, we theoretically quantify additional exposure bias resulting from the explainability, and use it as a basis to propose an unbiased estimator for the ideal EBPR loss. The result is a ranking model that aptly captures both debiased and explainable user preferences. Finally, we perform an empirical study on three real-world datasets that demonstrate the advantages of our proposed models.
引用
收藏
页码:321 / 331
页数:11
相关论文
共 53 条
[11]   Reinforcement learning-based QoS/QoE-aware service function chaining in software-driven 5G slices [J].
Chen, Xi ;
Li, Zonghang ;
Zhang, Yupeng ;
Long, Ruiming ;
Yu, Hongfang ;
Du, Xiaojiang ;
Guizani, Mohsen .
TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2018, 29 (11)
[12]   Incorporating Interpretability into Latent Factor Models via Fast Influence Analysis [J].
Cheng, Weiyu ;
Shen, Yanyan ;
Huang, Linpeng ;
Zhu, Yanmin .
KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, :885-893
[13]   Personalised novel and explainable matrix factorisation [J].
Coba, Ludovik ;
Symeonidis, Panagiotis ;
Zanker, Markus .
DATA & KNOWLEDGE ENGINEERING, 2019, 122 :142-158
[14]   Sequence-Based Explainable Hybrid Song Recommendation [J].
Damak, Khalil ;
Nasraoui, Olfa ;
Sanders, William Scott .
FRONTIERS IN BIG DATA, 2021, 4
[15]   Dynamic Matrix Factorization with Priors on Unknown Values [J].
Devooght, Robin ;
Kourtellis, Nicolas ;
Mantrach, Amin .
KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2015, :189-198
[16]  
Gionis A, 1999, PROCEEDINGS OF THE TWENTY-FIFTH INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, P518
[17]   The MovieLens Datasets: History and Context [J].
Harper, F. Maxwell ;
Konstan, Joseph A. .
ACM TRANSACTIONS ON INTERACTIVE INTELLIGENT SYSTEMS, 2016, 5 (04)
[18]  
Haynes W., 2013, ENCY SYSTEMBIOL, DOI 10.1007/978-1-4419-9863-7_1212
[19]  
He RN, 2016, AAAI CONF ARTIF INTE, P144
[20]   Neural Collaborative Filtering [J].
He, Xiangnan ;
Liao, Lizi ;
Zhang, Hanwang ;
Nie, Liqiang ;
Hu, Xia ;
Chua, Tat-Seng .
PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'17), 2017, :173-182