Please use this identifier to cite or link to this item:
|Title:||A spectral algorithm of community identification|
|Authors:||Gong, X. |
|Source:||Gong, X., Li, K., Li, M., Lai, C.-H. (2013-02). A spectral algorithm of community identification. EPL 101 (4) : -. ScholarBank@NUS Repository. https://doi.org/101/48001|
|Abstract:||A novel spectral algorithm utilizing multiple eigenvectors is proposed to identify the communities in networks based on the modularity Q. We investigate the reduced modularity on low-rank approximations of the original modularity matrix consisting of leading eigenvectors. By exploiting the rotational invariance of the reduced modularity, near-optimal partitions of the network can be found. This approach generalizes the conventional spectral network partitioning algorithms which usually use only one eigenvector, and promises better results because more spectral information is used. The algorithm shows excellent performance on various real-world and computer-generated benchmark networks, and outperforms the most known community detection methods. Copyright © EPLA, 2013.|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
WEB OF SCIENCETM
checked on Jan 16, 2018
checked on Feb 18, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.