التفاصيل البيبلوغرافية
| العنوان: |
A Stable Decomposition Algorithm for Dynamic Social Network Analysis. |
| المؤلفون: |
Bourqui, Romain, Simonetto, Paolo, Jourdan, Fabien |
| المصدر: |
Advances in Knowledge Discovery & Management; 2010, p167-178, 12p |
| مستخلص: |
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 ]> . This algorithm is particularly efficient because it can detect major changes in the data as it evolves over time. [ABSTRACT FROM AUTHOR] |
|
Copyright of Advances in Knowledge Discovery & Management is the property of Springer Nature / Books and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Complementary Index |
