DLCD-CCE: A Local Community Detection Algorithm for Complex IoT Networks

Internet of Things (IoT) refers to the complex systems generated by the interconnections among widely available objects. Such interactions generate large networks, whose complexity needs to be addressed to provide suitable computationally efficient approaches. In this article, we propose a distributed local community detection algorithm based on specific properties of community center expansions (DLCD-CCE) for large-scale complex networks. The algorithm is evaluated via a prototype system, based on Spark, to verify its accuracy and scalability. The results demonstrate that compared to the typical local community detection algorithms, DLCD-CCE has better accuracy, stability, and scalability, and effectively overcomes the problem that existing algorithms are sensitive to the location of initial seeds.

[1]  Mohammad S. Obaidat,et al.  Community detection in an integrated Internet of Things and social network architecture , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[2]  Jure Leskovec,et al.  Defining and evaluating network communities based on ground-truth , 2012, Knowledge and Information Systems.

[3]  Jure Leskovec,et al.  Local Higher-Order Graph Clustering , 2017, KDD.

[4]  Justin Zhijun Zhan,et al.  A Framework for Community Detection in Large Networks Using Game-Theoretic Modeling , 2017, IEEE Transactions on Big Data.

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

[6]  Kun Guo,et al.  A dynamic community detection algorithm based on Parallel Incremental Related Vertices , 2017, 2017 IEEE 2nd International Conference on Big Data Analysis (ICBDA)(.

[7]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[8]  Qiong Chen,et al.  Detecting local community structures in complex networks based on local degree central nodes , 2013 .

[9]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[10]  Peng Wang,et al.  A multi-agent genetic algorithm for local community detection by extending the tightest nodes , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[11]  Ryan A. Rossi,et al.  The Network Data Repository with Interactive Graph Analytics and Visualization , 2015, AAAI.

[12]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[13]  Matei A. Zaharia,et al.  An Architecture for and Fast and General Data Processing on Large Clusters , 2016 .

[14]  Feng Luo,et al.  Exploring Local Community Structures in Large Networks , 2006, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06).

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

[16]  Sabeur Aridhi,et al.  An experimental survey on big data frameworks , 2016, Future Gener. Comput. Syst..

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

[18]  A. Clauset.  Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Z WangJames,et al.  Exploring local community structures in large networks , 2008 .