@inbook{5591392fa029488a97f40e28b96ba0e6,
title = "A stable decomposition algorithm for dynamic social network analysis",
abstract = "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.",
author = "R.Y. Bourqui and P. Simonetto and F. Jourdan",
year = "2010",
doi = "10.1007/978-3-642-00580-0\_10",
language = "English",
isbn = "978-3-642-00579-4",
series = "Studies in Computational Intelligence",
publisher = "Springer",
pages = "167--178",
editor = "Fabrice Guillet and Gilbert Ritschard",
booktitle = "Advances in Knowledge Discovery and Management",
address = "Germany",
}