Dynamic communities and their detection

  • András Bóta
  • Miklós Krész
  • András Pluhár


Overlapping community detection has already become an interesting problem in data mining and also a useful technique in applications. This underlines the importance of following the lifetime of communities in real graphs. Palla et al. developed a promising method, and analyzed community evolution on two large databases [23]. We have followed their footsteps in analyzing large real-world databases and found, that the framework they use to describe the dynamics of communities is insufficient for our data. The method used by Palla et al. is also dependent on a very special community detection algorithm, the clique percolation method, and on its monotonic nature. In this paper we propose an extension of the basic community events described in [23] and a method capable of handling communities found a non-monotonic community detection algorithm. We also report on findings that came from the tests on real social graphs.


Download data is not yet available.
How to Cite
Bóta, A., Krész, M., & Pluhár, A. (2011). Dynamic communities and their detection. Acta Cybernetica, 20(1), 35-52. https://doi.org/10.14232/actacyb.20.1.2011.4
Regular articles