Advertisement

Community Structure Identification in Social Networks Inspired by Parliamentary Political Competitions

  • Harish Kumar ShakyaEmail author
  • Nazeer Shaik
  • Kuldeep Singh
  • G. R. Sinha
  • Bhaskar Biswas
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1016)

Abstract

Revealing the concealed community structure, that is vital to understanding the options of networks, is a vital drawback in network and graph analysis. Throughout the last decade, several approaches are projected to resolve this difficult drawback in various ways in which there are totally different measures or knowledge structures. The social network is very popular in the current scenario. Owing to various usefulness in daily routine life, it is a very hot area of research in the current environment. Community structure identification is one of the well-known research works in the social networks. In this research problems are solved by many researchers through different techniques, that is, data mining techniques, soft computing, evolutionary and swarm algorithms. In this experiment, we introduced a novel algorithm called political competition algorithm (PCA) inspired by the Indian parliamentary election procedure. We validate the outcome of the political competition algorithm with the help of various well-known dataset, that is, American Football Club, Books on US Politics, Karate Club and Strike datasets.

Keywords

Community detection Genetic algorithm Modularity Political competition algorithm Social networks 

References

  1. 1.
    Brutz, M., & Meyer, F. G. (2015). A modular multiscale approach to overlapping community detection. arXiv preprint arXiv: 1501.05623 (2015). https://doi.org/2015arXiv150105623B.Google Scholar
  2. 2.
    Sah, P., Singh, L. O., Clauset, A., & Bansal, S. (2014). Exploring community structure in biological networks with random graphs. BMC Bioinformatics, 15(1), 220.  https://doi.org/10.1186/1471-2105-15-220.CrossRefGoogle Scholar
  3. 3.
    Shen, H., Cheng, X., Cai, K., & Hu, M. B. (2009). Detect overlapping and hierarchical community structure in networks. Physica A: Statistical Mechanics and its Applications, 388(8), 1706–1712.  https://doi.org/10.1016/j.physa.2008.12.021.CrossRefGoogle Scholar
  4. 4.
    Newman, M. E. (2004). Fast algorithm for detecting community structure in networks. Physical Review E, 69(6), 066–133.  https://doi.org/10.1103/PhysRevE.69.066133.CrossRefGoogle Scholar
  5. 5.
    Girvan, M., & Newman, M. E. (2002). Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99(12), 7821–7826.  https://doi.org/10.1073/pnas.122653799.MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Gog, A., Dumitrescu, D., & Hirsbrunner, B. (2007). Community detection in complex networks using collaborative evolutionary algorithms. In European Conference on Artificial Life (pp. 886–894). Berlin, Heidelberg: Springer.  https://doi.org/10.1007/978-3-540-74913-4_89.
  7. 7.
    Gregory, S., An algorithm to find overlapping community structure in networks. In European Conference on Principles of Data Mining and Knowledge Discovery ([pp. 91–102). Berlin, Heidelberg: Springer.  https://doi.org/10.1007/978-3-540-74976-9_12.
  8. 8.
    Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005). Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435(7043), 814–818.  https://doi.org/10.1038/nature03607.CrossRefGoogle Scholar
  9. 9.
    Shakya, H. K., Singh, K., & Biswas, B. (2018). Community detection in social network with regenerative genetic algorithm. International Journal of Pure and Applied Mathematics, 118(5), 397–411.Google Scholar
  10. 10.
    Pizzuti, C. (2009). Overlapped community detection in complex networks. In Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (pp. 859–866) (2009). http://doi.org/10.1145/1569901.1570019.
  11. 11.
    Cai, Y., Shi, C., Dong, Y., Ke, Q., & Wu, B. (2011). A novel genetic algorithm for overlapping community detection. In International Conference on Advanced Data Mining and Applications (pp. 97–108). Springer, Berlin, Heidelberg.  https://doi.org/10.1007/978-3-642-25853-4_8.CrossRefGoogle Scholar
  12. 12.
    Shakya, H. K., Singh, K., & Biswas, B. (2017). An efficient genetic algorithm for fuzzy community detection in social network (Vol. 712, pp. 63–72). Singapore: Springer (2017).  https://doi.org/10.1007/978-981-10-5780-9_6.Google Scholar
  13. 13.
    Ahn, Y. Y., Bagrow, J. P., & Lehmann, S. (2010). Link communities reveal multi-scale complexity in networks. Nature, 466(7307), 761–764 (2010).  https://doi.org/10.1038/nature09182.CrossRefGoogle Scholar
  14. 14.
    Kumpula, J. M., Kivelä, M., Kaski, K., & Saramäki, J. (2008). Sequential algorithm for fast clique percolation. Physical Review E, 78(2), 026109.  https://doi.org/10.1103/PhysRevE.78.026109.CrossRefGoogle Scholar
  15. 15.
    Lancichinetti, A., Fortunato, S., & Kertész, J. (2009). Detecting the overlapping and hierarchical community structure in complex networks. New Journal of Physics, 11(3), 033015.  https://doi.org/10.1088/1367-2630/11/3/033015.CrossRefGoogle Scholar
  16. 16.
    Shakya, H. K., Singh, K., & Biswas, B. (2014). Community detection using differential evolution algorithm with multiple objective function. International Journal of Urban Design for Ubiquitous Computing, 2(1),7–14 (2014). http://dx.doi.org/10.21742/ijuduc.2014.2.1.02.
  17. 17.
    Borji, A. (2007). A new global optimization algorithm inspired by parliamentary political competitions In Mexican International Conference on Artificial Intelligence (pp. 61–71). Berlin, Heidelberg: Springer.  https://doi.org/10.1007/978-3-540-76631-5_7.
  18. 18.
    Borji, A. (2008). Heuristic function optimization inspired by social competitive behaviors. Journal of Applied Sciences, 8(11), 2105–2111.  https://doi.org/10.3923/jas.2008.2105.2111.CrossRefGoogle Scholar
  19. 19.
    Borji, A., & Hamidi, M. (2009). A new approach to global optimization motivated by parliamentary political competitions. International Journal of Innovative Computing, Information and Control, 5(6), 1643–1653.Google Scholar
  20. 20.
    Michael, J. H. (1997). Labor dispute reconciliation in a forest products manufacturing facility. Forest products journal, 47(11/12), 41.Google Scholar
  21. 21.
    Zachary, W. W. (1977). An information flow model for confict and fission in small groups. Journal of Anthropological Research, 33(4), 452–473 (1977).  https://doi.org/10.1086/jar.33.4.3629752.CrossRefGoogle Scholar
  22. 22.
    Lusseau, D., Schneider, K., Boisseau, O. J., Haase, P., Slooten, E., & Dawson, S. M.: The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations: Can geographic isolation explain this unique trait? Behavioral Ecology and Sociobiology, 54(4), 396–405 (2003). http://www.jstor.org/stable/25063281.
  23. 23.
    NEWMAN M E J. Network data [DB/OL], 2011-06-14. http://www-personal.umich.edu/~mejn/netdata/.

Copyright information

© Springer Nature Singapore Pte Ltd. 2020

Authors and Affiliations

  • Harish Kumar Shakya
    • 1
    Email author
  • Nazeer Shaik
    • 1
  • Kuldeep Singh
    • 2
  • G. R. Sinha
    • 3
  • Bhaskar Biswas
    • 2
  1. 1.Department of Computer Science & EngineeringBapatla Engineering CollegeGunturIndia
  2. 2.Department of Computer Science & EngineeringIndian Institute of Technology (BHU)VaranasiIndia
  3. 3.International Institute of Information Technology (IIIT)BangaloreIndia

Personalised recommendations