A stable decomposition algorithm for dynamic social network analysis

R.Y. Bourqui, P. Simonetto, F. Jourdan

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)


Dynamic networks raise new challenges for knowledge discovery. To efficiently handle this kind of data, analysis methods have to decompose the network, modelled by a graph, into similar sets of nodes. In this article, we present a graph decomposition algorithm that generates overlapping clusters. The complexity of this algorithm is [one formula omitted] This algorithm is particularly efficient because it can detect major changes in the data as it evolves over time.
Original languageEnglish
Pages (from-to)167-178
JournalStudies in Computational Intelligence
Publication statusPublished - 2010


Dive into the research topics of 'A stable decomposition algorithm for dynamic social network analysis'. Together they form a unique fingerprint.

Cite this