Skip to main content
SpringerLink
Log in

BVNS for Overlapping Community Detection

  • Conference paper
  • First Online:
Variable Neighborhood Search (ICVNS 2022)

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

Included in the following conference series:

  • 115 Accesses

Abstract

Nowadays, social networks are one of the most important sources of information available on the Internet, since new users and relationships between them emerge every day in this type of networks. For this reason, it is important to have procedures and mechanisms to obtain, process and analyze the information extracted from them and transform it into useful data. This situation has given rise to new hard combinatorial optimization problems related to social networks, such as influence analysis, sentimental analysis or polarization. All these topics are grouped under the research field of Social Networks Analysis (SNA). In this paper, we focus on one of these topics: the Community Detection Problem (CDP). Specifically, we will deal with a variant of the CDP known as the Overlapping Community Detection Problem (OCDP), in which the same user can be assigned to more than one community simultaneously, which cannot occur in the classical Community Detection Problem. The problem is approached from a heuristic point of view, applying a Greedy Randomized Adaptive Search Procedure (GRASP) combined with a Basic Variable Neighborhood Search (BVNS) algorithm. The proposal is compared with the best method found in the literature, a Density Peaks based algorithm. Synthetic instances are used to evaluate the performance of the proposal. To analyze the quality of the obtained solutions, an evaluation metric that has been adapted from the well-known modularity metric has been used: the overlapping modularity.

