A community detecting algorithm based on granular computing

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

Abstract

Detecting the community structure of social network is really a very challenging and promising research in the world today.Granular Computing,which can simplify the solution of problem by generating granules and implementation in different granularity spaces, is a kind of intelligent information processing model to simulate the human thinking. In this paper, a model of mining community structure based on granular computing is proposed through improving the similarity between nodes, that is, to design a corresponding mining algorithm by decomposing the problem in different granularity spaces so as to realize the structure detecting. The experimental results on three classic data sets show that the mining algorithm presented in this paper is reasonable.

Cite

CITATION STYLE

APA

Liu, L., Qiu, T., Bai, X., & Lin, Z. (2014). A community detecting algorithm based on granular computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8818, pp. 272–284). Springer Verlag. https://doi.org/10.1007/978-3-319-11740-9_26

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