ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • Maximal neighbor similarity reveals real communities in networks [Elektronski vir]
    Rizman Žalik, Krista
    An important problem in the analysis of network data is the detection of groups of densely interconnected nodes also called modules or communities. Community structure reveals functions and ... organizations of networks. Currently used algorithms for community detection in large-scale realworld networks are computationally expensive or require a priori information such as the number or sizes of communities or are not able to give the same resulting partition in multiple runs. In this paper we investigate a simple and fast algorithm that uses the network structure alone and requires neither optimization of pre-defined objective function nor information about number of communities. We propose a bottom up community detection algorithm in which starting from communities consisting of adjacent pairs of nodes and their maximal similar neighbors we find real communities. We show that the overall advantage of the proposed algorithm compared to the other community detection algorithms is its simple nature, low computational cost and its very high accuracy in detection communities of different sizes also in networks with blurred modularity structure consisting of poorly separated communities. All communities identified by the proposed method for facebook network and E-Coli transcriptional regulatory network have strong structural and functional coherence.
    Source: Scientific reports [Elektronski vir]. - ISSN 2045-2322 (Vol. 5, art. no. 18374, 2015, str. 1-10)
    Type of material - e-article
    Publish date - 2015
    Language - english
    COBISS.SI-ID - 21987592

    Link(s):

    Digital Library of the University of Maribor – DLUM

Shelf entry