This research was funded by “Ministerio de Ciencia, Innovación y Universidades” under grant ref. PGC2018-095322-B-C22, “Comunidad de Madrid” and “Fondos Estructurales” of European Union with grant refs. S2018/TCS-4566, Y2018/EMT-5062.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.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. Camacho, D., Panizo-LLedot, A., Bello-Orgaz, G., Gonzalez-Pardo, A., Cambria, E.: The four dimensions of social network analysis: an overview of research methods, applications, and software tools. Inf. Fusion 63, 88–120 (2020)

    Article  Google Scholar 

  2. Casas-Martínez, P., Casado-Ceballos, A., Sánchez-Oro, J., Pardo, E.G.: Multi-objective grasp for maximizing diversity. Electronics 10(11), 1232 (2021)

    Article  Google Scholar 

  3. Duarte, A., Escudero, L.F., Martí, R., Mladenovic, N., Pantrigo, J.J., Sánchez-Oro, J.: Variable neighborhood search for the vertex separation problem. Comput. Oper. Res. 39(12), 3247–3255 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  4. Duarte, A., Sánchez-Oro, J., Mladenović, N., Todosijević, R.: Variable neighborhood descent. Handbook of Heuristics, pp. 341–367 (2018)

    Google Scholar 

  5. Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8(2), 67–71 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  6. Feo, T.A., Resende, M.G.C., Smith, S.H.: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set. Operations Research 42(5), 860–878 (1994)

    Article  MATH  Google Scholar 

  7. Fernandez, M., Gonzalez-Pardo, A., Alani, H.: Radicalisation influence in social media. J. Web Sci. 6 (2019)

    Google Scholar 

  8. García-López, F., Melián-Batista, B., Moreno-Pérez, J.A., Moreno-Vega, J.M.: The parallel variable neighborhood search for the p-median problem. J. Heuristics 8(3), 375–388 (2002)

    Article  MATH  Google Scholar 

  9. Gregory, S.: Finding overlapping communities in networks by label propagation. New J. Phys. 12(10), 103018 (2010)

    Article  MATH  Google Scholar 

  10. Hansen, P., Mladenović, N., Brimberg, J., Pérez, J.A.M.: Variable neighborhood search. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of Metaheuristics. ISORMS, vol. 272, pp. 57–97. Springer, Cham (2019). https://doi.org/10.1007/978-3-319-91086-4_3

    Chapter  Google Scholar 

  11. Hansen, P., Mladenović, N., Perez-Britos, D.: Variable neighborhood decomposition search. J. Heuristics 7(4), 335–350 (2001). https://doi.org/10.1023/A:1011336210885

    Article  MATH  Google Scholar 

  12. Herrán, A., Colmenar, M.J., Duarte, A.: A variable neighborhood search approach for the vertex bisection problem. Inf. Sci. 476, 1–18 (2019). https://doi.org/10.1016/J.INS.2018.09.063

    Article  MATH  Google Scholar 

  13. Jaki, S., Smedt, T.D.: Right-wing german hate speech on twitter: Analysis and automatic detection. CoRR arXiv:abs/1910.07518 (2019)

  14. Kumpula, J.M., Kivelä, M., Kaski, K., Saramäki, J.: Sequential algorithm for fast clique percolation. Phys. Rev. E 78, 026109 (2008)

    Article  Google Scholar 

  15. Lázár, A., Abel, D., Vicsek, T.: Modularity measure of networks with overlapping communities. EPL (Europhysics Letters) 90(1), 18001 (2010)

    Article  Google Scholar 

  16. Lozano-Osorio, I., Martínez-Gavara, A., Martí, R., Duarte, A.: Max-min dispersion with capacity and cost for a practical location problem. Expert Syst. Appl. 200, 116899 (2022)

    Article  Google Scholar 

  17. Luo, W., Zhang, D., Jiang, H., Ni, L., Hu, Y.: Local community detection with the dynamic membership function. IEEE Trans. Fuzzy Syst. 26(5), 3136–3150 (2018)

    Article  Google Scholar 

  18. Martin-Santamaria, R., Sánchez-Oro, J., Pérez-Peló, S., Duarte, A.: Strategic oscillation for the balanced minimum sum-of-squares clustering problem. Inf. Sci. 585, 529–542 (2022)

    Article  Google Scholar 

  19. Newman, M.E.J.: Modularity and community structure in networks. Proc. Natl. Acad. of Sci. 103(23), 8577–8582 (2006)

    Article  Google Scholar 

  20. Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Info Lab (1999)

    Google Scholar 

  21. Pérez-Peló, S., Sánchez-Oro, J., Duarte, A.: Detecting weak points in networks using variable neighborhood search. In: Sifaleras, A., Salhi, S., Brimberg, J. (eds.) ICVNS 2018. LNCS, vol. 11328, pp. 141–151. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-15843-9_12

    Chapter  Google Scholar 

  22. Pérez-Peló, S., Sánchez-Oro, J., Gonzalez-Pardo, A., Duarte, A.: A fast variable neighborhood search approach for multi-objective community detection. Appl. Soft Comput. 112, 107838 (2021)

    Article  Google Scholar 

  23. Rodriguez, A., Laio, A.: Clustering by fast search and find of density peaks. Science 344(6191), 1492–1496 (2014). https://doi.org/10.1126/science.1242072

    Article  Google Scholar 

  24. Sánchez-Oro, J., Martínez-Gavara, A., Laguna, M., Duarte, A., Martí, R.: Variable neighborhood descent for the incremental graph drawing. Electron. Notes Discrete Math. 58, 183–190 (2017). https://doi.org/10.1016/j.endm.2017.03.024, http://www.sciencedirect.com/science/article/pii/S1571065317300604. 4th International Conference on Variable Neighborhood Search

  25. Sánchez-Oro, J., López-Sánchez, A.D., Colmenar, M.J.: A general variable neighborhood search for solving the multi-objective open vehicle routing problem. J. Heuristics 1–30 (2017). https://doi.org/10.1007/s10732-017-9363-8

  26. Swani, K., Milne, G.R., Brown, B.P., Assaf, A.G., Donthu, N.: What messages to post? evaluating the popularity of social media communications in business versus consumer markets. Ind. Mark. Manag. 62, 77–87 (2017)

    Article  Google Scholar 

  27. Whang, J.J., Gleich, D.F., Dhillon, I.S.: Overlapping community detection using neighborhood-inflated seed expansion. IEEE Trans. Knowl. Data Eng. 28(5), 1272–1284 (2016)

    Article  Google Scholar 

  28. Xie, J., Kelley, S., Szymanski, B.K.: Overlapping community detection in networks: The state-of-the-art and comparative study. ACM Comput. Surv. 45(4) (2013). https://doi.org/10.1145/2501654.2501657

  29. Xu, M., Li, Y., Li, R., Zou, F., Gu, X.: EADP: an extended adaptive density peaks clustering for overlapping community detection in social networks. Neurocomputing 337, 287–302 (2019)

    Article  Google Scholar 

  30. Yang, J., Leskovec, J.: Overlapping community detection at scale: a nonnegative matrix factorization approach. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, p. 587–596 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Computer Science, Universidad Rey Juan Carlos, 28933, Móstoles, Madrid, Spain

    Sergio Pérez-Peló, Jesús Sánchez-Oro, Antonio González-Pardo & Abraham Duarte

Authors
  1. Sergio Pérez-Peló
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jesús Sánchez-Oro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Antonio González-Pardo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Abraham Duarte
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sergio Pérez-Peló .

Editor information

Editors and Affiliations

  1. Khalifa University, Abu Dhabi, United Arab Emirates

    Andrei Sleptchenko

  2. University of Macedonia, Thessaloniki, Greece

    Angelo Sifaleras

  3. HEC Montréal, Montréal, QC, Canada

    Pierre Hansen

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

Pérez-Peló, S., Sánchez-Oro, J., González-Pardo, A., Duarte, A. (2023). BVNS for Overlapping Community Detection. In: Sleptchenko, A., Sifaleras, A., Hansen, P. (eds) Variable Neighborhood Search. ICVNS 2022. Lecture Notes in Computer Science, vol 13863. Springer, Cham. https://doi.org/10.1007/978-3-031-34500-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-34500-5_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-34499-2

  • Online ISBN: 978-3-031-34500-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation