Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/32903
Title: Seeding the kernels in graphs : toward multi-resolution community analysis
Authors: Zhang, J
Zhang, K
Xu, XK
Tse, CK 
Small, M
Issue Date: 2009
Source: New journal of physics, 2009, v. 11, 113003 How to cite?
Journal: New Journal of Physics 
Abstract: Current endeavors in community detection suffer from the resolution limit problem and can be quite expensive for large networks, especially those based on optimization schemes. We propose a conceptually different approach for multi-resolution community detection, by introducing the kernels from statistical literature into the graph, which mimic the node interaction that decays locally with the geodesic distance. The modular structure naturally arises as the patterns inherent in the interaction landscape, which can be easily identified by the hill climbing process. The range of node interaction, and henceforth the resolution of community detection, is controlled via tuning the kernel bandwidth in a systematic way. Our approach is computationally efficient and its effectiveness is demonstrated using both synthetic and real networks with multiscale structures.
URI: http://hdl.handle.net/10397/32903
ISSN: 1367-2630
DOI: 10.1088/1367-2630/11/11/113003
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

25
Last Week
0
Last month
0
Citations as of Oct 7, 2017

WEB OF SCIENCETM
Citations

27
Last Week
0
Last month
0
Citations as of Oct 16, 2017

Page view(s)

35
Last Week
1
Last month
Checked on Oct 16, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.