Three-way decision based overlapping community detection

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The three-way decision based overlapping community detection algorithm (OCDBTWD) divides the vesting relationship between communities into three types: completely belong relation, completely not belong relation and incompletely belong relation, and it uses the positive domain, negative domain and boundary domain to describe those vesting relationships respectively. OCDBTWD defines the similarity between communities to quantify the conditional probability when two communities have the vesting relationship, and uses the increment values of extended modularity to reflect the inclusion ratio thresholds. OCDBTWD uses the three-way decision to decide the vesting relationship between communities to guide the merger of them. When the vesting relationship between communities is incompletely belong relation, then the overlapping vertex detection algorithm (OVDA) is proposed to detect overlapping vertices. OCDBTWD has been tested on both synthetic and real world networks and also compared with other algorithms. The experiments demonstrate its feasibility and efficiency. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Liu, Y., Pan, L., Jia, X., Wang, C., & Xie, J. (2013). Three-way decision based overlapping community detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8171 LNAI, pp. 279–290). https://doi.org/10.1007/978-3-642-41299-8_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free