• DocumentCode
    3244434
  • Title

    A New Efficient Algorithm for Detecting Communities in Complex Networks

  • Author

    Wan, Ying ; Chen, Duanbing ; Fu, Yan

  • Author_Institution
    Sch. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu
  • fYear
    2008
  • fDate
    18-21 Oct. 2008
  • Firstpage
    281
  • Lastpage
    286
  • Abstract
    In this paper, we propose a new efficient algorithm which makes a good thing out of the betweenness centrality and the local information to detect community structures in complex networks. When being tested on some typical real world networks, our algorithm demonstrates excellent community partition results and very fast processing performance, much faster than the existing classical community detecting algorithms.
  • Keywords
    computer networks; social networking (online); complex networks; detect community structure detection; Clustering algorithms; Communities; Complex networks; Computer science; Parallel processing; Partitioning algorithms; Testing; betweenness centrality; community structures; complex networks; local information;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network and Parallel Computing, 2008. NPC 2008. IFIP International Conference on
  • Conference_Location
    Shanghai
  • Print_ISBN
    978-0-7695-3354-4
  • Type

    conf

  • DOI
    10.1109/NPC.2008.28
  • Filename
    4663337
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3244434