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.
Zhongzhi Shi; David Leake; Sunil Vadera. 7th International Conference on Intelligent Information Processing (IIP), Oct 2012, Guilin, China. Springer, IFIP Advances in Information and Communication Technology, AICT-385, pp.248-257, 2012, Intelligent Information Processing VI. 〈10.1007/978-3-642-32891-6_32〉
https://hal.inria.fr/hal-01524972
Contributeur : Hal Ifip
<>
Soumis le : vendredi 19 mai 2017 - 10:43:29
Dernière modification le : vendredi 19 mai 2017 - 10:45:56
Document(s) archivé(s) le : mardi 22 août 2017 - 01:00:40
Guoyong Cai, Ruili Wang, Guobin Liu. Hierarchical Overlapping Community Discovery Algorithm Based on Node Purity. Zhongzhi Shi; David Leake; Sunil Vadera. 7th International Conference on Intelligent Information Processing (IIP), Oct 2012, Guilin, China. Springer, IFIP Advances in Information and Communication Technology, AICT-385, pp.248-257, 2012, Intelligent Information Processing VI. 〈10.1007/978-3-642-32891-6_32〉. 〈hal-01524972〉
