Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-01524972
Contributor : Hal Ifip <>
Submitted on : Friday, May 19, 2017 - 10:43:29 AM
Last modification on : Thursday, March 5, 2020 - 5:41:53 PM
Long-term archiving on: : Tuesday, August 22, 2017 - 1:00:40 AM

File

978-3-642-32891-6_32_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

113

Files downloads

257