IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i4p367-d498287.html
   My bibliography  Save this article

ConvGraph: Community Detection of Homogeneous Relationships in Weighted Graphs

Author

Listed:
  • Héctor Muñoz

    (Decision Analysis and Statistics Group, Departamento de Inteligencia Artificial, Universidad Politécnica de Madrid, 28040 Madrid, Spain
    These authors contributed equally to this work.)

  • Eloy Vicente

    (Decision Analysis and Statistics Group, Departamento de Inteligencia Artificial, Universidad Politécnica de Madrid, 28040 Madrid, Spain
    These authors contributed equally to this work.)

  • Ignacio González

    (Decision Analysis and Statistics Group, Departamento de Inteligencia Artificial, Universidad Politécnica de Madrid, 28040 Madrid, Spain
    These authors contributed equally to this work.)

  • Alfonso Mateos

    (Decision Analysis and Statistics Group, Departamento de Inteligencia Artificial, Universidad Politécnica de Madrid, 28040 Madrid, Spain
    These authors contributed equally to this work.)

  • Antonio Jiménez-Martín

    (Decision Analysis and Statistics Group, Departamento de Inteligencia Artificial, Universidad Politécnica de Madrid, 28040 Madrid, Spain
    These authors contributed equally to this work.)

Abstract

This paper proposes a new method, ConvGraph, to detect communities in highly cohesive and isolated weighted graphs, where the sum of the weights is significantly higher inside than outside the communities. The method starts by transforming the original graph into a line graph to apply a convolution, a common technique in the computer vision field. Although this technique was originally conceived to detect the optimum edge in images, it is used here to detect the optimum edges in communities identified by their weights rather than by their topology. The method includes a final refinement step applied to communities with a high vertex density that could not be detected in the first phase. The proposed algorithm was tested on a series of highly cohesive and isolated synthetic graphs and on a real-world export graph, performing well in both cases.

Suggested Citation

  • Héctor Muñoz & Eloy Vicente & Ignacio González & Alfonso Mateos & Antonio Jiménez-Martín, 2021. "ConvGraph: Community Detection of Homogeneous Relationships in Weighted Graphs," Mathematics, MDPI, vol. 9(4), pages 1-18, February.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:4:p:367-:d:498287
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/4/367/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/4/367/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Huang, Jianbin & Sun, Heli & Han, Jiawei & Feng, Boqin, 2011. "Density-based shrinkage for revealing hierarchical and overlapping community structure in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(11), pages 2160-2171.
    2. repec:cup:apsrev:v:21:y:1927:i:03:p:619-627_02 is not listed on IDEAS
    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. Wu, Jianshe & Li, Xiaoxiao & Jiao, Licheng & Wang, Xiaohua & Sun, Bo, 2013. "Minimum spanning trees for community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(9), pages 2265-2277.
    2. Ding, Jingyi & Jiao, Licheng & Wu, Jianshe & Hou, Yunting & Qi, Yutao, 2015. "Prediction of missing links based on multi-resolution community division," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 417(C), pages 76-85.
    3. Zhou, Kuang & Martin, Arnaud & Pan, Quan, 2015. "A similarity-based community detection method with multiple prototype representation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 438(C), pages 519-531.
    4. Gong, Maoguo & Liu, Jie & Ma, Lijia & Cai, Qing & Jiao, Licheng, 2014. "Novel heuristic density-based method for community detection in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 403(C), pages 71-84.
    5. Garza, Sara E. & Schaeffer, Satu Elisa, 2019. "Community detection with the Label Propagation Algorithm: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 534(C).
    6. Wu, Jianshe & Hou, Yunting & Jiao, Yang & Li, Yong & Li, Xiaoxiao & Jiao, Licheng, 2015. "Density shrinking algorithm for community detection with path based similarity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 433(C), pages 218-228.
    7. Mu, Caihong & Liu, Yong & Liu, Yi & Wu, Jianshe & Jiao, Licheng, 2014. "Two-stage algorithm using influence coefficient for detecting the hierarchical, non-overlapping and overlapping community structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 408(C), pages 47-61.

    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:gam:jmathe:v:9:y:2021:i:4:p:367-:d:498287. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.