GroupLens: an open architecture for collaborative filtering of netnews
CSCW '94 Proceedings of the 1994 ACM conference on Computer supported cooperative work
Communications of the ACM
Latent semantic indexing: a probabilistic analysis
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Analysis of recommendation algorithms for e-commerce
Proceedings of the 2nd ACM conference on Electronic commerce
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Competitive recommendation systems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Eigentaste: A Constant Time Collaborative Filtering Algorithm
Information Retrieval
Convergent algorithms for collaborative filtering
Proceedings of the 4th ACM conference on Electronic commerce
Recommendation Systems: A Probabilistic Analysis
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Improved recommendation systems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Collaborate with strangers to find own preferences
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Tell me who I am: an interactive recommendation system
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Lessons from the Netflix prize challenge
ACM SIGKDD Explorations Newsletter - Special issue on visual analytics
Finding similar users in social networks: extended abstract
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Asynchronous active recommendation systems
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Collaborative scoring with dishonest participants
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Improved collaborative filtering
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 0.00 |
We consider the interactive model of recommender systems, in which users are asked about just a few of their preferences, and in return the system outputs an approximation of all their preferences. The measure of performance is the probe complexity of the algorithm, defined to be the maximal number of answers any user should provide (probe complexity typically depends inversely on the number of users with similar preferences and on the quality of the desired approximation). Previous interactive recommendation algorithms assume that user preferences are binary, meaning that each object is either "liked" or "disliked" by each user. In this paper we consider the general case in which users may have a more refined scale of preference, namely more than two possible grades. We show how to reduce the non-binary case to the binary one, proving the following results. For discrete grades with s possible values, we give a simple deterministic reduction that preserves the approximation properties of the binary algorithm at the cost of increasing probe complexity by factor s. Our main result is for the general case, where we assume that user grades are arbitrary real numbers. For this case we present an algorithm that preserves the approximation properties of the binary algorithm while incurring only polylogarithmic overhead.