Please use this identifier to cite or link to this item:
|Title:||Efficient algorithm based on neighborhood overlap for community identification in complex networks||Authors:||Li, K.
|Issue Date:||15-Feb-2012||Citation:||Li, K., Gong, X., Guan, S., Lai, C.-H. (2012-02-15). Efficient algorithm based on neighborhood overlap for community identification in complex networks. Physica A: Statistical Mechanics and its Applications 391 (4) : 1788-1796. ScholarBank@NUS Repository. https://doi.org/10.1016/j.physa.2011.09.027||Abstract:||Community structure is an important feature in many real-world networks. Many methods and algorithms for identifying communities have been proposed and have attracted great attention in recent years. In this paper, we present a new approach for discovering the community structure in networks. The novelty is that the algorithm uses the strength of the ties for sorting out nodes into communities. More specifically, we use the principle of weak ties hypothesis to determine to what community the node belongs. The advantages of this method are its simplicity, accuracy, and low computational cost. We demonstrate the effectiveness and efficiency of our algorithm both on real-world networks and on benchmark graphs. We also show that the distribution of link strength can give a general view of the basic structure information of graphs. © 2011 Elsevier B.V. All rights reserved.||Source Title:||Physica A: Statistical Mechanics and its Applications||URI:||http://scholarbank.nus.edu.sg/handle/10635/52898||ISSN:||03784371||DOI:||10.1016/j.physa.2011.09.027|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 6, 2019
WEB OF SCIENCETM
checked on Oct 30, 2019
checked on Oct 28, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.