Adaptive parallel Louvain community detection on a multicore platform

Abstract Community detection is a demanded technique in analyzing complex and massive graph-based networks. The quality of the detected communities in an acceptable time is an important aspect of an algorithm, which aims at passing through an ultra large scale graph, for instance a social network graph. In this paper, an efficient method is proposed to tackle Louvain community detection problem on multicore systems in the line of thread-level parallelization. The main contribution of this article is to present an adaptive parallel thread assignment for the calculation of adding qualified neighbor nodes to the community. This leads to obtain a better load balancing method for the execution of threads. The proposed method is evaluated on an AMD system with 64 cores, and can reduce the execution time by 50% in comparison with the previous fastest parallel algorithms. Moreover, it was observed in the course of the experiments that our method could find comparably qualified communities.

[1]  David Lo,et al.  Hierarchical Parallel Algorithm for Modularity-Based Community Detection Using GPUs , 2013, Euro-Par.

[2]  Jianyong Wang,et al.  Parallel community detection on large networks with propinquity dynamics , 2009, KDD.

[3]  Michael R. Lyu,et al.  Incorporating Implicit Link Preference Into Overlapping Community Detection , 2015, AAAI.

[4]  Zahra Masdarolomoor,et al.  Finding Community Structure in Complex Networks Using Parallel Approach , 2011, 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing.

[5]  Michel Crampes,et al.  From photo networks to social networks, creation and use of a social network derived with photos , 2010, ACM Multimedia.

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

[7]  Ankur Narang,et al.  Fast Community Detection Algorithm with GPUs and Multicore Architectures , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[8]  Xin Li,et al.  LPA Based Hierarchical Community Detection , 2014, 2014 IEEE 17th International Conference on Computational Science and Engineering.

[9]  Wenjie Fan,et al.  Overlapping community structure detection in multi-online social networks , 2015, 2015 18th International Conference on Intelligence in Next Generation Networks.

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

[11]  Sebastiano Vigna,et al.  The webgraph framework I: compression techniques , 2004, WWW '04.

[12]  Lc Freeman,et al.  USING GALOIS LATTICES TO REPRESENT NETWORK DATA , 1993 .

[13]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

[14]  Paul A. Bates,et al.  Cluster analysis of networks generated through homology: automatic identification of important protein communities involved in cancer metastasis , 2006, BMC Bioinformatics.

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

[16]  Satu Elisa Schaeffer,et al.  Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[17]  Carey E. Priebe,et al.  Community Detection and Classification in Hierarchical Stochastic Blockmodels , 2015, IEEE Transactions on Network Science and Engineering.

[18]  Fabio Checconi,et al.  Scalable Community Detection with the Louvain Algorithm , 2015, 2015 IEEE International Parallel and Distributed Processing Symposium.

[19]  Chengcui Zhang,et al.  A fast parallel modularity optimization algorithm (FPMQA) for community detection in online social network , 2013, Knowl. Based Syst..

[20]  Amedeo Napoli,et al.  Analysis of Social Communities with Iceberg and Stability-Based Concept Lattices , 2008, ICFCA.

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

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

[23]  David A. Bader,et al.  Parallel Community Detection for Massive Graphs , 2011, PPAM.

[24]  Christian Staudt,et al.  Engineering Parallel Algorithms for Community Detection in Massive Networks , 2013, IEEE Transactions on Parallel and Distributed Systems.

[25]  Jimeng Sun,et al.  MetaFac: community discovery via relational hypergraph factorization , 2009, KDD.

[26]  Mehregan Mahdavi,et al.  A social recommender system using item asymmetric correlation , 2018, Applied Intelligence.

[27]  Pablo San Segundo,et al.  An improved bit parallel exact maximum clique algorithm , 2013, Optim. Lett..

[28]  Vahab S. Mirrokni,et al.  Large-Scale Community Detection on YouTube for Topic Discovery and Exploration , 2011, ICWSM.

[29]  Arturo González-Escribano,et al.  A Survey on Thread-Level Speculation Techniques , 2016, ACM Comput. Surv..

[30]  Sanjukta Bhowmick,et al.  A Template for Parallelizing the Louvain Method for Modularity Maximization , 2013 .

[31]  Richard Forster,et al.  Louvain community detection with parallel heuristics on GPUs , 2016, 2016 IEEE 20th Jubilee International Conference on Intelligent Engineering Systems (INES).

[32]  Michel Crampes,et al.  Survey on Social Community Detection , 2013, Social Media Retrieval.

[33]  Josep-Lluís Larriba-Pey,et al.  High quality, scalable and parallel community detection for large real graphs , 2014, WWW.

[34]  Marco Rosa,et al.  Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks , 2010, WWW.

[35]  Jiashun Jin,et al.  FAST COMMUNITY DETECTION BY SCORE , 2012, 1211.5803.

[36]  Hadi Tabatabaee Malazi,et al.  Fast parallel community detection algorithm based on modularity , 2015, 2015 18th CSI International Symposium on Computer Architecture and Digital Systems (CADS).