A Simple and Effective Community Detection Method Combining Network Topology with Node Attributes

Community detection is a fundamental problem in the study of complex networks. So far, extensive approaches, which use network topology alone or use both network topology and attribute information, have been designed to detect the community partitions of networks. However, existing approaches cannot work effectively for networks whose community structure does not match well with the ground-truth, or networks whose topological information contains serious noise, and networks where the difference of attribute similarity between nodes is tiny. Inspired by a force-directed network layout and community intuitive characteristics, we propose a simple while effective approach which utilizes attribute information to partition nodes into communities by maximizing network modularity. By using attributes as nodes to the network and the interaction between nodes, our novel method cannot only effectively improve community detection of networks, but also obtain the number of communities closer to the real one. Through extensive experiments on some real-world datasets, we demonstrate the superior performance of the new approach over some state-of-the-art approaches.

[1]  Jianwu Dang,et al.  Detect Overlapping Communities via Ranking Node Popularities , 2016, AAAI.

[2]  Andreas Noack,et al.  Modularity clustering is force-directed layout , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Weixiong Zhang,et al.  Joint Identification of Network Communities and Semantics via Integrative Modeling of Network Topologies and Node Contents , 2017, AAAI.

[4]  Mathias Géry,et al.  I-Louvain: An Attributed Graph Clustering Method , 2015, IDA.

[5]  Yun Chi,et al.  Combining link and content for community detection: a discriminative approach , 2009, KDD.

[6]  M. Jacomy,et al.  ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software , 2014, PloS one.

[7]  Nasif Muslim A Combination Approach to Community Detection in Social Networks by Utilizing Structural and Attribute Data , 2016 .

[8]  Weixiong Zhang,et al.  A Network-Specific Markov Random Field Approach to Community Detection , 2018, AAAI Conference on Artificial Intelligence.

[9]  Rushed Kanawati,et al.  Community detection in Attributed Network , 2018, WWW.

[10]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[11]  Xiaochun Cao,et al.  Semantic Community Identification in Large Attribute Networks , 2016, AAAI.

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

[13]  Santo Fortunato,et al.  Community detection in networks: A user guide , 2016, ArXiv.

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

[15]  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.

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

[17]  Francky Catthoor,et al.  Classification of Resilience Techniques Against Functional Errors at Higher Abstraction Layers of Digital Systems , 2017, ACM Comput. Surv..

[18]  Mark E. J. Newman,et al.  Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Niloy Ganguly,et al.  Metrics for Community Analysis , 2016, ACM Comput. Surv..

[20]  Rushed Kanawati,et al.  ANCA : Attributed Network Clustering Algorithm , 2017, COMPLEX NETWORKS.