Skip to main content

Efficient Community Maintenance for Dynamic Social Networks

  • Conference paper
  • First Online:
Web Technologies and Applications (APWeb 2016)

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

Included in the following conference series:

  • 1686 Accesses

Abstract

Community detection plays an important role in a wide range of research topics for social networks. The highly dynamic nature of social platforms, and accordingly the constant updates to the underlying network, all present a serious challenge for efficient maintenance of the identified communities—How to avoid computing from scratch the whole community detection result in face of every update, which constitutes small changes more often than not. To solve this problem, we propose a novel and efficient algorithm to maintain the communities in dynamic social networks by identifying and updating only those vertices whose community memberships are affected. The complexity of our algorithm is independent of the graph size. Experiments across varied datasets demonstrate the superiority of our proposed algorithm in terms of time efficiency and accuracy.

This research is partially funded by the National Research Foundation, Prime Ministers Office, Singapore under its International Research Centres in Singapore Funding Initiative and Pinnacle Lab for Analytics at Singapore Management University, National Natural Science Foundation of China (No. 61332006, 61332014, 61328202, 61572119, U1401256) and the Fundamental Research Funds for the Central Universities of China (No. N150402005, N130504006).

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Blondel, V.D., Guillaume, J.L.: Fast unfolding of communities in large networks. J. Stat. Mech. Theor. Exp. 2008(10), P10008 (2008)

    Article  Google Scholar 

  2. Brandes, U., Delling, D., Gaertler, M.: On modularity clustering. IEEE Trans. Knowl. Data Eng. 20(2), 172–188 (2008)

    Article  Google Scholar 

  3. Fortunato, S., Castellano, C.: Community structure in graphs. In: Meyers, R.A. (ed.) Computational Complexity, pp. 490–512. Springer, New York (2012)

    Chapter  Google Scholar 

  4. Leskovec, J., Krevl, A.: SNAP datasets: Stanford large network dataset collection, June 2015. http://snap.stanford.edu/data

  5. Newman, M.E.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69(6), 066133 (2004)

    Article  Google Scholar 

  6. Nguyen, N.P., Dinh, T.N., Shen, Y., Thai, M.T.: Dynamic social community detection and its applications. PloS one 9(4), e91431 (2014)

    Article  Google Scholar 

  7. Nguyen, N.P., Dinh, T.N., Xuan, Y., Thai, M.T.: Adaptive algorithms for detecting community structure in dynamic social networks. In: 2011 Proceedings of IEEE INFOCOM, pp. 2282–2290. IEEE (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hongchao Qin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Qin, H., Yuan, Y., Zhu, F., Wang, G. (2016). Efficient Community Maintenance for Dynamic Social Networks. In: Li, F., Shim, K., Zheng, K., Liu, G. (eds) Web Technologies and Applications. APWeb 2016. Lecture Notes in Computer Science(), vol 9932. Springer, Cham. https://doi.org/10.1007/978-3-319-45817-5_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45817-5_50

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45816-8

  • Online ISBN: 978-3-319-45817-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics