GBPR: group preference based Bayesian personalized ranking for one-class collaborative filtering
HKBU Institutional Repository (Hong Kong Baptist University)Published 3 August 2013
Weike Pan, Li Chen
Citations197
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
One-class collaborative filtering or collaborative ranking with implicit feedback has been steadily receiving more attention, mostly due to the one-class characteristics of data in various services, e.g., like in Facebook and bought in Amazon. Previous works for solving this problem include pointwise regression methods based on absolute rating assumptions and pairwise ranking methods with relative score assumptions, where the latter was empirically found performing much better because it models users' ranking-related preferences more directly. However, the two fundamental assumptions made in the pairwise ranking methods, (1) individual pairwise preference over two items and (2) independence between two users, may not always hold. As a response, we propose a new and improved assumption, group Bayesian personalized ranking (GBPR), via introducing richer interactions among users. In particular, we introduce group preference, to relax the aforementioned individual and independence assumptions. We then design a novel algorithm correspondingly, which can recommend items more accurately as shown by various ranking-oriented evaluation metrics on four real-world datasets in our experiments.
Keywords
Computer Science
arXiv (Cornell University)BPR: Bayesian Personalized Ranking from Implicit Feedback
4,371 Citations2012Steffen Rendle, Christoph Freudenthaler +2 more
Factorization meets the neighborhood
3,876 Citations2008Yehuda Koren
The factor and neighborhood models can now be smoothly merged, thereby building a more accurate combined model and a new evaluation metric is suggested, which highlights the differences among methods, based on their performance at a top-K recommendation task.
Collaborative Filtering for Implicit Feedback Datasets
3,167 Citations2008Yifan Hu, Yehuda Koren +1 more
This work identifies unique properties of implicit feedback datasets and proposes treating the data as indication of positive and negative preference associated with vastly varying confidence levels, which leads to a factor model which is especially tailored for implicit feedback recommenders.
Factorizing personalized Markov chains for next-basket recommendation
2,684 Citations2010Steffen Rendle, Christoph Freudenthaler +1 more
This paper introduces an adaption of the Bayesian Personalized Ranking (BPR) framework for sequential basket data and shows that the FPMC model outperforms both the common matrix factorization and the unpersonalized MC model both learned with and without factorization.
ACM Transactions on Intelligent Systems and TechnologyFactorization Machines with libFM
1,380 Citations2012Steffen Rendle
One-Class Collaborative Filtering
1,012 Citations2008Rong Pan, Y. Zhou +5 more
This paper considers the one-class problem under the CF setting, and proposes two frameworks to tackle OCCF, one based on weighted low rank approximation; the other based on negative example sampling.
Pairwise interaction tensor factorization for personalized tag recommendation
681 Citations2010Steffen Rendle, Lars Schmidt-Thieme
The factorization model PITF (Pairwise Interaction Tensor Factorization) is presented which is a special case of the TD model with linear runtime both for learning and prediction and shows that this model outperforms TD largely in runtime and even can achieve better prediction quality.
Proceedings of the VLDB EndowmentGroup recommendation
396 Citations2009Sihem Amer-Yahia, Senjuti Basu Roy +3 more
This paper analyzes the desiderata of group recommendation and proposes a formal semantics that accounts for both item relevance to a group and disagreements among group members and designs and implements algorithms for efficiently computing group recommendations.
ANU Open Research (Australian National University)COFI RANK - Maximum margin matrix factorization for collaborative ranking
360 Citations2007Markus Weimer, Alexandros Karatzoglou +2 more
A method which uses Maximum Margin Matrix Factorization and optimizes ranking instead of rating is presented and gives very good ranking scores and scales well on collaborative filtering tasks.
Less is more
319 Citations2006Harr Chen, David R. Karger
Lancaster EPrints (Lancaster University)Implicit Rating and Filtering
199 Citations1998David M. Nichols
The costs and benefits of using implicit ratings for information filtering applications where user actions are recorded and a rating is inferred from the recorded data are discussed.
Multi-relational matrix factorization using bayesian personalized ranking for social network data
193 Citations2012Artus Krohn-Grimberghe, Lucas Drumond +2 more
This work proposes a formalization of the cold-start problem and a principled approach to it based on multi-relational factorization techniques, and derives a principled feature extraction scheme from the social data to extract predictors for a classifier on the target relation.
Collaborative competitive filtering
145 Citations2011Shuang-Hong Yang, Bo Long +3 more
This paper proposes Collaborative Competitive Filtering, a framework for learning user preferences by modeling the choice process in recommender systems by encoding a local competition effect, and presents two formulations and an efficient large scale optimization algorithm.
Proceedings of the AAAI Conference on Artificial IntelligenceTransfer Learning in Collaborative Filtering with Uncertain Ratings
99 Citations2021Weike Pan, Evan Wei Xiang +1 more
An efficient transfer learning solution for collaborative filtering, known as em transfer by integrative factorization (TIF), to leverage such auxiliary uncertain ratings to improve the performance of recommendation and shows that incorporating the auxiliary data of uncertain ratings can really bring a benefit.
ACM Transactions on Intelligent Systems and TechnologySocial temporal collaborative ranking for context aware movie recommendation
82 Citations2013Nathan N. Liu, Luheng He +1 more
This work proposes a novel ranking based matrix factorization model to aggregate explicit and implicit user feedback and introduces a network regularization function to constrain user parameters based on social connections.
Proceedings of the VLDB EndowmentSupercharging recommender systems using taxonomies for learning user purchase behavior
73 Citations2012Bhargav Kanagal, Amr Ahmed +4 more
This paper develops efficient algorithms to train the TF models, which scales to large number of users/items and develops scalable inference/recommendation algorithms by exploiting the structure of the taxonomy, and extends the TF model to account for the temporal dynamics of user interests using high-order Markov chains.
CoFiSet: Collaborative Filtering via Learning Pairwise Preferences over Item-sets
54 Citations2013Weike Pan, Li Chen
A new and relaxed assumption of pairwise preferences over item-sets is proposed, which defines a user’s preference on a set of items (item-set) instead of on a single item, and a general algorithm called CoFiSet is developed, which performs better than several state of theart methods on various ranking-oriented evaluation metrics on two real-world data sets.
Lecture notes in computer scienceUser Graph Regularized Pairwise Matrix Factorization for Item Recommendation
45 Citations2011Liang Du, Xuan Li +1 more
This paper proposes a novel method, called User Graph regularized Pairwise Matrix Factorization (UGPMF), to seamlessly integrate user information into pairwise matrix factorization procedure, and is able to find more compact, low dimensional representations for users and items.
A Family of Non-negative Matrix Factorizations for One-Class Collaborative Filtering Problems
34 Citations2009Vikas Sindhwani, Serhat S. Bucak +2 more
Experimental results show that the proposed algorithm alternates NMF optimization with deterministicannealing/continuation techniques designed for global minimization of combinatorial and non-convex objective functions.
Users' eye gaze pattern in organization-based recommender interfaces
28 Citations2011Li Chen, Pearl Pu
This paper reports the hotspot and gaze path of users' eye-movements on three different layouts for recommender interfaces, and suggests a set of design guidelines and practical implications to future work.