Affiliation:
1. Guangdong University of Technology and Guangdong Provincial Key Laboratory of Public Finance and Taxation with Big Data Application, China
2. Guangdong University of Technology, China
3. Cornell University, USA
4. Tencent Technology (SZ) Co., Ltd, China
Abstract
The recommendation system, relying on historical observational data to model the complex relationships among users and items, has achieved great success in real-world applications. Selection bias is one of the most important issues of the existing observational data-based approaches, which is actually caused by multiple types of unobserved exposure strategies (e.g., promotions and holiday effects). Though various methods have been proposed to address this problem, they are mainly relying on the implicit debiasing techniques but not explicitly modeling the unobserved exposure strategies. By explicitly Reconstructing Exposure STrategies (REST), we formalize the recommendation problem as the counterfactual reasoning and propose the debiased social recommendation method. In REST, we assume that the exposure of an item is controlled by the latent exposure strategies, the user, and the item. Based on the above generation process, we first provide the theoretical guarantee of our method via identification analysis. Second, we employ a variational auto-encoder to reconstruct the latent exposure strategies, with the help of the social networks and the items. Third, we devise a counterfactual reasoning based recommendation algorithm by leveraging the recovered exposure strategies. Experiments on four real-world datasets, including three published datasets and one private WeChat Official Account dataset, demonstrate significant improvements over several state-of-the-art methods.
Funder
National Key R&D Program of China
National Science Fund for Excellent Young Scholars
Natural Science Foundation of China
Open Foundation of Guangdong Provincial Key Laboratory of Public Finance and Taxation with Big Data Application
Publisher
Association for Computing Machinery (ACM)
Reference57 articles.
1. Qingyao Ai, Keping Bi, Cheng Luo, Jiafeng Guo, and W. Bruce Croft. 2018. Unbiased learning to rank with unbiased propensity estimation. In Proceedings of the 41st International ACM SIGIR Conference on Research and Development in Information Retrieval. 385–394.
2. Ricardo Baeza-Yates, Carlos Hurtado, and Marcelo Mendoza. 2004. Query recommendation using query logs in search engines. In Proceedings of the International Conference on Extending Database Technology. Springer, 588–596.
3. Stephen Bonner and Flavian Vasile. 2018. Causal embeddings for recommendation. In Proceedings of the 12th ACM Conference on Recommender Systems. 104–112.
4. Knowledge-based recommendation systems: A survey;Bouraga Sarah;Int. J. Intell. Info. Technol.,2014
5. Rocío Cañamares and Pablo Castells. 2018. Should I follow the crowd? A probabilistic analysis of the effectiveness of popularity in recommender systems. In Proceedings of the 41st International ACM SIGIR Conference on Research & Development in Information Retrieval (SIGIR’18). ACM, New York, NY, 415–424. 10.1145/3209978.3210014
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献