Skip to main content

A Fast Approach for Detecting Overlapping Communities in Social Networks Based on Game Theory

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9147))

Abstract

Community detection, a fundamental task in social network analysis, aims to identify groups of nodes in a network such that nodes within a group are much more connected to each other than to the rest of the network. The cooperative theory and non-cooperative game theory have been used separately for detecting communities. In this paper, we develop a new approach that utilizes both cooperative and non-cooperative game theory to detect communities. The individuals in a social network are modelled as playing cooperative game for achieving and improving group’s utilities, meanwhile individuals also play the non-cooperative game for improving individual’s utilities. By combining the cooperative and non-cooperative game theories, utilities of groups and individuals can be taken into account simultaneously, thus the communities detected can be more rational and the computational cost will be decreased. The experimental results on synthetic and real networks show that our algorithm can fast detect overlapping communities.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)

    Article  Google Scholar 

  2. Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75–174 (2010)

    Article  MathSciNet  Google Scholar 

  3. Li, X.T., Ng, M.K., Ye, Y.M.: Multicomm: finding community structure in multi-dimensional networks. IEEE Trans. Knowl. Data Eng. 26(4), 929–941 (2014)

    Article  Google Scholar 

  4. Folino, F., Pizzuti, C.: An evolutionary multiobjective approach for community discovery in dynamic networks. IEEE Trans. Knowl. Data Eng. 26(8), 1838–1852 (2014)

    Article  Google Scholar 

  5. Zhou, L., Lü, K., Cheng, C., Chen, H.: A game theory based approach for community detection in social networks. In: Gottlob, G., Grasso, G., Olteanu, D., Schallhart, C. (eds.) BNCOD 2013. LNCS, vol. 7968, pp. 268–281. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  6. Zacharias, G.L., MacMillan, J., Hemel, S.B.V. (eds.): Behavioral Modeling and Simulation: From Individuals to Societies. The National Academies Press, Washington (2008)

    Google Scholar 

  7. Nash, J.F.: Non-cooperative games. Ann. Math. 54(2), 286–295 (1951)

    Article  MATH  MathSciNet  Google Scholar 

  8. Zlotkin, G., Rosenschein J.: Coalition cryptography and stability mechanisms for coalition formation in task oriented domains. In: Proceedings of The Twelfth National Conference on Artificial Intelligence, Seattle, Washington, 1-4 August, pp.432–437. The AAAI Press, Menlo Park, California (1994)

    Google Scholar 

  9. Palla, G., Derenyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structures of complex networks in nature and society. Nat. 435, 814–818 (2005)

    Article  Google Scholar 

  10. Ahn, Y.Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multi-scale complexity in networks. Nat. 466(7307), 761–764 (2010)

    Article  Google Scholar 

  11. Ball, B., Karrer, B., Newman, M.E.J.: An efficient and principled method for detecting communities in networks. Phys. Rev. E 84, 036103 (2011)

    Article  Google Scholar 

  12. Chen, W., Liu, Z., Sun, X., Wang, Y.: A game-theoretic framework to identify overlapping communities in social networks. Data Min. Knowl. Disc. 21(2), 224–240 (2010)

    Article  MathSciNet  Google Scholar 

  13. Alvari, H., Hashemi, S., Hamzeh, A.: Detecting overlapping communities in social networks by game theory and structural equivalence concept. In: Deng, H., Miao, D., Lei, J., Wang, F.L. (eds.) AICI 2011, Part II. LNCS, vol. 7003, pp. 620–630. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  14. Lung, R.I., Gog, A., Chira, C.: A game theoretic approach to community detection in social networks. In: Pelta, D.A., Krasnogor, N., Dumitrescu, D., Chira, C., Lung, R. (eds.) NICSO 2011. SCI, vol. 387, pp. 121–131. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. Hajibagheri, A., Alvari, H., Hamzeh, A., Hashemi, A.: Social networks community detection using the shapley value. In: 16th CSI International Symposium on Artificial Intelligence and Signal Processing (AISwww.lw20.comP), Shiraz, Iran, 2-3 May, pp. 222–227 (2012)

  16. Zhou, L., Cheng, C., Lü, K., Chen, H.: Using coalitional games to detect communities in social networks. In: Wang, J., Xiong, H., Ishikawa, Y., Xu, J., Zhou, J. (eds.) WAIM 2013. LNCS, vol. 7923, pp. 326–331. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  17. Zhou, L., Lü, K.: Detecting communities with different sizes for social network analysis. The Comput. J. Oxford University Press (2014). doi:10.1093/comjnl/bxu087

  18. Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80(1), 16118 (2009)

    Article  Google Scholar 

  19. Danon, L., Díaz-Guilera, A., Duch, J., Arenas, A.: Comparing community structure identification. J. Stat. Mech.: Theory Exp. 2005(09), P09008 (2005)

    Article  Google Scholar 

  20. Lancichinetti, A., Fortunato, S., Kertesz, J.: Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11, 033015 (2009)

    Article  Google Scholar 

  21. Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452–473 (1977)

    Google Scholar 

  22. Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press, New York (1993)

    Google Scholar 

Download references

Acknowledgement

The authors thank sincerely Mr. Wei Chen from Microsoft Research Asia for providing code on their work and helps. This work is supported by the National Natural Science Foundation of China under Grant No.61262069, No. 61472346, Program for Young and Middle-aged Teachers Grant, Yunnan University, and Program for Innovation Research Team in Yunnan University (Grant No. XT412011).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kevin Lü .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhou, L., Yang, P., Lü, K., Wang, L., Chen, H. (2015). A Fast Approach for Detecting Overlapping Communities in Social Networks Based on Game Theory. In: Maneth, S. (eds) Data Science. BICOD 2015. Lecture Notes in Computer Science(), vol 9147. Springer, Cham. https://doi.org/10.1007/978-3-319-20424-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20424-6_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20423-9

  • Online ISBN: 978-3-319-20424-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics