Learning binary relations and total orders
SIAM Journal on Computing
Learning Binary Relations Using Weighted Majority Voting
Machine Learning
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
Metric Embeddings with Relaxed Guarantees
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Online collaborative filtering with nearly optimal dynamic regret
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Asynchronous recommendation systems
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Reputation, Trust and Recommendation Systems in Peer-to-Peer Systems
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Competitive collaborative learning
Journal of Computer and System Sciences
Finding similar users in social networks: extended abstract
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Challenges in Personalizing and Decentralizing the Web: An Overview of GOSSPLE
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
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
Recommender systems with non-binary grades
Proceedings of the twenty-third 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 a model of recommendation systems, where each member from a given set of players has a binary preference to each element in a given set of objects: intuitively, each player either likes or dislikes each object. However, the players do not know their preferences. To find his preference of an object, a player may probe it, but each probe incurs unit cost. The goal of the players is to learn their complete preference vector (approximately) while incurring minimal cost. This is possible if many players have similar preference vectors: such a set of players with similar "taste" may split the cost of probing all objects among them, and share the results of their probes by posting them on a public billboard. The problem is that players do not know a priori whose taste is close to theirs. In this paper we present a distributed randomized peer-to-peer algorithm in which each player outputs a vector which is close to the best possible approximation of the player's real preference vector after a polylogarithmic number of rounds. The algorithm works under adversarial preferences. Previous algorithms either made severely limiting assumptions on the structure of the preference vectors, or had polynomial overhead.