期刊
PHYSICAL REVIEW E
卷 86, 期 4, 页码 -出版社
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevE.86.041120
关键词
-
资金
- NSF [DMS-1007219]
- Direct For Mathematical & Physical Scien [1007219] Funding Source: National Science Foundation
- Division Of Mathematical Sciences [1007219] Funding Source: National Science Foundation
We introduce a between-ness-based distance metric to extract local and global information for each pair of nodes (or vertices used interchangeably) located in a binary network. Since this distance then superimposes a weighted graph upon such a binary network, a multiscale clustering mechanism, called data cloud geometry, is applicable to discover hierarchical communities within a binary network. This approach resolves many shortcomings of community finding approaches, which are primarily based on modularity optimization. Using several contrived and real binary networks, our community hierarchies compare favorably with results derived from a recently proposed approach based on time-scale differences of random walks and has already demonstrated significant improvements over module-based approaches, especially on the multiscale and the determination of the number of communities.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据