Performance Analysis of a Multicore Approach Proposed for Efficient Community Detection and Recommendation System

References

• M. Girvan, and M. E. Newman, “Structure in social and biological networks,” Proc. Natl. Acad. Sci. U.S.A., Vol. 99, no. 12, pp. 7821–6, 2002.
   PubMed Web of Science ®Google Scholar
• P. Pons, and M. Latapy, “Computing communities in large networks using random walks,” Int J. Graph Algorithms Appl., Vol. 10, pp. 191–218, 2006.
   Google Scholar
• J. Reichardt, and S. Bornholdt, “Statistical mechanics of community detection,” Phys. Rev. E, Vol. 74, no. 1, pp. 016110, 2006.
   Web of Science ®Google Scholar
• M. E. Newman, “Finding community structure in networks using the eigenvectors of matrices,” Phys. Rev. E, Vol. 74, no. 3, pp. 036104, 2006.
   Web of Science ®Google Scholar
• U. N. Raghavan, R. Albert, and S. Kumara, “Near linear time algorithm to detect community structures in large-scale networks,” Phys. Rev. E, Vol. 76, no. 3, pp. 036106, 2007.
   PubMed Web of Science ®Google Scholar
• V. D. Blondel, J. L. Guillaume, R. Lambiotte, and E. Lefebvre, “Fast unfolding of communities in large networks,” J. Stat. Mech. Theory Exp., Vol. 2008, no. 10, pp. P10008, 2008.
   Web of Science ®Google Scholar
• M. Rosvall, A. V. Esquivel, A. Lancichinetti, J. D. West, and R. Lambiotte, “Memory in network flows and its effects on spreading dynamics and community detection,” Nat. Commun., Vol. 5, no. 1, pp. 1–13, 2014.
   Google Scholar
• V. A. Traag, L. Waltman, and N. J. Van Eck, “From Louvain to Leiden: guaranteeing well-connected communities,” Sci. Rep., Vol. 9, no. 1, pp. 1–12, 2019.
   PubMed Web of Science ®Google Scholar
• S. Ghosh, et al., “Distributed Louvain algorithm for graph community detection,” in IEEE International Parallel and Distributed Processing Symposium (IPDPS), Vancouver, BC, Canada, May 21–25, 2018, pp. 1530–2075.
   Google Scholar
• H. Li, R. Zhang, Z. Zhao, and X. Liu, “LPA-MNI: an improved label propagation algorithm based on modularity and node importance for community detection,” Entropy, Vol. 23, no. 5, pp. 497, 2021.
   PubMed Web of Science ®Google Scholar
• M. Mohammadi, M. Fazlali, and M. Hosseinzadeh, “Accelerating Louvain community detection algorithm on graphic processing unit,” J. Supercomput., Vol. 77, no. 6, pp. 6056–77, 2021.
   Web of Science ®Google Scholar
• G. Csardi, and M. G. Csardi, “Package ‘igraphdata’,” Yeast, Vol. 13, pp. 1, 2015.
   Google Scholar
• D. Singh, and R. Garg, “Comparative analysis of sequential community detection algorithms based on internal and external quality measure,” J. Stat. Manage. Syst., Vol. 23, no. 7, pp. 1129–46, 2020.
   Web of Science ®Google Scholar
• J. Leskovec, J. Kleinberg, and C. Faloutsos, “Graph evolution: densification and shrinking diameters,” ACM Trans. Knowl. Discov. Data (ACM TKDD), Vol. 1, no. 1, pp. 2–es, 2007.
   Google Scholar
• M. Richardson, R. Agrawal, and P. Domingos. Trust management for the semantic Web. Sanibel Island, FL: ISWC, 2003.
   Google Scholar
• J. McAuley, and J. Leskovec. Learning to Discover Social Circles in Ego Networks. NIPS, 2012.
   Google Scholar
• J. Yang, and J. Leskovec, “Defining and evaluating network communities based on ground-truth,” Knowl. Inf. Syst., Vol. 42, no. 1, pp. 181–213, 2015.
   Web of Science ®Google Scholar
• J. Huang, H. Sun, J. Han, and B. Feng, “Density-based shrinkage for revealing hierarchical and overlapping community structure in networks,” Physica A, Vol. 390, no. 11, pp. 2160–71, 2011.
   Web of Science ®Google Scholar
• J. Yang, and J. Leskovec, “Overlapping community detection at scale: a nonnegative matrix factorization approach,” in Proceedings of the sixth ACM international conference on Web search and data mining, Rome, Italy, Feb. 4–8, 2013, pp. 587–596.
   Google Scholar
• J. Xie, S. Kelley, and B. K. Szymanski, “Overlapping community detection in networks: the state-of-the-art and comparative study,” ACM Comput. Surveys (CSUR), Vol. 45, no. 4, pp. 1–35, 2013.
   Web of Science ®Google Scholar
• R. K. Behera, and S. K. Rath, “An efficient modularity based algorithm for community detection in social network,” in 2016 International Conference on Internet of Things and Applications (IOTA), Pune, India, Jan. 22–24, 2016, pp. 162–167.
   Google Scholar
• R. K. Behera, S. K. Rath, S. Misra, R. Damaševičius, and R. Maskeliūnas, “Large scale community detection using a small world model,” Appl. Sci., Vol. 7, no. 11, pp. 1173, 2017.
   Google Scholar
