Article

Tell me who I am: an interactive recommendation system

Authors:

Baruch Awerbuch,

Boaz Patt-ShamirAuthors Info & Claims

SPAA '06: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures

Pages 1 - 10

https://doi.org/10.1145/1148109.1148111

Published: 30 July 2006 Publication History

Abstract

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.

References

[1]

I. Abraham, Y. Bartal, T.-H. Chan, K. Dhamdhere, A. Gupta, J. Kleinberg, O. Neiman, and A. Slivkins. Metric embeddings with relaxed guarantees. In Proc. 46th IEEE Symp. on Foundations of Computer Science, 2005.

Digital Library

[2]

N. Alon and J. H. Spencer. The Probabilistic Method. Wiley, second edition, 2000.

[3]

B. Awerbuch, Y. Azar, Z. Lotker, B. Patt-Shamir, and M. Tuttle. Collaborate with strangers to find own preferences. In Proc. 17th ACM Symp. on Parallelism in Algorithms and Architectures, pages 263--269, 2005.

Digital Library

[4]

B. Awerbuch, B. Patt-Shamir, D. Peleg, and M. Tuttle. Improved recommendation systems. In Proc. 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1174--1183, January 2005.

Digital Library

[5]

Y. Azar, A. Fiat, A. Karlin, F. McSherry, and J. Saia. Spectral analysis of data. In Proc. 33rd ACM Symp. on Theory of Computing (STOC), pages 619--626, 2001.

Digital Library

[6]

P. Drineas, I. Kerenidis, and P. Raghavan. Competitive recommendation systems. In Proc. 34th ACM Symp. on Theory of Computing (STOC), pages 82--90, 2002.

Digital Library

[7]

K. Goldberg, T. Roeder, D. Gupta, and C. Perkins. Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval Journal, 4(2):133--151, July 2001.

Digital Library

[8]

S. A. Goldman, R. L. Rivest, and R. E. Schapire. Learning binary relations and total orders. SIAM J. Computing, 22(5):1006--1034, October 1993.

Digital Library

[9]

S. A. Goldman and M. K. Warmuth. Learning binary relations using weighted majority voting. Machine Learning, 20(3):245--271, 1995.

Digital Library

[10]

J. Hu and M. P. Wellman. Self-fulfilling bias in multiagent learning. In V. Lesser, editor, Proceedings of the First International Conference on Multi--Agent Systems. MIT Press, 1995.

[11]

J. Kleinberg and M. Sandler. Convergent algorithms for collaborative filtering. In Proc. 4th ACM Conf. on Electronic Commerce (EC), pages 1--10, 2003.

Digital Library

[12]

R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Recommendation systems: A probabilistic analysis. In Proc. 39th IEEE Symp. on Foundations of Computer Science (FOCS), pages 664--673, 1998.

Digital Library

[13]

M. L. Littman. Markov games as a framework for multi-agent reinforcement learning. In Proc. 11th Int. Conference on Machine Learning (ML-94). Morgan Kaufmann.

[14]

C. H. Papadimitriou, P. Raghavan, H. Tamaki, and S. Vempala. Latent semantic indexing: A probabilistic analysis. In Proc. 17th ACM Symp. on Principles of Database Systems (PODS), pages 159--168. ACM Press, 1998.

Digital Library

[15]

B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Analysis of recommendation algorithms for e-commerce. In Proc. 2nd ACM Conf. on Electronic Commerce (EC), pages 158--167. ACM Press, 2000.

Digital Library

[16]

G. Wei. Learning to coordinate actions in multi-agent systems. In R. Bajcsy, editor, Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93). MIT Press, 1993.

Cited By

Uitto JWattenhofer R(2016)On competitive recommendationsTheoretical Computer Science10.1016/j.tcs.2015.10.034620:C(4-14)Online publication date: 21-Mar-2016
https://dl.acm.org/doi/10.1016/j.tcs.2015.10.034
Uitto JWattenhofer R(2015)Ignorant vs. Anonymous RecommendationsAlgorithms - ESA 201510.1007/978-3-662-48350-3_83(1001-1012)Online publication date: 12-Nov-2015
https://doi.org/10.1007/978-3-662-48350-3_83
Uitto JWattenhofer R(2013)On Competitive RecommendationsAlgorithmic Learning Theory10.1007/978-3-642-40935-6_7(83-97)Online publication date: 2013
https://doi.org/10.1007/978-3-642-40935-6_7
Show More Cited By

