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

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)1016-1023
Number of pages8
JournalGaojishu Tongxin/Chinese High Technology Letters
Volume23
Issue number10
DOIs
StatePublished - Oct 2013

Keywords

  • Clustering algorithm
  • Complex network
  • Fast-Newman (FN) algorithm
  • Group
  • Modularity evaluation function

Fingerprint

Dive into the research topics of 'GFN: An improved Fast-Newman clustering algorithm in complex networks based on the group concept'. Together they form a unique fingerprint.

Cite this