skip to main content
Language:
Search Limited to: Search Limited to: Resource type Show Results with: Show Results with: Search type Index

A Comparative Analysis of Community Detection Algorithms on Artificial Networks

Scientific reports, 2016-08, Vol.6 (1), p.30750-30750, Article 30750 [Peer Reviewed Journal]

Copyright Nature Publishing Group Aug 2016 ;Copyright © 2016, The Author(s) 2016 The Author(s) ;ISSN: 2045-2322 ;EISSN: 2045-2322 ;DOI: 10.1038/srep30750 ;PMID: 27476470

Full text available

Citations Cited by
  • Title:
    A Comparative Analysis of Community Detection Algorithms on Artificial Networks
  • Author: Yang, Zhao ; Algesheimer, René ; Tessone, Claudio J
  • Subjects: Algorithms ; Comparative analysis
  • Is Part Of: Scientific reports, 2016-08, Vol.6 (1), p.30750-30750, Article 30750
  • Description: Many community detection algorithms have been developed to uncover the mesoscopic properties of complex networks. However how good an algorithm is, in terms of accuracy and computing time, remains still open. Testing algorithms on real-world network has certain restrictions which made their insights potentially biased: the networks are usually small, and the underlying communities are not defined objectively. In this study, we employ the Lancichinetti-Fortunato-Radicchi benchmark graph to test eight state-of-the-art algorithms. We quantify the accuracy using complementary measures and algorithms' computing time. Based on simple network properties and the aforementioned results, we provide guidelines that help to choose the most adequate community detection algorithm for a given network. Moreover, these rules allow uncovering limitations in the use of specific algorithms given macroscopic network properties. Our contribution is threefold: firstly, we provide actual techniques to determine which is the most suited algorithm in most circumstances based on observable properties of the network under consideration. Secondly, we use the mixing parameter as an easily measurable indicator of finding the ranges of reliability of the different algorithms. Finally, we study the dependency with network size focusing on both the algorithm's predicting power and the effective computing time.
  • Publisher: England: Nature Publishing Group
  • Language: English
  • Identifier: ISSN: 2045-2322
    EISSN: 2045-2322
    DOI: 10.1038/srep30750
    PMID: 27476470
  • Source: PubMed Central
    ProQuest Central
    DOAJ Directory of Open Access Journals
Back to results list
INSPIRE LIBRARY - TON DUC THANG UNIVERSITY (84-028) 37 755 057 Feedback
19 Nguyen Huu Tho St. Dist.7, HCM thuvien@tdtu.edu.vn

Copyright © 2017 INSPIRE LIBRARY - TON DUC THANG UNIVERSITY

Searching Remote Databases, Please Wait