• A. Kumari, R. K. Behera, B. Sahoo, and S. P. Sahoo, “Prediction of link evolution using community detection in social network,” Computing, Vol. 104, pp. 1–22, 2022.
   Web of Science ®Google Scholar
• F. Sheikholeslami, and G. B. Giannakis, “Identification of overlapping communities via constrained egonet tensor decomposition,” IEEE Trans. Signal Process., Vol. 66, no. 21, pp. 5730–45, 2018.
   Web of Science ®Google Scholar
• A. Gorovits, E. Gujral, E. E. Papalexakis, and P. Bogdanov, “Larc: Learning activity-regularized overlapping communities across time,” in Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, London, United Kingdom, Aug. 19–23, 2018, pp. 1465–1474.
   Google Scholar
• S. A. Al-Sayouri, E. Gujral, D. Koutra, E. E. Papalexakis, and S. S. Lam, “t-PNE: tensor-based predictable node embeddings,” in 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), Barcelona, Spain, Aug. 28–31, 2018, pp. 491–494.
   Google Scholar
• E. Gujral, E. E. Papalexakis, G. Theocharous, and A. Rao, “HACD: Hierarchical agglomerative community detection in social networks,” in 2019 IEEE 29th International Workshop on Machine Learning for Signal Processing (MLSP), Pittsburgh, PA, USA, Oct. 13–16, 2019, pp. 1551–2541.
   Google Scholar
• Y. Zhang, Y. Liu, R. Jin, J. Tao, L. Chen, and X. Wu, “A graph layout based label propagation algorithm for community detection,” Knowl. Based. Syst., Vol. 206, pp. 106363, 2020.
   Web of Science ®Google Scholar
• R. Hosseini, and A. Rezvanian, “Ant-based label propagation algorithm for community detection in social networks,” Soc. Netw., Vol. 7, pp. 10, 2020.
   Google Scholar
• D. Singh, and R. Garg, “NI-Louvain: a novel algorithm to detect overlapping communities with influence analysis,” J. King Saud University-Comput. Inf. Sci., Vol. 34, no. 9, pp. 7765–7774, 2021.
   Web of Science ®Google Scholar
• M. Seifikar, S. Farzi, and M. Barati, “C-blondel: an efficient Louvain-based dynamic community detection algorithm,” IEEE Trans. Comput. Soc. Syst., Vol. 7, no. 2, pp. 308–18, 2020.
   Web of Science ®Google Scholar
• H. J. Li, L. Wang, Z. Bu, J. Cao, and Y. Shi, “Measuring the network vulnerability based on Markov criticality,” ACM Trans. Knowl. Discov. Data (TKDD), Vol. 16, no. 2, pp. 1–24, 2021.
   Web of Science ®Google Scholar
• R. Kumar, R. K. Behera, A. Kesarwani, and S. K. Rath, “A fast algorithm for enumerating maximal cliques in large scale network,” in 2017 14th IEEE India Council International Conference (INDICON), Roorkee, India, Dec. 15–17, 2017, pp. 1–6.
   Google Scholar
• H. Li, W. Xu, C. Qiu, and J. Pei, “Fast Markov clustering algorithm based on belief dynamics,” IEEE Trans Cybern., Vol. 53, pp. 3716–3725, 2022.
   Web of Science ®Google Scholar
• H. J. Li, S. Song, W. Tan, Z. Huang, X. Li, W. Xu, and J. Cao, “Characterizing the fuzzy community structure in link graph via the likelihood optimization,” Neurocomputing, Vol. 512, pp. 482–93, 2022.
   Web of Science ®Google Scholar
• S. Song, Y. Feng, W. Xu, H. J. Li, and Z. Wang, “Evolutionary prisoner’s dilemma game on signed networks based on structural balance theory,” Chaos Solitons Fractals, Vol. 164, pp. 112706, 2022.
   Google Scholar
• B. Barney, “Introduction to parallel computing,” Lawrence Livermore National Laboratory, Vol. 6, no. 13, pp. 10, 2010.
   Google Scholar
• R. Robey, and Y. Zamora. Parallel and High Performance Computing. Shelter Island, NY: Simon and Schuster, 2021.
   Google Scholar
• A. Bastoni, B. B. Brandenburg, and J. H. Anderson, “An empirical comparison of global, partitioned, and clustered multiprocessor EDF schedulers,” in 2010 31st IEEE Real-Time Systems Symposium, IEEE, 2010, November, pp. 14–24.
   Google Scholar
• Luca Saba, Skandha S Sanagala, Suneet K Gupta, Vijaya K Koppula, John R Laird, Vijay Viswanathan, Miguel J Sanches, George D Kitas, Amer M Johri, Neeraj Sharma, Andrew Nicolaides, Jasjit S Suri, “A multicenter study on carotid ultrasound plaque tissue characterization and classification using Six deep artificial intelligence models: a stroke application,” IEEE Trans. Instrum. Meas., Vol. 70, pp. 1–12, 2021.
   PubMed Web of Science ®Google Scholar
• M. E. Newman, “Modularity and community structure in networks,” Proc. Natl. Acad. Sci. U.S.A., Vol. 103, no. 23, pp. 8577–82, 2006.
   PubMed Web of Science ®Google Scholar