Scalable explore-exploit Collaborative Filtering - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Scalable explore-exploit Collaborative Filtering

(1) , (1, 2) , (1, 2)
1
2

Abstract

Recommender Systems (RS) aim at suggesting to users one or several items in which they might have interest. These systems have to update themselves as users provide new ratings, but also as new users/items enter the system. While this adaptation makes recommendation an intrinsically sequential task, most researches about RS based on Collaborative Filtering are omitting this fact, as well as the ensuing exploration/exploitation dilemma: should the system recommend items which bring more information about the users (explore), or should it try to get an immediate feedback as high as possible (exploit)? Recently, a few approaches were proposed to solve that dilemma, but they do not meet requirements to scale up to real life applications which is a crucial point as the number of items available on RS and the number of users in these systems explode. In this paper, we present an explore-exploit Collaborative Filtering RS which is both efficient and scales well. Extensive experiments on some of the largest available real-world datasets show that the proposed approach performs accurate personalized recommendations in less than a millisecond per recommendation, which makes it a good candidate for true applications.
Not file

Dates and versions

hal-01406418 , version 1 (01-12-2016)

Identifiers

  • HAL Id : hal-01406418 , version 1

Cite

Frédéric Guillou, Romaric Gaudel, Philippe Preux. Scalable explore-exploit Collaborative Filtering. Pacific Asia Conference on Information Systems (PACIS'16), 2016, Chiayi, Taiwan. ⟨hal-01406418⟩
237 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More