Using coalitional games to detect communities in social networks

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

Abstract

The community detection in social networks is important to understand the structural and functional properties of networks. In this paper we propose a coalitional game model for community detection in social networks, and use the Shapley Value in coalitional games to evaluate each individual's contribution to the closeness of connection. We then develop an iterative formula for computing the Shapley Value to improve the computation efficiency. We further propose a hierarchical clustering algorithm GAMEHC to detect communities in social networks. The effectiveness of our methods is verified by preliminary experimental result. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Zhou, L., Cheng, C., Lü, K., & Chen, H. (2013). Using coalitional games to detect communities in social networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7923 LNCS, pp. 326–331). Springer Verlag. https://doi.org/10.1007/978-3-642-38562-9_33

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