A Node Importance Based Label Propagation Approach for Community Detection

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

Abstract

Community detection provides an important tool to get a deeper insight about the various existing real-world social networks. A large amount of algorithms for detecting community in social networks have been developed in recent years. Most of these algorithms have high computational complex and expensive time-consuming which result that they are not scalable for large-scale networks, and some of them cannot find stable communities. In this paper, we take the importance of node into consideration and give a score to quantize the importance of nodes. Based on this importance quantification, we propose a novel node importance based label propagation algorithm for community detection. We implement our algorithm and other compared algorithms on several benchmark networks. And the experimental results show that our algorithm performs better than others. © Springer-Verlag Berlin Heidelberg 2014.

Cite

CITATION STYLE

APA

He, M., Leng, M., Li, F., Yao, Y., & Chen, X. (2014). A Node Importance Based Label Propagation Approach for Community Detection. In Advances in Intelligent Systems and Computing (Vol. 214, pp. 249–257). Springer Verlag. https://doi.org/10.1007/978-3-642-37832-4_23

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