跳到主要导航 跳到搜索 跳到主要内容

GFN: An improved Fast-Newman clustering algorithm in complex networks based on the group concept

  • Beihang University

科研成果: 期刊稿件文章同行评审

摘要

To deal with the problem that the object function of existing optimized clustering algorithms are biased, which may affect the accuracy of the clustering, the concept of groups was proposed in this paper, to model the local context of nodes during the clustering process. An improved modularity function based on the concept of groups was given, and the GFN, a clustering algorithm derived from the well-known Fast-Newman algorithm. Experiments on different datasets showed that the new method increased the clustering accuracy by 70% on average compared with the original version, proving that the group concept is significant in depicting the actual clustering structures in real networks.

源语言英语
页(从-至)1016-1023
页数8
期刊Gaojishu Tongxin/Chinese High Technology Letters
23
10
DOI
出版状态已出版 - 10月 2013

指纹

探究 'GFN: An improved Fast-Newman clustering algorithm in complex networks based on the group concept' 的科研主题。它们共同构成独一无二的指纹。

引用此