Skip to main content

Variable Neighborhood Search Approach to Community Detection Problem

  • Conference paper
  • First Online:
Numerical Methods and Applications (NMA 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13858))

Included in the following conference series:

  • 303 Accesses

Abstract

Community detection on graphs can help people gain insight into the network’s structural organization, and grasp the relationships between network nodes for various types of networks, such as transportation networks, biological networks, electric power networks, social networks, blockchain, etc. The community in the network refers to the subset of nodes that have greater similarity, i.e. have relatively close internal connections. They should also have obvious differences with members from different communities, i.e. relatively sparse external connections. Solving the community detection problem is one of long standing and challenging optimization tasks usually treated by metaheuristic methods. Thus, we address it by basic variable neighborhood search (BVNS) approach using modularity as the score for measuring quality of solutions. The conducted experimental evaluation on well-known benchmark examples revealed the best combination of BVNS parameters. Preliminary results of applying BVNS with thus obtained parameters are competitive in comparison to the state-of-the-art methods from the literature.

This work has been funded by the Serbian Ministry of Education, Science and Technological Development, Agreement No. 451-03-9/2021-14/200029 and by the Science Fund of Republic of Serbia, under the project “Advanced Artificial Intelligence Techniques for Analysis and Design of System Components Based on Trustworthy BlockChain Technology (AI4TrustBC)”.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aloise, D., Caporossi, G., Hansen, P., Liberti, L., Perron, S., Ruiz, M.: Modularity maximization in networks by variable neighborhood search. Graph Partition. Graph Clust. 588, 113 (2012)

    Google Scholar 

  2. Bara’a, A.A., et al.: A review of heuristics and metaheuristics for community detection in complex networks: current usage, emerging development and future directions. Swarm Evol. Comput. 63, 100885 (2021)

    Article  Google Scholar 

  3. Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech: Theory Exp. 2008(10), P10008 (2008)

    Article  MATH  Google Scholar 

  4. Cai, Q., Gong, M., Shen, B., Ma, L., Jiao, L.: Discrete particle swarm optimization for identifying community structures in signed social networks. Neural Netw. 58, 4–13 (2014)

    Article  Google Scholar 

  5. Cai, Q., Ma, L., Gong, M., Tian, D.: A survey on network community detection based on evolutionary computation. Int. J. Bio-Inspired Comput. 8(2), 84–98 (2016)

    Article  Google Scholar 

  6. Csardi, G., Nepusz, T.: The Igraph software package for complex network research. InterJ. Complex Systems, 1695 (2006). https://igraph.org

  7. Danon, L., Diaz-Guilera, A., Duch, J., Arenas, A.: Comparing community structure identification. J. Stat. Mech: Theory Exp. 2005(09), P09008 (2005)

    Article  Google Scholar 

  8. Džamić, D., Aloise, D., Mladenović, N.: Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization. Ann. Oper. Res. 272(1), 273–287 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  9. Ghasabeh, A., Abadeh, M.S.: Community detection in social networks using a hybrid swarm intelligence approach. Int. J. Knowl. -Based Intell. Eng. Syst. 19(4), 255–267 (2015)

    Google Scholar 

  10. Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821–7826 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using networkx. In: Varoquaux, G., Vaught, T., Millman, J. (eds.) Proceedings of the 7th Python in Science Conference, pp. 11–15. Pasadena, CA USA (2008)

    Google Scholar 

  12. Hansen, P., Mladenović, N.: Variable neighborhood search. In: Martí, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, pp. 759–787. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-07124-4_19

    Chapter  Google Scholar 

  13. Hansen, P., Mladenović, N., Todosijević, R., Hanafi, S.: Variable neighborhood search: basics and variants. EURO J. Comput. Optimiz. 5(3), 423–454 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  14. Honghao, C., Zuren, F., Zhigang, R.: Community detection using ant colony optimization. In: 2013 IEEE Congress on Evolutionary Computation, pp. 3072–3078. IEEE (2013)

    Google Scholar 

  15. Javed, M.A., Younis, M.S., Latif, S., Qadir, J., Baig, A.: Community detection in networks: a multidisciplinary review. J. Netw. Comput. Appl. 108, 87–111 (2018)

    Article  Google Scholar 

  16. Leicht, E.A., Newman, M.E.J.: Community structure in directed networks. Phys. Rev. Lett. 100(11), 118703:1–4 (2008)

    Google Scholar 

  17. Leskovec, J., Lang, K.J., Mahoney, M.: Empirical comparison of algorithms for network community detection. In: Proceedings of the 19th International Conference on World Wide Web, pp. 631–640 (2010)

    Google Scholar 

  18. López-Ibáñez, M., Dubois-Lacoste, J., Cáceres, L.P., Birattari, M., Stützle, T.: The irace package: Iterated racing for automatic algorithm configuration. Oper. Res. Persp. 3, 43–58 (2016)

    MathSciNet  Google Scholar 

  19. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  20. Newman, M.E.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69(6), 066133 (2004)

    Article  Google Scholar 

  21. Newman, M.E.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74(3), 036104 (2006)

    Article  MathSciNet  Google Scholar 

  22. Pérez-Peló, S., Sánchez-Oro, J., Gonzalez-Pardo, A., Duarte, A.: On the analysis of the influence of the evaluation metric in community detection over social networks. Appl. Soft Comput. 112, 107838 (2021)

    Article  Google Scholar 

  23. Pérez-Peló, S., Sanchez-Oro, J., Martin-Santamaria, R., Duarte, A.: On the analysis of the influence of the evaluation metric in community detection over social networks. Electronics 8(1), 23 (2018)

    Article  Google Scholar 

  24. Srinivas, S., Rajendran, C.: Community detection and influential node identification in complex networks using mathematical programming. Expert Syst. Appl. 135, 296–312 (2019)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Djordje Jovanović .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jovanović, D., Davidović, T., Urošević, D., Krüger, T.J., Ramljak, D. (2023). Variable Neighborhood Search Approach to Community Detection Problem. In: Georgiev, I., Datcheva, M., Georgiev, K., Nikolov, G. (eds) Numerical Methods and Applications. NMA 2022. Lecture Notes in Computer Science, vol 13858. Springer, Cham. https://doi.org/10.1007/978-3-031-32412-3_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-32412-3_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-32411-6

  • Online ISBN: 978-3-031-32412-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics