Open AccessPosted Content
Causal Collaborative Filtering.
TL;DR: In this article, a general framework for modeling causality in collaborative filtering and recommendation is proposed, which is based on a unified causal view of CF and mathematically shows that many traditional CF algorithms are actually special cases of CCF under simplified causal graphs.
read more
Abstract: Recommender systems are important and valuable tools for many personalized services Collaborative Filtering (CF) algorithms -- among others -- are fundamental algorithms driving the underlying mechanism of personalized recommendation Many of the traditional CF algorithms are designed based on the fundamental idea of mining or learning correlative patterns from data for matching, including memory-based methods such as user/item-based CF as well as learning-based methods such as matrix factorization and deep learning models However, advancing from correlative learning to causal learning is an important problem, because causal/counterfactual modeling can help us to think outside of the observational data for user modeling and personalization In this paper, we propose Causal Collaborative Filtering (CCF) -- a general framework for modeling causality in collaborative filtering and recommendation We first provide a unified causal view of CF and mathematically show that many of the traditional CF algorithms are actually special cases of CCF under simplified causal graphs We then propose a conditional intervention approach for $do$-calculus so that we can estimate the causal relations based on observational data Finally, we further propose a general counterfactual constrained learning framework for estimating the user-item preferences Experiments are conducted on two types of real-world datasets -- traditional and randomized trial data -- and results show that our framework can improve the recommendation performance of many CF algorithms
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Mitigating Confounding Bias in Recommendation via Information Bottleneck
Dugang Liu,Pengxiang Cheng,Hong Zhu,Zhenhua Dong,Xiuqiang He,Weike Pan,Zhong Ming +6 more
- 13 Sep 2021
TL;DR: In this paper, a debiased information bottleneck (DIB) is proposed to learn a biased embedding vector with independent biased and unbiased components in the training phase, and uses only the unbiased component in the test phase to deliver more accurate recommendations.
93
Toward Pareto Efficient Fairness-Utility Trade-off in Recommendation through Reinforcement Learning
Yingqiang Ge,Xiaoting Zhao,Saurabh Paul,Diane Hu,Chu-Cheng Hsieh,Yongfeng Zhang +5 more
- 01 Jan 2022
TL;DR: This work proposes a fairness-aware recommendation framework using multi-objective reinforcement learning (MORL), called MoFIR (pronounced "more fair ''), which is able to learn a single parametric representation for optimal recommendation policies over the space of all possible preferences, and modify traditional Deep Deterministic Policy Gradient by introducing conditioned network (CN) into it.
Improving Personalized Explanation Generation through Visualization
Shijie Geng,Zuohui Fu,Yingqiang Ge,Lei Li,Gerard de Melo,Yongfeng Zhang +5 more
- 01 Jan 2022
TL;DR: A visually-enhanced approach named METER is proposed with the help of visualization generation and text–image matching discrimination: the explainable recommendation model is encouraged to visualize what it refers to while incurring a penalty if the visualization is incongruent with the textual explanation.
Fairness in Recommendation: Foundations, Methods and Applications
TL;DR: A systematic survey of existing works on fairness in recommendation with a focus on the taxonomies of current fairness definitions, the typical techniques for improving fairness, as well as the datasets for fairness studies in recommendation.
Recommender Systems Based on Graph Embedding Techniques: A Review
TL;DR: In this article , the authors systematically retrospected graph embedding-based recommendation from embedding techniques for bipartite graphs, general graphs and knowledge graphs, and proposed a general design pipeline of that.
References
Matrix Factorization Techniques for Recommender Systems
TL;DR: As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest neighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels.
Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions
TL;DR: This paper presents an overview of the field of recommender systems and describes the current generation of recommendation methods that are usually classified into the following three main categories: content-based, collaborative, and hybrid recommendation approaches.
Item-based collaborative filtering recommendation algorithms
Badrul Sarwar,George Karypis,Joseph A. Konstan,John Riedl +3 more
- 01 Apr 2001
TL;DR: This paper analyzes item-based collaborative ltering techniques and suggests that item- based algorithms provide dramatically better performance than user-based algorithms, while at the same time providing better quality than the best available userbased algorithms.
Neural Collaborative Filtering
Xiangnan He,Lizi Liao,Hanwang Zhang,Liqiang Nie,Xia Hu,Tat-Seng Chua +5 more
- 03 Apr 2017
TL;DR: This work strives to develop techniques based on neural networks to tackle the key problem in recommendation --- collaborative filtering --- on the basis of implicit feedback, and presents a general framework named NCF, short for Neural network-based Collaborative Filtering.
GroupLens: an open architecture for collaborative filtering of netnews
Paul Resnick,Neophytos Iacovou,Mitesh Suchak,Peter Bergstrom,John Riedl +4 more
- 22 Oct 1994
TL;DR: GroupLens is a system for collaborative filtering of netnews, to help people find articles they will like in the huge stream of available articles, and protect their privacy by entering ratings under pseudonyms, without reducing the effectiveness of the score prediction.
6K