Skip to main content
SpringerLink
Log in

Community detection in complex networks using network embedding and gravitational search algorithm

  • Published:
Journal of Intelligent Information Systems Aims and scope Submit manuscript

Abstract

The structural and functional characteristic features of nodes can be analyzed by visualizing community structure in complex networks. Community detection helps us to detect nodes having similar behavior in a system and organize the network into a network of closely connected groups or modules. Network embedding technique represents the nodes of the input graph into vector space and preserves their inherent and topological features and can contribute significantly to various applications in network analysis. In this paper, we propose a novel community detection method using network embedding technique. Firstly, nodes of the graph are embedded in feature space of d dimensions, and then low-rank approximation is applied to avoid the results from being affected by noise or outliers. Further, k-means clustering is employed to find the centroids of the clusters in the network and followed by a gravitational search algorithm to improve the results of centroids of clusters. Finally, we compute the effectiveness of detected communities using different performance measures. Our method serves as a universal framework towards applying and bench-marking various embedding techniques in graphs for performing community detection. We perform the test using various evaluation criteria on several real-life and synthetic networks and the obtained result reveals the utility of the proposed algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  • Adamic, L.A., & Glance, N. (2005). The political blogosphere and the 2004 US Election. In Proceedings of the WWW-2005 workshop on the weblogging ecosystem.

  • Aggarwal, C.C. (2011). An introduction to social network data analytics. In Social network data analytics (pp. 1–15). Boston: Springer.

  • Aggarwal, C., & Subbian, K. (2014). Evolutionary network analysis a survey. ACM Computing Surveys (CSUR), 1;47(1), 1–36.

    Article  Google Scholar 

  • Arasteh, M., & Alizadeh, S. (2019). A fast divisive community detection algorithm based on edge degree betweenness centrality. Applied Intelligence, 49(2), 689–702.

    Article  Google Scholar 

  • Bamakan, S.M., Nurgaliev, I., Qu, Q. (2109). Opinion leader detection: a methodological review. Expert Systems with Applications, 115, 200–22.

    Article  Google Scholar 

  • Battiston, F., Iacovacci, J., Nicosia, V., Bianconi, G., Latora, V. (2016). Emergence of multiplex communities in collaboration networks. PLoS ONE, 11(1), e0147451.

    Article  Google Scholar 

  • Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E. (2008). Fast unfolding of communities in large networks. Journal of statistical mechanics: theory and experiment, 2008(10), P10008.

    Article  Google Scholar 

  • Chouchani, N., & Abed, M. (2020). Online social network analysis: detection of communities of interest. Journal of Intelligent Information Systems, 54 (1), 5–21.

    Article  Google Scholar 

  • Clauset, A., Newman, M.E., Moore, C. (2004). Finding community structure in very large networks. Physical Review E, 70(6), 06611.

    Article  Google Scholar 

  • Cordasco, G, & Gargano, L. (2010). Community detection via semi-synchronous label propagation algorithms. In 2010 IEEE international workshop on: business applications of social network analysis (BASNA) (pp. 1–8): IEEE.

  • Cui, P., Wang, X., Pei, J., Zhu, W. (2018). A survey on network embedding. IEEE Transactions on Knowledge and Data Engineering, 31(5), 833–52.

    Article  Google Scholar 

  • Danon, L., Arenas, A., Díaz-Guilera, A. (2008). Impact of community structure on information transfer. Physical Review E, 3;77(3), 036103.

    Article  Google Scholar 

  • Ding, Z., Zhang, X., Sun, D., Luo, B. (2018). Low-rank subspace learning based network community detection. Knowledge-Based Systems, 155, 71–82.

    Article  Google Scholar 

  • Ding, X., Zhang, J., Yang, J. (2018). A robust two-stage algorithm for local community detection. Knowledge-Based Systems, 152, 188–199.

    Article  Google Scholar 

  • Estévez, P.A., Tesmer, M., Perez, C.A., Zurada, J.M. (2009). Normalized mutual information feature selection. IEEE Transactions on Neural Networks, 20(2), 189–201.

    Article  Google Scholar 

  • Eustace, J., Wang, X., Li, J. (2014). Approximating web communities using subspace decomposition. Knowledge-Based Systems, 70, 118–127.

    Article  Google Scholar 

  • Fortunato, S. (2010). Community detection in graphs. Physics Reports, 486(3), 75–174.

    Article  MathSciNet  Google Scholar 

  • Fortunato, S., & Hric, D. (2016). Community detection in networks: a user guide. Physics Reports, 659, 1–44.

    Article  MathSciNet  Google Scholar 

  • Freeman, L. (2004). The development of social network analysis. A Study in the Sociology of Science, 1, 687.

    Google Scholar 

  • Girvan, M., & Newman, M.E. (2002). Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 11;99(12), 7821–6.

    Article  MathSciNet  Google Scholar 

  • Goyal, P., & Ferrara, E. (2018). Graph embedding techniques, applications, and performance: a survey. Knowledge-Based Systems, 151, 78–94.

    Article  Google Scholar 

  • Grover, A., & Leskovec, J. (2016). node2vec: scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining (pp. 855–864): ACM.

  • Guerrero, M., Montoya, F.G., Baños, R., Alcayde, A., Gil, C. (2017). Adaptive community detection in complex networks using genetic algorithms. Neurocomputing, 266, 101–113.

    Article  Google Scholar 

  • Gui, Q., Deng, R., Xue, P., Cheng, X. (2018). A community discovery algorithm based on boundary nodes and label propagation. Pattern Recognition Letters, 109, 103–9.

    Article  Google Scholar 

  • Guo, K., He, L., Chen, Y., Guo, W., Zheng, J. (2020). A local community detection algorithm based on internal force between nodes. Applied Intelligence, 50(2), 328–40.

    Article  Google Scholar 

  • Honghao, C., Zuren, F, Zhigang, R. (2013). Community detection using ant colony optimization. In 2013 IEEE congress on evolutionary computation (pp. 3072–3078): IEEE.

  • Huang, H., Shen, H., Meng, Z., Chang, H., He, H. (2019). Community-based influence maximization for viral marketing. Applied Intelligence, 49(6), 2137–50.

    Article  Google Scholar 

  • Jaradat, A.S., & Hamad, S.B. (2018). Community structure detection using firefly algorithm. International Journal of Applied Metaheuristic Computing (IJAMC), 9(4), 52–70.

    Article  Google Scholar 

  • Krebs, V. (2020). unpublished, http://www.orgnet.com/.

  • Kumar, S., & Panda, B.S. (2020). Identifying influential nodes in social networks: neighborhood coreness based voting approach. Physica A: Statistical Mechanics and its Applications, 124215.

  • Lancichinetti, A., Fortunato, S., & Radicchi, F. (2008). Benchmark graphs for testing community detection algorithms. Physical review E, 78(4), 046110.

    Article  Google Scholar 

  • Ma, L., Huang, H., He, Q., Chiew, K., Liu, Z. (2014). Toward seed-insensitive solutions to local community detection. Journal of Intelligent Information Systems, 43(1), 183–203.

    Article  Google Scholar 

  • Mahmood, A., & Small, M. (2015). Subspace based network community detection using sparse linear coding. IEEE Transactions on Knowledge and Data Engineering, 28(3), 801–812.

    Article  Google Scholar 

  • Mahmoud, H., Masulli, F., Rovetta, S., Russo, G. (2013). Community detection in protein-protein interaction networks using spectral and graph approaches. In International meeting on computational intelligence methods for bioinformatics and biostatistics (pp. 62–75). Cham: Springer.

  • McDaid, A.F., Greene, D., Hurley, N. (2013). Normalized mutual information to evaluate overlapping community finding algorithms arXiv:1110.2515v2.

  • Messaoudi, I., & Kamel, N. (2019). A multi-objective bat algorithm for community detection on dynamic social networks. Applied Intelligence, 49(6), 2119–36.

    Article  Google Scholar 

  • Mitchell, M. (2006). Complex systems: network thinking. Artificial Intelligence, 170(18), 1194–1212.

    Article  MathSciNet  Google Scholar 

  • Newman, M.E. (2001). The structure of scientific collaboration networks. Proceedings of the National Academy of Science, 98(2), 404–409.

    Article  MathSciNet  Google Scholar 

  • Newman, M.E. (2006). Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103(23), 8577–8582.

    Article  Google Scholar 

  • Newman, M.E. (2006). Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74(3), 036104.

    Article  MathSciNet  Google Scholar 

  • Newman, M.E. (2012). Communities, modules and large-scale structure in networks. Nature Physics, 8(1), 25.

    Article  Google Scholar 

  • Ou, M., Cui, P., Pei, J., Zhang, Z., Zhu, W. (2016). Asymmetric transitivity preserving graph embedding. In Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining (pp. 1105–111.4): ACM.

  • 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.

    Article  Google Scholar 

  • Pattanayak, H.S., Sangal, A.L., Verma, H.K. (2019). Community detection in social networks based on fire propagation. Swarm and evolutionary computation, 44, 31–48.

    Article  Google Scholar 

  • Ramezani, M., Khodadadi, A., Rabiee, H.R. (2018). Community detection using diffusion information. ACM Transactions on Knowledge Discovery from Data (TKDD), 23;12(2), 1–22.

    Article  Google Scholar 

  • Rashedi, E., Nezamabadi-pour, H., Saryazdi, S. (2009). GSA: A gravitational search algorithm. Elsevier Information Sciences, 179, 2232–2248.

    Article  Google Scholar 

  • Rosvall, M., & Bergstrom, C.T. (2008). Maps of random walks on complex networks reveal community structure. Proceedings of the National Academy of Sciences, 105(4), 1118–1123.

    Article  Google Scholar 

  • Sahebi, S., & Cohen, W.W. (2011). Community-based recommendations: a solution to the cold start problem. In Workshop on recommender systems and the social web, RSWEB (p. 60).

  • Saleh, M., Esa, Y., Mohamed. (2019). A applications of complex network analysis in electric power systems. Energies, 11(6), 1381.

    Article  Google Scholar 

  • Siddiquea, N., & Adelib, H. (2016). Applications of gravitational search algorithm in engineering.

  • Wang, D., Cui, P., Zhu, W. (2016). Structural deep network embedding. In Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining (pp. 1225–1234): ACM.

  • Yadav, R.K., & Rai, A.K. (2020). Incorporating communities’ structures in predictions of missing links. Journal of Intelligent Information Systems. https://doi.org/10.1007/s10844-020-00603-y.

  • Zachary, W.W. (1977). An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 33, 452–473.

    Article  Google Scholar 

  • Zhou, Z., & Amini, A. (2019). Analysis of spectral clustering algorithms for community detection: the general bipartite setting. Journal of Machine Learning Research, 20(47), 1–47.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Delhi Technological University, New Delhi, 110042, India

    Sanjay Kumar & Deepanshu Aggarwal

  2. Computer Science and Application Group, Department of Mathematics, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, 110016, India

    Sanjay Kumar & B S Panda

Authors
  1. Sanjay Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B S Panda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Deepanshu Aggarwal
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sanjay Kumar.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kumar, S., Panda, B.S. & Aggarwal, D. Community detection in complex networks using network embedding and gravitational search algorithm. J Intell Inf Syst 57, 51–72 (2021). https://doi.org/10.1007/s10844-020-00625-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10844-020-00625-6

Keywords

Search

Navigation