Hierarchical Overlapping Community Discovery Algorithm Based on Node Purity - Intelligent Information Processing VI Access content directly
Conference Papers Year : 2012

Hierarchical Overlapping Community Discovery Algorithm Based on Node Purity

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.
Fichier principal
Vignette du fichier
978-3-642-32891-6_32_Chapter.pdf (258.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01524972 , version 1 (19-05-2017)

Licence

Attribution

Identifiers

Cite

Guoyong Cai, Ruili Wang, Guobin Liu. Hierarchical Overlapping Community Discovery Algorithm Based on Node Purity. 7th International Conference on Intelligent Information Processing (IIP), Oct 2012, Guilin, China. pp.248-257, ⟨10.1007/978-3-642-32891-6_32⟩. ⟨hal-01524972⟩
48 View
87 Download

Altmetric

Share

Gmail Facebook X LinkedIn More