|
ABSTRACT
Customer preferences for products are drifting over time. Product perception and popularity are constantly changing as new selection emerges. Similarly, customer inclinations are evolving, leading them to ever redefine their taste. Thus, modeling temporal dynamics should be a key when designing recommender systems or general customer preference models. However, this raises unique challenges. Within the eco-system intersecting multiple products and customers, many different characteristics are shifting simultaneously, while many of them influence each other and often those shifts are delicate and associated with a few data instances. This distinguishes the problem from concept drift explorations, where mostly a single concept is tracked. Classical time-window or instance-decay approaches cannot work, as they lose too much signal when discarding data instances. A more sensitive approach is required, which can make better distinctions between transient effects and long term patterns. The paradigm we offer is creating a model tracking the time changing behavior throughout the life span of the data. This allows us to exploit the relevant components of all data instances, while discarding only what is modeled as being irrelevant. Accordingly, we revamp two leading collaborative filtering recommendation approaches. Evaluation is made on a large movie rating dataset by Netflix. Results are encouraging and better than those previously reported on this dataset.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
|
| |
3
|
J. Bennett, C. Elkan, B. Liu, P. Smyth and D. Tikk (eds.). KDD Cup and Workshop in conjunction with KDD'07, 2007.
|
| |
4
|
J. Bennet and S. Lanning. The Netflix Prize. KDD Cup and Workshop, 2007. www.netflixprize.com
|
 |
5
|
|
 |
6
|
|
| |
7
|
|
 |
8
|
|
| |
9
|
|
| |
10
|
A. Paterek. Improving regularized singular value decomposition for collaborative filtering. Proc. KDD Cup and Workshop, 2007.
|
| |
11
|
G. Potter. Putting the collaborator back into collaborative filtering. KDD'08 Workshop on Large Scale Recommenders Systems and the Netflix Prize, 2008.
|
| |
12
|
P. Pu, D. G. Bridge, B. Mobasher and F. Ricci (eds.). Proc. 2008 ACM Conference on Recommender Systems, 2008.
|
 |
13
|
|
 |
14
|
Badrul Sarwar , George Karypis , Joseph Konstan , John Reidl, Item-based collaborative filtering recommendation algorithms, Proceedings of the 10th international conference on World Wide Web, p.285-295, May 01-05, 2001, Hong Kong, Hong Kong
[doi> 10.1145/371920.372071]
|
| |
15
|
J. Schlimmer and R. Granger. Beyond incremental processing: Tracking concept drift. Proc. 5th National Conference on Artificial Intelligence, pp. 502--507, 1986.
|
 |
16
|
|
 |
17
|
|
 |
18
|
|
 |
19
|
|
| |
20
|
C. Thompson. If you liked this, you're sure to love that. The New York Times, Nov 21, 2008.
|
| |
21
|
A. Toscher, M. Jahrer and R. Legenstein. Improved neighborhood-based algorithms for large-scale recommender systems. KDD'08 Workshop on Large Scale Recommenders Systems and the Netflix Prize, 2008.
|
| |
22
|
A. Tsymbal. The problem of concept drift: Definitions and related work. Technical Report TCD-CS-2004-15, Trinity College Dublin, 2004.
|
| |
23
|
A. Tuzhilin, Y. Koren, J. Bennett, C. Elkan and D. Lemire (eds.). Workshop on large scale recommender systems and the Netflix Prize in conjunction with KDD'08, 2008.
|
 |
24
|
|
| |
25
|
|
|