Discovering Social Circles in Ego Networks

被引:551
作者
McAuley, Julian [1 ]
Leskovec, Jure [1 ]
机构
[1] Stanford Univ, Dept Comp Sci, Stanford, CA 94305 USA
基金
美国国家科学基金会;
关键词
Community detection; social circles; ego networks; machine learning; COMMUNITY STRUCTURE;
D O I
10.1145/2556612
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
People's personal social networks are big and cluttered, and currently there is no good way to automatically organize them. Social networking sites allow users to manually categorize their friends into social circles (e.g., "circles" on Google+, and "lists" on Facebook and Twitter). However, circles are laborious to construct and must be manually updated whenever a user's network grows. In this article, we study the novel task of automatically identifying users' social circles. We pose this task as a multimembership node clustering problem on a user's ego network, a network of connections between her friends. We develop a model for detecting circles that combines network structure as well as user profile information. For each circle, we learn its members and the circle-specific user profile similarity metric. Modeling node membership to multiple circles allows us to detect overlapping as well as hierarchically nested circles. Experiments show that our model accurately identifies circles on a diverse set of data from Facebook, Google+, and Twitter, for all of which we obtain hand-labeled ground truth.
引用
收藏
页码:73 / 100
页数:28
相关论文
共 58 条
[1]  
Airoldi EM, 2008, J MACH LEARN RES, V9, P1981
[2]  
[Anonymous], SIAM INT C DAT MIN
[3]  
[Anonymous], INT C DAT MIN
[4]  
[Anonymous], 2009, KNOWLEDGE DISCOVERY
[5]  
[Anonymous], NEURAL INFORM PROCES
[6]  
[Anonymous], SOCINFO
[7]  
[Anonymous], INT C MACH LEARN
[8]  
[Anonymous], INT C INT MULT SYST
[9]  
[Anonymous], 2009, ARXIV09081062
[10]  
[Anonymous], LESS IS MORE PROBABI