Detecting community structure in networks by representative energy

Front. Comput. Sci. ›› 2009, Vol. 3 ›› Issue (3) : 366 -372.

PDF (948KB)
Front. Comput. Sci. ›› 2009, Vol. 3 ›› Issue (3) : 366 -372. DOI: 10.1007/s11704-009-0042-2
Research articles

Detecting community structure in networks by representative energy

Author information +
History +
PDF (948KB)

Abstract

Network community has attractedmuch attention recently, but the accuracy and efficiency in finding a community structure is limited by the lower resolution of modularity. This paper presents a new method of detecting community based on representative energy. The method can divide the communities and find the representative of community simultaneously. The communities of network emerges during competing for the representative among nodes in network, thus we can sketch structure of the whole network. Without the optimizing by modularity, the community of network emerges with competing for representative among those nodes. To obtain the proximate relationships among nodes, we map the nodes into a spectral matrix. Then the top eigenvectors are weighted according to their contributions to find the representative node of a community. Experimental results show that the method is effective in detecting communities of networks.

Keywords

network community / community detection / representative energy / spectral analysis / weighted eigenvector

Cite this article

Download citation ▾
null. Detecting community structure in networks by representative energy. Front. Comput. Sci., 2009, 3(3): 366-372 DOI:10.1007/s11704-009-0042-2

登录浏览全文

4963

注册一个新账户 忘记密码

References

AI Summary AI Mindmap
PDF (948KB)

783

Accesses

0

Citation

Detail

Sections
Recommended

AI思维导图

/