Fair Matrix Factorisation for Large-Scale Recommender Systems
Recommender systems are hedged with various requirements, such as ranking quality, optimisation efficiency, and item fairness. Item fairness is an emerging yet impending issue in practical systems. The notion of item fairness requires controlling the opportunity of items (e.g. the exposure) by considering the entire set of rankings recommended for users. However, the intrinsic nature of fairness destroys the separability of optimisation subproblems for users and items, which is an essential property of conventional scalable algorithms, such as implicit alternating least squares (iALS). Few fairness-aware methods are thus available for large-scale item recommendation. Because of the paucity of simple tools for practitioners, unfairness issues would be costly to solve or, at worst, would be abandoned. This study takes a step towards solving real-world unfairness issues by developing a simple and scalable collaborative filtering method for fairness-aware item recommendation. We built a method named fiADMM, which inherits the scalability of iALS and maintains a provable convergence guarantee.
Code (0)
등록된 구현이 없습니다.
Tasks
Collaborative FilteringFairnessRecommendation SystemsSimilar Papers 제목 키워드 기반
Magnitude Bounded Matrix Factorisation for Recommender Systems
Low rank matrix factorisation is often used in recommender systems as a way of extracting latent features. When dealing with large and sparse datasets, traditional recommendation algorithms face the problem of acquiring …
Recommendation SystemsBayesian Boolean Matrix Factorisation
Boolean matrix factorisation aims to decompose a binary data matrix into an approximate Boolean product of two low rank, binary matrices: one containing meaningful patterns, the other quantifying how the observations can…
Collaborative FilteringEvaluating Impact of User-Cluster Targeted Attacks in Matrix Factorisation Recommenders
In practice, users of a Recommender System (RS) fall into a few clusters based on their preferences. In this work, we conduct a systematic study on user-cluster targeted data poisoning attacks on Matrix Factorisation (MF…
Data PoisoningRecommendation SystemsRelative Pairwise Relationship Constrained Non-negative Matrix Factorisation
Non-negative Matrix Factorisation (NMF) has been extensively used in machine learning and data analytics applications. Most existing variations of NMF only consider how each row/column vector of factorised matrices shoul…
ClusteringImage ClusteringRecommendation SystemsTripletAttack Detection Using Item Vector Shift in Matrix Factorisation Recommenders
This paper proposes a novel method for detecting shilling attacks in Matrix Factorization (MF)-based Recommender Systems (RS), in which attackers use false user-item feedback to promote a specific item. Unlike existing m…
Recommendation Systems