Hierarchical overlapping community discovery algorithm based on node purity

Guoyong Cai, Ruili Wang, Guobin Liu

Research output: Chapter in Book/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

A hierarchical overlapping community discovery algorithm based on node purity (OCFN-PN) is proposed in the paper. This algorithm chooses the maximal relative centrality as the initial community, which solves the problem of inconsistent results of the community discovery algorithm based on fitness resulting from randomly choosing nodes. Before optimizing and merging communities, the community overlapping degree and the joint-union should be calculated so that the problems of twice merging can be solved. Research results show that this algorithm has lower time complexity and the communities obtained by this algorithm are more suitable for real world networks.

Original languageEnglish
Title of host publicationIntelligent Information Processing VI - 7th IFIP TC 12 International Conference, IIP 2012, Proceedings
Pages248-257
Number of pages10
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event7th IFIP International Conference on Intelligent Information Processing, IIP 2012 - Guilin, China
Duration: 12 Oct 201215 Oct 2012

Publication series

NameIFIP Advances in Information and Communication Technology
Volume385 AICT
ISSN (Print)1868-4238

Conference

Conference7th IFIP International Conference on Intelligent Information Processing, IIP 2012
Country/TerritoryChina
CityGuilin
Period12/10/1215/10/12

Keywords

  • hierarchical overlapping community discovery algorithm
  • node purity
  • overlapping degree
  • relative centrality
  • the joint-union

ASJC Scopus subject areas

  • Information Systems and Management

Fingerprint

Dive into the research topics of 'Hierarchical overlapping community discovery algorithm based on node purity'. Together they form a unique fingerprint.

Cite this