Identification of Communities on Static Social Networks

محورهای موضوعی : Majlesi Journal of Telecommunication Devices

Maliheh Ghasemzadeh ¹ , Mohsen Ashourian ²

1 - Department of Electrical Engineering, Majlesi Branch, Islamic Azad University, Isfahan, Iran
2 - Department of Electrical Engineering, Majlesi Branch, Islamic Azad University, Isfahan, Iran

تاریخ دریافت : 1398/06/04 تاریخ پذیرش : 1398/06/04 تاریخ انتشار : 1398/06/10

کلید واژه: Identifying Communities, Genetic Algorithm, Static Social Networks,

چکیده مقاله :

Many complex natural and social structures can be considered as networks. Internet sites, social networks, organizational communications, family connections, electronic mails, phone calls, and financial transactions are just a few examples of these networks. Nowadays, network analysis is one of the most popular and widely used research branches in the world. One of the most commonly used topics in network analysis is the identification of organizations in the network. In this research, we present the detection of communities in static social networks using the genetic algorithm and its improvement with the label propagation algorithm known as Genetic Algorithm- Label Propagation. The genetic algorithm explores the search space well and converges to the best answer. This algorithm is scalable and our results show that our proposed algorithm performs faster and better than other algorithms.

منابع و مأخذ:

REFERENCES

[1] Samimian, L. And M. Sadeghzadeh, Identification of Societies in Social Networks, Second National Conference on Computer Engineering and Information Technology. 2014, Young Researchers Club and Elite Shushtar Branch.

[2] Hosseinzadeh, R., H. Alizadeh, et al. Nazemi, Identifying Communities with a Mixed Approach in Social Networks, 11th National Conference on Intelligent Systems. 2012, Iranian Intelligent Systems Association.

[3] Barber, M.J., Modularity and community detection in bipartite networks. Physical Review E, 2007. 76(6): p. 066102.

[4] Girvan, M. and M.E. Newman, Community structure in social and biological networks. Proceedings of the national academy of sciences, 2002. 99(12): p. 7821-7826.

[5] Zhao, Z., et al., Topic oriented community detection through social objects and link analysis in social networks. Knowledge-Based Systems, 2012. 26: p. 164-173.

[6] Fortunato, S. and C. Castellano, Community structure in graphs, in Computational Complexity. 2012, Springer. p. 490-512.

[7] Clauset, A., M.E. Newman, and C. Moore, Finding community structure in very large networks. Physical review E, 2004. 70(6): p. 066111.

[8] Leskovec, J., et al., Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 2009. 6(1): p. 29-123.

[9] Plantie, M. and M. Crampes, Survey on social community detection, in Social media retrieval. 2013, Springer. p. 65-85.

[10] Steinfield, C., et al. Bowling online: social networking and social capital within the organization. in Proceedings of the fourth international conference on Communities and technologies. 2009. ACM.

[11] Zachary, W.W., An information flow model for conflict and fission in small groups. Journal of anthropological research, 1977. 33(4): p. 452-473.

[12] Girvan, M. and M.E. Newman, Community structure in social and biological networks. Proceedings of the national academy of sciences, 2002. 99(12): p. 7821-7826.

[13] Zhu, X. and Z. Ghahramani, Learning from labeled and unlabeled data with label propagation. 2002.

[14] Sivanandam, V.S. & Deepa. N. (2007). “Introduction to Genetic Algorithms” Springer Berlin Heidelberg New York. ISBN 978-3-540-73189-4.

[15] Raghavan, U.N., R. Albert, and S. Kumara, Near linear time algorithm to detect community structures in large-scale networks. Physical review E, 2007. 76(3): p. 036106.

[16] Newman, M.E. and M. Girvan, Finding and evaluating community structure in networks. Physical review E, 2002. 69(2): p. 026113.

[17] Good, B.H., Y.-A. de Montjoye, and A. Clauset, Performance of modularity maximization in practical contexts. Physical Review E, 2010. 81(4): p. 046106.

[18] U. N. Raghavan, R. Albert, and S. Kumara, “Near linear time algorithm to detect community structures in largescale networks,” Physical Review E, vol. 76, no. 3, p. 036106, 2007.

[19] Y. Xing, F. Meng, Y. Zhou, M. Zhu, M. Shi, and G. Sun, “A Node Influence Based Label Propagation Algorithm for Community Detection in Networks,” The Scientific World Journal, vol. 2014, 2014.

[20] H. Lou, S. Li, and Y. Zhao, “Detecting community structure using label propagation with weighted coherent neighborhood propinquity,” Physica A: Statistical Mechanics and its Applications, vol. 392, no. 14, pp. 3095–3105, 2013.