Rina Panigrahy
Marc Najork
ABSTRACT
Previous research has suggested that people who are in the same social circle exhibit similar behaviors and tastes. The rise of social networks gives us insights into the social circles of web users, and recommendation services (including search engines, advertisement engines, and collaborative filtering engines) provide a motivation to adapt recommendations to the interests of the audience. An important primitive for supporting these applications is the ability to quantify how connected two users are in a social network. The shortest-path distance between a pair of users is an obvious candidate measure. This paper introduces a new measure of "affinity" in social networks that takes into account not only the distance between two users, but also the number of edge-disjoint paths between them, i.e. the "robustness" of their connection. Our measure is based on a sketch-based approach, and affinity queries can be answered extremely efficiently (at the expense of a one-time offline sketch computation). We compare this affinity measure against the "approximate shortest-path distance", a sketch-based distance measure with similar efficiency characteristics. Our empirical study is based on a Hotmail email exchange graph combined with demographic information and Bing query history, and a Twitter mention-graph together with the text of the underlying tweets. We found that users who are close to each other - either in terms of distance or affinity - have a higher similarity in terms of demographics, queries, and tweets.
Supplemental Material
- Joshua D. Batson, Daniel A. Spielman, and Nikhil Srivastava. Twice-Ramanujan sparsifiers. In 41st Annual ACM Symposium on Theory of Computing, 2009. Google Scholar
Digital Library
- András A. Benczúr and David R. Karger Approximating s-t minimum cuts in Õ(n2) time. In 28th Annual ACM Symposium on the Theory of Computing, 1996. Google ScholarDigital Library
- Jean Bourgain. On Lipschitz embeddings of finite metric spaces in Hilbert space. Israel Journal of Mathematics, 52(1-2):46--52 (1985).Google ScholarCross Ref
- Andrei Z. Broder. Identifying and filtering near-duplicate documents. In 11th Annual Symposium on Combinatorial Pattern Matching, 2000. Google ScholarDigital Library
- Andrei Z. Broder, Steven C. Glassman, Mark S. Manasse, and Geoffrey Zweig. Syntactic clustering of the web. Computer Networks, 29(8):1157--1166 (1997). Google ScholarDigital Library
- Nicholas A. Christakis and James H. Fowler. The spread of obesity in a large social network over 32 years. New England Journal of Medicine 357(4): 370--379 (July 2007).Google ScholarCross Ref
- Nicholas A. Christakis and James H. Fowler. The collective dynamics of smoking in a large social network. New England Journal of Medicine, 358(21): 2249--2258 (May 2008).Google ScholarCross Ref
- David J. Crandall, Dan Cosley, Daniel P. Huttenlocher, Jon M. Kleinberg, and Siddharth Suri. Feedback effects between similarity and social influence in online communities. In 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008. Google ScholarDigital Library
- Dan Cosley, Daniel P. Huttenlocher, Jon M. Kleinberg, Xiangyang Lan, and Siddharth Suri. Sequential influence models in social networks. In 4th International Conference on Weblogs and Social Media, 2010.Google Scholar
- Pedro Domingos and Matthew Richardson. Mining the network value of customers. In 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2001. Google ScholarDigital Library
- Atish Das Sarma, Sreenivas Gollapudi, Marc Najork, and Rina Panigrahy. A sketch-based distance oracle for Web-scale graphs. In 3rd International Conference on Web Search and Web Data Mining, 2010. Google ScholarDigital Library
- James H. Fowler and Nicholas A. Christakis. The dynamic spread of happiness in a large social network: Longitudinal analysis over 20 years in the Framingham Heart Study. British Medical Journal 2008; 337: a2338.Google Scholar
- Wai Shing Fung, Ramesh Hariharan, Nicholas J. A. Harvey, and Debmalya Panigrahi. A general framework for graph sparsification. In 43rd ACM Symposium on Theory of Computing, 2011. Google ScholarDigital Library
- David Kempe, Jon M. Kleinberg, and Éva Tardos. Maximizing the spread of influence through a social network. In 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003. Google ScholarDigital Library
- Gueorgi Kossinets, Jon M. Kleinberg, and Duncan J. Watts. The structure of information pathways in a social communication network. In 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2001. Google ScholarDigital Library
- Ioannis Koutis, Gary L. Miller, and Richard Peng. Approaching optimality for solving SDD linear systems. In 51st Annual IEEE Symposium on Foundations of Computer Science, 2010. Google ScholarDigital Library
- Jure Leskovec, Ajit Singh, and Jon M. Kleinberg. Patterns of influence in a recommendation network. In 10th Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2006. Google ScholarDigital Library
- Ulrike von Luxburg, Agnes Radl, Matthias Hein. Getting lost in space: Large sample analysis of the commute distance. In 24th Annual Conference on Neural Information Processing Systems, 2010.Google Scholar
- Jiri Matousek. On the distortion required for embedding finite metric spaces into normed spaces. Israel Journal of Mathematics, 93(1):333--344 (1996).Google ScholarCross Ref
- J. Niels Rosenquist, Joanne Murabito, James H. Fowler, and Nicholas A. Christakis. The spread of alcohol consumption behavior in a large social network. Annals of Internal Medicine 152(7): 426--433 (April 2010).Google ScholarCross Ref
- Gerard Salton and Christopher Buckley. Term-weighting approaches in automatic text retrieval. Information Processing & Management 24 (5): 513--523 (1988). Google ScholarDigital Library
- Daniel A. Spielman and Nikhil Srivastava. Graph sparsification by effective resistances. In 40th Annual ACM Symposium on Theory of Computing, 2008. Google ScholarDigital Library
- Daniel A. Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In 36th Annual ACM Symposium on Theory of Computing, 2004. Google ScholarDigital Library
- Mikkel Thorup and Uri Zwick. Approximate distance oracles. Journal of the ACM, 52(1):1--24 (January 2005). Google ScholarDigital Library
Index Terms
- How user behavior is related to social affinity
Recommendations
Social affinity filtering: recommendation through fine-grained analysis of user interactions and activities
COSN '13: Proceedings of the first ACM conference on Online social networksContent recommendation in social networks poses the complex problem of learning user preferences from a rich and complex set of interactions (e.g., likes, comments and tags for posts, photos and videos) and activities (e.g., favourites, group ...
Recommendation via user's personality and social contextual
CIKM '13: Proceedings of the 22nd ACM international conference on Information & Knowledge ManagementWith the advent and popularity of social network, more and more users like to share their experiences, such as ratings, reviews, and blogs. The new factors of social network like interpersonal influence and interest based on circles of friends bring ...
Exploring acquaintances of social network site users for effective social event recommendations
In this paper, we propose a social event recommendation method that exploits a user's social interaction relations and collaborative friendships to recommend events of interest. A challenge of the social event recommendation is that social events, such ...
Comments