A FAST OVERLAPPING COMMUNITY DETECTION ALGORITHM BASED ON LABEL PROPAGATION AND SOCIAL NETWORK GRAPH CLUSTERING COEFFICIENT
Author affiliations
DOI:
https://doi.org/10.15625/1813-9663/38/1/16537Abstract
Detecting community structure on social network has been an important and interesting issue on which many researchers have paid much attention and developed applications. Many graph clustering algorithms have been applied to find disjoint communities, i.e each node belongs to a single community. However, for social network in particular, public communication network in general, most of communities are not completely detached but they may be embedding, overlapping or crossing, that means certain nodes can belong to more than one community. Overlapping node plays a role of interface between communities and it is really interesting to study the community establishment of these nodes because it reflects dynamic behaviuor of participants.
This article introduces the algorithm to find overlapping communities on huge social network. The proposed COPACN algorithm has been developed on the basis of label propagation, using advanced clustering coefficient to find overlapping communities on social network. Exprermental results on a set of popular, standard social networks and certain real network have shown the high speed and high effiency in finding overlapping structures.
Metrics
References
[1] Network repository. [Online]. Available: https://networkrepository.com/
[2] C. M. A. Clauset, M. E Newman, “Finding community structure in very large networks,” Physical Review E, 066111, vol. 70, no. 6, 2004. DOI: https://doi.org/10.1103/PhysRevE.70.066111
[3] J. K. A. Lancichinetti, S. Fortunato, “Detecting the overlapping and hierarchical community structure in complex networks,” New Journal of Physics, vol. 11, no. 3, Article ID 033015, 2009. DOI: https://doi.org/10.1088/1367-2630/11/3/033015
[4] M. Arab and M. Hasheminezhad, “Efficient community detection algorithm with label propagation using node importance and link weight,” International Journal of Advanced Computer Science and Applications, vol. 9, no. 5, pp. 510–518, 2018. DOI: https://doi.org/10.14569/IJACSA.2018.090566
[5] M. Girvan and M. E. J. Newman, “Community structure in social and biological networks,” Proc. Natl Acad. Sci. USA., vol. 99, no. 12, pp. 7821–7826, 2002. DOI: https://doi.org/10.1073/pnas.122653799
[6] S. Gregory, “A fast algorithm to find overlapping communities in networks,” Lect. Notes Comput. Sci. 5211 408, 2008. DOI: https://doi.org/10.1007/978-3-540-87479-9_45
[7] ——, “Finding overlapping communities in networks by label propagation,” New Journal of Physics, 103018., vol. 12, no. 10, 2010. DOI: https://doi.org/10.1088/1367-2630/12/10/103018
[8] J. Leskovec and Krevl. Datasets stanford large network dataset collection. [Online]. Available: https://snap.stanford.edu
[9] M. Needham and A. E. Hodler, Graph Algorithms. Oreilly, 2019.
[10] C. S. Saradha and D. P. Arul, “An optimized overlapping and disjoint community detection techniques using improved community overlap propagation algorithm in complex networks,” Advance Scientific Research JCR, vol. 7, no. 4, pp. 782–790, 2020. DOI: https://doi.org/10.31838/jcr.07.04.146
[11] T. Schank and D. Wagner, “Approximating clustering coefficient and transitivity,” Journal of Graph Algorithms and Applications, vol. 9, no. 2, pp. 265–275, 2005. DOI: https://doi.org/10.7155/jgaa.00108
[12] L. Tang and H. Liu, “Graph mining applications to social network analysis,” Managing and Mining Graph Data, Advances in Database Systems, vol. 40, pp. 487–513, 2010. DOI: https://doi.org/10.1007/978-1-4419-6045-0_16
[13] R. A. U. N. Raghavan and S. Kumara, “Near linear time algorithm to detect community structures in large-scale networks,” Phys. Rev. E 036106, vol. 76, 2007. DOI: https://doi.org/10.1103/PhysRevE.76.036106
[14] H. L. J. P. Xuegang Hu, Wei He, “Role-based label propagation algorithm for community detection,” Social and Information Networks, 2016.
Downloads
Published
How to Cite
Issue
Section
License
1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.
