Collaborative filtering allows the preferences of multiple users to be pooled in a principled way in order to make recommendations about products, services or information unseen by a specific user. We consider here the problem of online and interactive collaborative filtering: given the current ratings and recommendations associated with a user, what queries (new ratings) would most improve the quality of the recommendations made? This can be cast in a straightforward fashion in terms of expected value of information; but the online computational cost of computing optimal queries is prohibitive. We show how offline precomputation of bounds on value of information, and of prototypes in query space, can be used to dramatically reduce the required online computation. The framework we develop is quite general, but we derive detailed bounds for the multiplecause vector quantization model, and empirically demonstrate the value of our active approach us-
[1]
Eric Horvitz,et al.
Collaborative Filtering by Personality Diagnosis: A Hybrid Memory and Model-Based Approach
,
2000,
UAI.
[2]
David Heckerman,et al.
Empirical Analysis of Predictive Algorithms for Collaborative Filtering
,
1998,
UAI.
[3]
Kenneth Y. Goldberg,et al.
Eigentaste: A Constant Time Collaborative Filtering Algorithm
,
2001,
Information Retrieval.
[4]
David A. Cohn,et al.
Active Learning with Statistical Models
,
1996,
NIPS.
[5]
Peter Haddawy,et al.
The Decision-Theoretic Video Advisor*
,
1998
.
[6]
Richard S. Zemel,et al.
Multiple Cause Vector Quantization
,
2002,
NIPS.
[7]
Bradley N. Miller,et al.
GroupLens: applying collaborative filtering to Usenet news
,
1997,
CACM.