Skip to main content
SpringerLink
Log in

Finding Similar Users in Social Networks

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

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. Technically, each user has a vector of preferences (answers to queries), 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 by asking each user to answer the least possible number of queries. We prove nearly matching lower and upper bounds on the maximal number of queries required to solve the problem. Specifically, we present an “anytime” algorithm that asks each user at most one query in each round, while maintaining a partition of the users. The quality of the partition improves over time: for n users and time T, groups of \(\tilde{O}(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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alon, N., Awerbuch, B., Azar, Y., Patt-Shamir, B.: Tell me who I am: an interactive recommendation system. In: Proc. 18th Ann. ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pp. 1–10 (2006)

    Google Scholar 

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

    Chapter  Google Scholar 

  3. Awerbuch, B., Patt-Shamir, B., Peleg, D., Tuttle, M.: Improved recommendation systems. In: Proc. 16th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1174–1183 (2005)

    Google Scholar 

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

    Google Scholar 

  5. Drineas, P., Kerenidis, I., Raghavan, P.: Competitive recommendation systems. In: Proc. 34th ACM Symp. on Theory of Computing (STOC), pp. 82–90 (2002)

    Google Scholar 

  6. Facebook: www.facebook.com (2004)

  7. Freeman, L.C.: The Development of Social Network Analysis: A Study in the Sociology of Science (2004). Empirical Press

    Google Scholar 

  8. Goldberg, K., Roeder, T., Gupta, D., Eigentaste, Perkins C.: A constant time collaborative filtering algorithm. Inform. Retr. J. 4(2), 133–151 (2001)

    Article  MATH  Google Scholar 

  9. Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13–30 (1963)

    Article  MathSciNet  MATH  Google Scholar 

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

    Chapter  Google Scholar 

  11. Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Recommendation systems: a probabilistic analysis. In: Proc. 39th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 664–673. (1998). URL: citeseer.nj.nec.com/kumar98recommendation.html

    Google Scholar 

  12. MySpace: www.myspace.com (2003)

  13. Papadimitriou, C.H., Raghavan, P., Tamaki, H., Vempala, S.: Latent semantic indexing: a probabilistic analysis. In: Proc. 17th ACM Symp. on Principles of Database Systems (PODS), pp. 159–168. ACM Press, New York (1998)

    Google Scholar 

  14. Rashid, A.M., Albert, I., Cosley, D., Lam, S.K., McNee, S.M., Konstan, J.A., Riedl, J.: Getting to know you: learning new user preferences in recommender systems. In: IUI ’02: Proceedings of the 7th International Conference on Intelligent User Interfaces, pp. 127–134. ACM Press, New York (2002). doi:10.1145/502716.502737

    Chapter  Google Scholar 

  15. Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Analysis of recommendation algorithms for e-commerce. In: Proc. 2nd ACM Conf. on Electronic Commerce (EC), pp. 158–167. ACM Press, New York (2000). doi:10.1145/352871.352887

    Chapter  Google Scholar 

  16. Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press, Cambridge (1994)

    Google Scholar 

  17. Yao, A.C.: Probabilistic computations: toward a unified measure of complexity. In: Proc. 17th IEEE Symp. on Foundations of Computer Science (FOCS), pp. 222–227 (1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical Engineering, Tel Aviv University, Tel Aviv, 69978, Israel

    Aviv Nisgav & Boaz Patt-Shamir

Authors
  1. Aviv Nisgav
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Boaz Patt-Shamir
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Boaz Patt-Shamir.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nisgav, A., Patt-Shamir, B. Finding Similar Users in Social Networks. Theory Comput Syst 49, 720–737 (2011). https://doi.org/10.1007/s00224-010-9307-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-010-9307-2

Keywords

Search

Navigation