IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v469y2017icp342-352.html
   My bibliography  Save this article

Deep community detection in topologically incomplete networks

Author

Listed:
  • Xin, Xin
  • Wang, Chaokun
  • Ying, Xiang
  • Wang, Boyang

Abstract

In this paper, we consider the problem of detecting communities in topologically incomplete networks (TIN), which are usually observed from real-world networks and where some edges are missing. Existing approaches to community detection always consider the input network as connected. However, more or less, even nearly all, edges are missing in real-world applications, e.g. the protein–protein interaction networks. Clearly, it is a big challenge to effectively detect communities in these observed TIN.

Suggested Citation

  • Xin, Xin & Wang, Chaokun & Ying, Xiang & Wang, Boyang, 2017. "Deep community detection in topologically incomplete networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 469(C), pages 342-352.
    • Handle: RePEc:eee:phsmap:v:469:y:2017:i:c:p:342-352
    DOI: 10.1016/j.physa.2016.11.029
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437116308342
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2016.11.029?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. Sun, Peng Gang, 2015. "Community detection by fuzzy clustering," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 408-416.
    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. Dušan Džamić & Daniel Aloise & Nenad Mladenović, 2019. "Ascent–descent variable neighborhood decomposition search for community detection by modularity maximization," Annals of Operations Research, Springer, vol. 272(1), pages 273-287, January.
    2. Deng, Zheng-Hong & Qiao, Hong-Hai & Song, Qun & Gao, Li, 2019. "A complex network community detection algorithm based on label propagation and fuzzy C-means," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 519(C), pages 217-226.

    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:eee:phsmap:v:469:y:2017:i:c:p:342-352. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.