Community Detection based on Structural and Attribute Similarities

The study of social networks has gained much interest from the research community in recent years. One important challenge is to search for communities in social networks. A community is defined as a group of users such that they interact with each other more frequently than with those outside the group. Being able to identify the community structure can facilitate many tasks such as recommendation of friends, network analysis and visualization. In real-world networks, in addition to topological structure (i.e., links), content information is also available. Existing community detection methods are usually based on the structural features and do not take into account the attributes of nodes. In this paper, we propose two algorithms that use both structural and attribute information to extract communities. Our methods partition a graph with attributes into communities so that the nodes in the same community are densely connected as well as homogeneous. Experimental results demonstrate that our methods provide more meaningful communities than conven- tional methods that consider only relationship information. Keywords-social network; community detection; clustering;

[1]  Kai Li,et al.  Efficient k-nearest neighbor graph construction for generic similarity measures , 2011, WWW.

[2]  Yousef Saad,et al.  Fast Approximate kNN Graph Construction for High Dimensional Data via Recursive Lanczos Bisection , 2009, J. Mach. Learn. Res..

[3]  Huan Liu,et al.  Community Detection and Mining in Social Media , 2010, Community Detection and Mining in Social Media.

[4]  Linyuan Lü,et al.  Predicting missing links via local information , 2009, 0901.0553.

[5]  Piyush Kumar,et al.  Fast construction of k-nearest neighbor graphs for point clouds , 2010, IEEE Transactions on Visualization and Computer Graphics.

[6]  P. Lazarsfeld,et al.  Friendship as Social process: a substantive and methodological analysis , 1964 .

[7]  Hong Cheng,et al.  Graph Clustering Based on Structural/Attribute Similarities , 2009, Proc. VLDB Endow..

[8]  Mason A. Porter,et al.  Comparing Community Structure to Characteristics in Online Collegiate Social Networks , 2008, SIAM Rev..

[9]  Nitesh V. Chawla,et al.  Identifying and evaluating community structure in complex networks , 2010, Pattern Recognit. Lett..

[10]  Jure Leskovec,et al.  Empirical comparison of algorithms for network community detection , 2010, WWW '10.

[11]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[12]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[13]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[15]  U. Brandes,et al.  Maximizing Modularity is hard , 2006, physics/0608255.

[16]  Sunil Arya,et al.  An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.

[17]  Hanan Samet,et al.  A Fast Similarity Join Algorithm Using Graphics Processing Units , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[18]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[20]  Ken Wakita,et al.  Finding community structure in mega-scale social networks: [extended abstract] , 2007, WWW '07.

[21]  Sune Lehmann,et al.  Link communities reveal multiscale complexity in networks , 2009, Nature.