IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v44y2022i4d10.1007_s10878-021-00794-2.html
   My bibliography  Save this article

A new metric to compare local community detection algorithms in social networks using geodesic distance

Author

Listed:
  • Sahar Bakhtar

    (Concordia University)

  • Hovhannes A. Harutyunyan

    (Concordia University)

Abstract

Community detection problem is a well-studied problem in social networks. One major question to this problem is how to evaluate different community detection algorithms. This issue is even more challenging in the problem of local community detection where only local information of communities is available. Normally, two community detection algorithms are compared by evaluating their resulted communities. In this regard, the most widely used technique to evaluate the quality of communities is to compare them with the ground-truth communities. However, for a large number of networks, the ground-truth communities are not known. As a result, it is necessary to have a comprehensive metric to evaluate the quality of communities. In this study, improving a local quality metric, a number of local community detection algorithms are compared through assessing their detected communities. Furthermore, using some small graphs as example communities, some drawbacks of a number of existing local metrics are discussed. Finally, according to the experimental results, it is illustrated that the local community detection algorithms are fairly compared using the proposed metric, GDM. It is also shown that the judgment of GDM is almost the same as that of F1-score, i.e. the metric which compares the community with its ground-truth community.

Suggested Citation

  • Sahar Bakhtar & Hovhannes A. Harutyunyan, 2022. "A new metric to compare local community detection algorithms in social networks using geodesic distance," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2809-2831, November.
    • Handle: RePEc:spr:jcomop:v:44:y:2022:i:4:d:10.1007_s10878-021-00794-2
    DOI: 10.1007/s10878-021-00794-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-021-00794-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-021-00794-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Liu, Saisai & Xia, Zhengyou, 2020. "A two-stage BFS local community detection algorithm based on node transfer similarity and Local Clustering Coefficient," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 537(C).
    2. Gao, Yang & Zhang, Hongli & Zhang, Yue, 2019. "Overlapping community detection based on conductance optimization in large-scale networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 522(C), pages 69-79.
    3. Li, Xuequn & Zhou, Shuming & Liu, Jiafei & Lian, Guanqin & Chen, Gaolin & Lin, Chen-Wan, 2019. "Communities detection in social network based on local edge centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 531(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Chagas, Guilherme Oliveira & Lorena, Luiz Antonio Nogueira & dos Santos, Rafael Duarte Coelho, 2022. "A hybrid heuristic for overlapping community detection through the conductance minimization," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 592(C).
    2. Manuel Guerrero & Consolación Gil & Francisco G. Montoya & Alfredo Alcayde & Raúl Baños, 2020. "Multi-Objective Evolutionary Algorithms to Find Community Structures in Large Networks," Mathematics, MDPI, vol. 8(11), pages 1-18, November.
    3. Aghaalizadeh, Saeid & Afshord, Saeid Taghavi & Bouyer, Asgarali & Anari, Babak, 2021. "A three-stage algorithm for local community detection based on the high node importance ranking in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 563(C).
    4. Shang, Ronghua & Zhang, Weitong & Zhang, Jingwen & Feng, Jie & Jiao, Licheng, 2022. "Local community detection based on higher-order structure and edge information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 587(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:44:y:2022:i:4:d:10.1007_s10878-021-00794-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.