Index Terms

Tell me who I am: an interactive recommendation system

Recommendations

Tell Me Who I Am: An Interactive Recommendation System
Special Issue: Symposium on Parallelism in Algorithms and Architectures 2006; Guest Editors: Robert Kleinberg and Christian Scheideler

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 ...
Collaborate with strangers to find own preferences
SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures

We consider a model with n players and m objects. Each player has a "preference vector" of length m that models his grade for each object. The grades are unknown to the players. A player can learn his grade for an object by probing that object, but ...
Using Implicit Feedback for Neighbors Selection: Alleviating the Sparsity Problem in Collaborative Recommendation Systems
WebMedia '17: Proceedings of the 23rd Brazillian Symposium on Multimedia and the Web

The most popular Recommender systems (RSs) employ Collaborative Filtering (CF) algorithms where users explicitly rate items. Based on these ratings, a user-item rating matrix is generated and used to select the items to be recommended for a target user. ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '06: Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures

July 2006

344 pages

ISBN:1595934529

DOI:10.1145/1148109

General Chair:
Phillip B. Gibbons
Intel Research, USA
,
Program Chair:
Uzi Vishkin
UMIACS, University of Maryland, USA

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 July 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SPAA06

Sponsor:

SPAA06: 18th ACM Symposium on Parallelism in Algorithms and Architectures 2006

July 30 - August 2, 2006

Massachusetts, Cambridge, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
374
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)4

Reflects downloads up to 03 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Uitto JWattenhofer R(2016)On competitive recommendationsTheoretical Computer Science10.1016/j.tcs.2015.10.034620:C(4-14)Online publication date: 21-Mar-2016
https://dl.acm.org/doi/10.1016/j.tcs.2015.10.034
Uitto JWattenhofer R(2015)Ignorant vs. Anonymous RecommendationsAlgorithms - ESA 201510.1007/978-3-662-48350-3_83(1001-1012)Online publication date: 12-Nov-2015
https://doi.org/10.1007/978-3-662-48350-3_83
Uitto JWattenhofer R(2013)On Competitive RecommendationsAlgorithmic Learning Theory10.1007/978-3-642-40935-6_7(83-97)Online publication date: 2013
https://doi.org/10.1007/978-3-642-40935-6_7
Azar YNisgav APatt-Shamir BMeyer auf der Heide FRajaraman R(2011)Recommender systems with non-binary gradesProceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures10.1145/1989493.1989528(245-252)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1989493.1989528
Nisgav APatt-Shamir B(2011)Improved collaborative filteringProceedings of the 22nd international conference on Algorithms and Computation10.1007/978-3-642-25591-5_44(425-434)Online publication date: 5-Dec-2011
https://dl.acm.org/doi/10.1007/978-3-642-25591-5_44
Gilbert SGuerraoui RRad FZadimoghaddam Mauf der Heide FPhillips C(2010)Collaborative scoring with dishonest participantsProceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures10.1145/1810479.1810488(41-49)Online publication date: 13-Jun-2010
https://dl.acm.org/doi/10.1145/1810479.1810488
Nisgav APatt-Shamir BMeyer auf der Heide FBender M(2009)Finding similar users in social networksProceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures10.1145/1583991.1584042(169-177)Online publication date: 11-Aug-2009
https://dl.acm.org/doi/10.1145/1583991.1584042
Kermarrec A(2009)Challenges in Personalizing and Decentralizing the WebProceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems10.1007/978-3-642-05118-0_1(1-16)Online publication date: 5-Nov-2009
https://dl.acm.org/doi/10.1007/978-3-642-05118-0_1
Awerbuch BKleinberg R(2008)Competitive collaborative learningJournal of Computer and System Sciences10.1016/j.jcss.2007.08.00474:8(1271-1288)Online publication date: 1-Dec-2008
https://dl.acm.org/doi/10.1016/j.jcss.2007.08.004
Patt-Shamir B(2008)Reputation, Trust and Recommendation Systems in Peer-to-Peer SystemsProceedings of the 15th international colloquium on Structural Information and Communication Complexity10.1007/978-3-540-69355-0_2(2-4)Online publication date: 17-Jun-2008
https://dl.acm.org/doi/10.1007/978-3-540-69355-0_2
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten