Community Structure Identification in Social Networks Inspired by Parliamentary Political Competitions
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.
KeywordsCommunity detection Genetic algorithm Modularity Political competition algorithm Social networks
- 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
- 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.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.
- 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.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.
- 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.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.
- 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.Michael, J. H. (1997). Labor dispute reconciliation in a forest products manufacturing facility. Forest products journal, 47(11/12), 41.Google Scholar
- 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.NEWMAN M E J. Network data [DB/OL], 2011-06-14. http://www-personal.umich.edu/~mejn/netdata/.