Overlapping kernel-based Community Detection with node attributes

Community Detection is a fundamental task in the field of Social Network Analysis, extensively studied in literature. Recently, some approaches have been proposed to detect communities distinguishing their members between kernel that represents opinion leaders, and auxiliary who are not leaders but are linked to them. However, these approaches suffer from two important limitations: first, they cannot identify overlapping communities, which are often found in social networks (users are likely to belong to multiple groups simultaneously); second, they cannot deal with node attributes, which can provide important information related to community affiliation. In this paper we propose a method to improve a well-known kernel-based approach named Greedy-WeBA (Wang et al., 2011) and overcome these limitations. We perform a comparative analysis on three social network datasets, Wikipedia, Twitter and Facebook, showing that modeling overlapping communities and considering node attributes strongly improves the ability of detecting real social network communities.

[1]  Jure Leskovec,et al.  Community Detection in Networks with Node Attributes , 2013, 2013 IEEE 13th International Conference on Data Mining.

[2]  M. A. Muñoz,et al.  Journal of Statistical Mechanics: An IOP and SISSA journal Theory and Experiment Detecting network communities: a new systematic and efficient algorithm , 2004 .

[3]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Boleslaw K. Szymanski,et al.  Towards Linear Time Overlapping Community Detection in Social Networks , 2012, PAKDD.

[5]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[6]  Philip S. Yu,et al.  Hierarchical, Parameter-Free Community Discovery , 2008, ECML/PKDD.

[7]  Jie Tang,et al.  Detecting Community Kernels in Large Social Networks , 2011, 2011 IEEE 11th International Conference on Data Mining.

[8]  Bin Wu,et al.  Community detection in large-scale social networks , 2007, WebKDD/SNA-KDD '07.

[9]  Jure Leskovec,et al.  Overlapping community detection at scale: a nonnegative matrix factorization approach , 2013, WSDM.

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

[11]  Stanford,et al.  Learning to Discover Social Circles in Ego Networks , 2012 .

[12]  Thomas Seidl,et al.  Efficient Mining of Combined Subspace and Subgraph Clusters in Graphs with Feature Vectors , 2013, PAKDD.

[13]  Jure Leskovec,et al.  Statistical properties of community structure in large social and information networks , 2008, WWW.

[14]  Yiannis Kompatsiaris,et al.  Community detection in Social Media , 2012, Data Mining and Knowledge Discovery.

[15]  David M. Blei,et al.  Relational Topic Models for Document Networks , 2009, AISTATS.

[16]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Robert E. Tarjan,et al.  Finding Strongly Knit Clusters in Social Networks , 2008, Internet Math..

[18]  Yan Liu,et al.  Topic-link LDA: joint models of topic and author community , 2009, ICML '09.

[19]  Mark Newman,et al.  Detecting community structure in networks , 2004 .

[20]  Thomas Seidl,et al.  Subspace Clustering Meets Dense Subgraph Mining: A Synthesis of Two Paradigms , 2010, 2010 IEEE International Conference on Data Mining.

[21]  Martin Rosvall,et al.  An information-theoretic framework for resolving community structure in complex networks , 2007, Proceedings of the National Academy of Sciences.