Aviv Nisgav
ABSTRACT
We consider a system where users wish to find similar users. To model similarity, we assume the existence of a set of queries, and two users are deemed similar if their answers to these queries are (mostly) identical: each user has a vector of preferences, and two users are similar if their preference vectors differ in only a few coordinates. The preferences are unknown to the system initially, and the goal of the algorithm is to classify the users into classes of roughly the same preferences with the least possible number of queries presented to any user. We prove nearly matching lower and upper bounds on that problem. ecifically, we present an "anytime" algorithm that maintains a partition of the users, and the quality of the partition improves over time: let n be the number of users. At time T, groups of Õ(n/T) users with the same preferences will be separated (with high probability) if they differ in sufficiently many queries. We present a lower bound that matches the upper bound, up to a constant factor, for nearly all possible distances between user groups.
- N. Alon, B. Awerbuch, Y. Azar, and B. Patt-Shamir. Tell me who I am: an interactive recommendation system. In Proc. 18th Ann. ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 1--10, 2006. Google Scholar
Digital Library
- 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 (SPAA), pages 263--269, 2005. Google ScholarDigital Library
- B. Awerbuch, B. Patt-Shamir, D. Peleg, and M. Tuttle. Improved recommendation systems. In Proc. 16th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 1174--1183, 2005. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- P. Drineas, I. Kerenidis, and P. Raghavan. Competitive recommendation systems. In Proc. 34th ACM Symp. on Theory of Computing (STOC), pages 82--90, 2002. Google ScholarDigital Library
- Facebook Web site. www.facebook.com.Google Scholar
- L. C. Freeman. The Development of Social Network Analysis: A Study in the Sociology of Science. Empirical Press, 2004.Google Scholar
- 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. Google ScholarDigital Library
- W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13--30, Mar. 1963.Google ScholarCross Ref
- J. Kleinberg and M. Sandler. Convergent algorithms for collaborative filtering. In Proc. 4th ACM Conf. on Electronic Commerce (EC), pages 1--10, 2003. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- MySpace Web site. www.myspace.com.Google Scholar
- 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. Google ScholarDigital Library
- A. M. Rashid, I. Albert, D. Cosley, S. K. Lam, S. M. McNee, J. A. Konstan, and J. Riedl. Getting to know you: learning new user preferences in recommender systems. In IUI '02: Proceedings of the 7th international conference on Intelligent user interfaces, pages 127--134, New York, NY, USA, 2002. ACM. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- S. Wasserman and K. Faust. Social Network Analysis: Methods and Applications. Cambridge University Press, 1994.Google ScholarCross Ref
- A. C. Yao. Probabilistic computations: toward a unified measure of complexity. In Proc. 17th IEEE Symp. on Foundations of Computer Science (FOCS), pages 222--227, 1977. Google ScholarDigital Library
Index Terms
- Finding similar users in social networks: extended abstract
Recommendations
Finding Similar Users in Social Networks
Special Issue: Parallelism in Algorithms and ArchitecturesWe consider a system where users wish to find similar users. To model similarity, we assume the existence of a set of queries, and two users are deemed similar if their answers to these queries are (mostly) identical. Technically, each user has a vector ...
Finding approximate nash equilibria of bimatrix games via payoff queries
EC '14: Proceedings of the fifteenth ACM conference on Economics and computationWe study the deterministic and randomized query complexity of finding approximate equilibria in a k x k bimatrix game. We show that the deterministic query complexity of finding an ε-Nash equilibrium when ε < 1/2 is Ω(k2), even in zero-one constant-sum ...
Comparison-based time-space lower bounds for selection
We establish the first nontrivial lower bounds on time-space trade-offs for the selection problem. We prove that any comparison-based randomized algorithm for finding the median requires Ω(nlog logS n) expected time in the RAM model (or more generally ...
Comments