Abstract
The attribute information of individuals, such as occupation, skill, faith, hobbies and interests, etc, and the structure information amongst individuals, such as mutual relationships between individuals, are two key aspects of information that are used to study individuals and communities in social networks. Considering only the attribute information or the structure relationship alone is insufficient for determining meaningful communities. In this paper, we report an on-going study, we propose an approach that incorporates the structure information of a network and the attribute information of individuals by cooperative games, and game theory is introduced to support strategic decision making in deciding how to recognize communities in social networks, such networks are featured by large number of members, dynamic and with varied ways of connections. This approach provides a model to rationally and logically detect communities in social networks. The Shapley Value in cooperative games is adopted to measure the preference and the contribution of individuals to a specific topic and to the connection closeness of a coalition. We then proposed an iterative formula for computing the Shapley Value to improve the computation efficiency, related theoretical analysis has also been performed. Finally, we further developed an algorithm to detect meaningful communities.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahn, Y.Y., et al.: Link communities reveal multi-scale complexity in networks. Nature 466, 761–764 (2010)
Boccaletti, S., et al.: Complex networks: Structure and dynamics. Physics Report 424(4-5), 175–308 (2006)
Castro, J., et al.: Polynomial calculation of the Shapley value based on sampling. Computers & Operations Research 36(5), 1726–1730 (2009)
Clauset, A., et al.: Hierarchical structure and the prediction of missing links in networks. Nature 453(7191), 98–101 (2008)
Fatima, S.S., et al.: A linear approximation method for the Shapley Value. Artificial Intelligence 172, 1673–1699 (2008)
Gomez, D., et al.: Centrality and power in social networks: a game theoretic approach. Mathematical Social Sciences 46, 27–54 (2003)
Guimera, R., Amaral, L.A.N.: Functional cartography of complex metabolic networks. Nature 433, 895–900 (2005)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 1st edn. Morgan Kaufmann, California (2000)
Ieong, S., Shoham, Y.: Marginal contribution nets: a compact representation scheme for coalitional games. In: Riedl, J., Kearns, M.J., Reiter, M.K. (eds.) Proceedings of the Sixth ACM Conference on Electronic Commerce, EC 2005, Vancouver, BC, Canada, June 5-8, pp. 193–202 (2005)
Aadithya, K.V., Ravindran, B., Michalak, T.P., Jennings, N.R.: Efficient computation of the shapley value for centrality in networks. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 1–13. Springer, Heidelberg (2010)
Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal 49, 291–307 (1970)
Kubica, J., et al.: Stochastic link and group detection. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence (AAAI 2002), Edmonton, Alberta, Canada, July 28- August 1, pp. 798–806. AAAI Press, The MIT Press (2002)
Li, D., et al.: Synchronization interfaces and overlapping communities in complex networks. Physics Review Letters 101, 168701 (2008)
Lin, Y.R., et al.: Community Discovery via Metagraph Factorization. ACM Transactions on Knowledge Discovery from Data 5(3), 17 (2011)
Liu, W.Y., et al.: An approach for multi-objective categorization based on the game theory and Markov process. Applied Soft Computing 11, 4087–4096 (2011)
McCallum, A., et al.: Topic and role discovery in social networks. In: Proceedings of the 19th international joint conference on Artificial intelligence, Edinburgh, Scotland, July 30- August 5, pp. 786–791 (2005)
Moretti, S., et al.: Using coalitional games on biological networks to measure centrality and power of genes. Bioinformatics 26(21), 2721–2730 (2010)
Nash, J.: Non-cooperative games. Annals of Mathematics. Second Series 54(2), 286–295 (1951)
Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Physics Review E 69(6), 66133 (2004)
Niyato, D., et al.: Controlled Coalitional Games for Cooperative Mobile Social Networks. IEEE Transactions on Vehicular Technology 60(4), 1812–1824 (2011)
Owen, G.: Multilinear extensions of games. Management Science 18(5), 64–79 (1972)
Palla, G., et al.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814–818 (2005)
Ravasz, E., et al.: Hierarchical organization of modularity in metabolic networks. Science 297, 1551–1555 (2002)
Saad, W., et al.: Coalitional game theory for communication networks: a tutorial. IEEE Signal Processing Magazine 26(5), 77–97 (2009)
Shapley, L.S.: A Value for N-person games. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to be Theory of Games, pp. 307–317. Princeton University Press (1953)
Shi, C., et al.: Multi-objective community detection in complex networks. Applied Soft Computing 12, 850–859 (2012)
Suri, N.R., Narahari, Y.: Determining the top-k nodes in social networks using the Shapley Value. In: Proceedings of the Seventh International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2008), pp. 1509–1512 (2008)
Tian, Y., et al.: Efficient aggregation for graph summarization. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, Vancouver, Canada, June 9-12, pp. 567–580 (2008)
Wang, F., et al.: Community discovery using nonnegative matrix factorization. Data Mining Knowledge Discovery 22(3), 493–512 (2011)
Wang, X.R., et al.: Group and Topic Discovery from Relations and Text. In: Proceedings of the 3rd International Workshop on Link Discovery, LinkKDD 2005, pp. 28–35 (2005)
Zhao, Z.Y., et al.: Topic oriented community detection through social objects and link analysis in social networks. Knowledge-Based Systems 26, 164–173 (2012)
Zlotkin, G., Rosenschein, J.: Coalition cryptography and stability mechanisms for coalition formation in task oriented domains. In: Association for the Advancement of Artificial Intelligence, pp. 432–437 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, L., Lü, K., Cheng, C., Chen, H. (2013). A Game Theory Based Approach for Community Detection in Social Networks. In: Gottlob, G., Grasso, G., Olteanu, D., Schallhart, C. (eds) Big Data. BNCOD 2013. Lecture Notes in Computer Science, vol 7968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39467-6_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-39467-6_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39466-9
Online ISBN: 978-3-642-39467-6
eBook Packages: Computer ScienceComputer Science (R0)