Detecting semantic‐based communities in node‐attributed graphs

In social network analysis, community detection on plain graphs has been widely studied. With the proliferation of available data, each user in the network is usually associated with additional attributes for elaborate description. However, many existing methods only concentrate on the topological structure and fail to deal with node‐attributed networks. These approaches are incapable of extracting clear semantic meanings for communities detected. In this paper, we combine the topological structure and attribute information into a unified process and propose a novel algorithm to detect overlapping semantic communities. Moreover, a new metric is designed to measure the density of semantic communities. The proposed algorithm is divided into 3 phases. First, we detect local semantic subcommunities from each node's perspective using a greedy strategy on the metric. Then, a supergraph, which consists of all these subcommunities is created. Finally, we find global semantic communities on the supergraph. The experimental results on real‐world data sets show the efficiency and effectiveness of our approach against other state‐of‐the‐art methods.

[1]  Inderjit S. Dhillon,et al.  Overlapping Community Detection Using Neighborhood-Inflated Seed Expansion , 2015, IEEE Transactions on Knowledge and Data Engineering.

[2]  Martin Ester,et al.  Mining Cohesive Patterns from Graphs with Feature Vectors , 2009, SDM.

[3]  Clara Pizzuti,et al.  An Evolutionary and Local Refinement Approach for Community Detection in Signed Networks , 2016, Int. J. Artif. Intell. Tools.

[4]  Andrea Tagarelli,et al.  Ensemble-based community detection in multilayer networks , 2017, Data Mining and Knowledge Discovery.

[5]  Dino Pedreschi,et al.  DEMON: a local-first discovery method for overlapping communities , 2012, KDD.

[6]  Jinhui Tang,et al.  Overlapping community detection based on node location analysis , 2016, Knowl. Based Syst..

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

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

[9]  David F. Gleich,et al.  Vertex neighborhoods, low conductance cuts, and good seeds for local community methods , 2012, KDD.

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

[11]  Martin Atzmüller,et al.  Description-oriented community detection using exhaustive subgroup discovery , 2016, Inf. Sci..

[12]  Hong Cheng,et al.  Clustering Large Attributed Graphs: An Efficient Incremental Approach , 2010, 2010 IEEE International Conference on Data Mining.

[13]  Pauli Miettinen,et al.  The Discrete Basis Problem , 2006, IEEE Transactions on Knowledge and Data Engineering.

[14]  Hong Cheng,et al.  Attributed Community Analysis: Global and Ego-centric Views , 2016, IEEE Data Eng. Bull..

[15]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[17]  Steve Gregory,et al.  Finding overlapping communities in networks by label propagation , 2009, ArXiv.

[18]  J. Pinney,et al.  Betweenness-based decomposition methods for social and biological networks , 2006 .

[19]  Clara Pizzuti,et al.  Evolutionary Clustering for Mining and Tracking Dynamic Multilayer Networks , 2017, Comput. Intell..

[20]  Steve Gregory,et al.  An Algorithm to Find Overlapping Community Structure in Networks , 2007, PKDD.

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

[22]  Mohammed J. Zaki,et al.  Mining Attribute-structure Correlated Patterns in Large Attributed Graphs , 2012, Proc. VLDB Endow..

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

[24]  Yizhou Sun,et al.  Personalized entity recommendation: a heterogeneous information network approach , 2014, WSDM.

[25]  Jean-François Boulicaut,et al.  Cohesive Co-evolution Patterns in Dynamic Attributed Graphs , 2012, Discovery Science.

[26]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

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

[28]  R. Carter.  11 – IT and society , 1991 .

[29]  Christos Faloutsos,et al.  PICS: Parameter-free Identification of Cohesive Subgroups in Large Attributed Graphs , 2012, SDM.

[30]  Xiaoming Liu,et al.  SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process , 2011, 2011 IEEE 11th International Conference on Data Mining Workshops.

[31]  Boleslaw K. Szymanski,et al.  Overlapping community detection in networks: The state-of-the-art and comparative study , 2011, CSUR.

[32]  Jirí Síma,et al.  On the NP-Completeness of Some Graph Cluster Measures , 2005, SOFSEM.

[33]  J. Kumpula,et al.  Sequential algorithm for fast clique percolation. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[34]  Aristides Gionis,et al.  Overlapping community detection in labeled graphs , 2014, Data Mining and Knowledge Discovery.

[35]  Francesco Bonchi,et al.  Description-Driven Community Detection , 2014, TIST.