4.7 Article

Adaptive Bayesian personalized ranking for heterogeneous implicit feedbacks

Journal

KNOWLEDGE-BASED SYSTEMS
Volume 73, Issue -, Pages 173-180

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.knosys.2014.09.013

Keywords

Preference learning; Collaborative filtering; Heterogeneous implicit feedbacks; Adaptive Bayesian personalized ranking; Transfer learning

Funding

  1. National Natural Science Foundation of China (NSFC) [61272303]
  2. National Basic Research Program of China (973 Program) [2010CB327903]
  3. Natural Science Foundation of SZU [201436]
  4. NSFC [61170077]
  5. NSF GD [10351806001000000]
  6. S&T Project of GDA [20128091100198]
  7. ST Project of SZ [JCYJ20130326110956468]

Ask authors/readers for more resources

Implicit feedbacks have recently received much attention in recommendation communities due to their close relationship with real industry problem settings. However, most works only exploit users' homogeneous implicit feedbacks such as users' transaction records from bought activities, and ignore the other type of implicit feedbacks like examination records from browsed activities. The latter are usually more abundant though they are associated with high uncertainty w.r.t. users' true preferences. In this paper, we study a new recommendation problem called heterogeneous implicit feedbacks (HIF), where the fundamental challenge is the uncertainty of the examination records. As a response, we design a novel preference learning algorithm to learn a confidence for each uncertain examination record with the help of transaction records. Specifically, we generalize Bayesian personalized ranking (BPR), a seminal pairwise learning algorithm for homogeneous implicit feedbacks, and learn the confidence adaptively, which is thus called adaptive Bayesian personalized ranking (ABPR). ABPR has the merits of uncertainty reduction on examination records and accurate pairwise preference learning on implicit feedbacks. Experimental results on two public data sets show that ABPR is able to leverage uncertain examination records effectively, and can achieve better recommendation performance than the state-of-the-art algorithm on various ranking-oriented evaluation metrics. (C) 2014 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available