Efficient community maintenance for dynamic social networks

Hongchao Qin*, Ye Yuan, Feida Zhu, Guoren Wang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationWeb Technologies and Applications - 18th Asia-Pacific Web Conference, APWeb 2016, Proceedings
EditorsKyuseok Shim, Kai Zheng, Guanfeng Liu, Feifei Li
PublisherSpringer Verlag
Pages478-482
Number of pages5
ISBN (Print)9783319458168
DOIs
Publication statusPublished - 2016
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9932 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Community detection
  • Dynamic
  • Heuristic
  • Modularity

Fingerprint

Dive into the research topics of 'Efficient community maintenance for dynamic social networks'. Together they form a unique fingerprint.

Cite this