Collaborative Filtering with Graph-based Implicit Feedback

نویسندگان

  • Minzhe Niu
  • Weinan Zhang
  • Yanru Qu
  • Xuezhi Cao
  • Ruiming Tang
  • Xiuqiang He
  • Yong Yu
چکیده

Introducing consumed items as users’ implicit feedback in matrix factorization (MF) method, SVD++ is one of the most effective collaborative filtering methods for personalized recommender systems. Though powerful, SVD++ has two limitations: (i). only user-side implicit feedback is utilized, whereas item-side implicit feedback, which can also enrich item representations, is not leveraged; (ii). in SVD++, the interacted items are equally weighted when combining the implicit feedback, which can not reflect user’s true preferences accurately. To tackle the above limitations, in this paper we propose Graph-based collaborative filtering (GCF) model, Weighted Graph-based collaborative filtering (W-GCF) model and Attentive Graph-based collaborative filtering (A-GCF) model, which (i). generalize the implicit feedback to item side based on the user-item bipartite graph; (ii). flexibly learn the weights of individuals in the implicit feedback hence improve the model’s capacity. Comprehensive experiments show that our proposed models outperform state-ofthe-art models. For sparse implicit feedback scenarios, additional improvement is further achieved by leveraging the step-two implicit feedback information.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Time-Based Recommender System Using Implicit Feedback

Recommender systems provide personalized recommendations on products or services to customers. Collaborative filtering is a widely used method of providing recommendations based on explicit ratings on items from other users. However, in some ecommerce environments such as a mobile environment, it is difficult to collect explicit feedback data; only implicit feedback is available. In this paper,...

متن کامل

A Similarity Measure for Collaborative Filtering with Implicit Feedback

Collaborative Filtering(CF) is a widely accepted method of creating recommender systems. CF is based on the similarities among users or items. Measures of similarity including the Pearson Correlation Coefficient and the Cosine Similarity work quite well for explicit ratings, but do not capture real similarity from the ratings derived from implicit feedback. This paper identifies some problems t...

متن کامل

Metadata-Based Collaborative Filtering Using K-Partite Graph for Movie Recommendation

Collaborative filtering recommends items to a user based on the interests of other users having similar preferences. However, high dimensional, sparse data result in poor performance in collaborative filtering. This paper introduces an approach called multiple metadata-based collaborative filtering (MMCF), which utilizes meta-level information to alleviate this problem, e.g., metadata such as g...

متن کامل

Learning Item Trees for Probabilistic Modelling of Implicit Feedback

User preferences for items can be inferred from either explicit feedback, such as item ratings, or implicit feedback, such as rental histories. Research in collaborative filtering has concentrated on explicit feedback, resulting in the development of accurate and scalable models. However, since explicit feedback is often difficult to collect it is important to develop effective models that take...

متن کامل

Logistic Matrix Factorization for Implicit Feedback Data

Collaborative filtering with implicit feedback data involves recommender system techniques for analyzing relationships betweens users and items using implicit signals such as click through data or music streaming play counts to provide users with personalized recommendations. This is in contrast to collaborative filtering with explicit feedback data which aims to model these relationships using...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018