On the Community Identification in Weighted Time-Varying Networks

Abstract : The community detection play an important role in understanding the information underlying to the graph structure, especially, when the graph structure or the weights between the linked entities change over time. In this paper, we propose an algorithm for the community identification in weighted and dynamic graphs, called Dyci. The latter takes advantage from the previously detected communities. Several changes’ scenarios are considered like, node/edge addition, node/edge removing and edge weight update. The main idea of Dyci is to track whether a connected component of the weighted graph becomes weak over time, in order to merge it with the “dominant” neighbour community. In order to assess the quality of the returned community structure, we conduct a comparison with a genetic algorithm on real-world data of the ANR-Info-RSN project. The conducted comparison shows that Dyci provides a good trade-off between efficiency and consumed time.
Document type :
Conference papers
Complete list of metadatas

https://hal.univ-lorraine.fr/hal-01785932
Contributor : Lcoms Ul <>
Submitted on : Friday, May 4, 2018 - 5:06:56 PM
Last modification on : Tuesday, December 18, 2018 - 4:40:24 PM

Identifiers

  • HAL Id : hal-01785932, version 1

Collections

Citation

Youcef Abdelsadek, Kamel Chelghoum, Francine Herrmann, Imed Kacem, Benoit Otjacques. On the Community Identification in Weighted Time-Varying Networks. ICSIBO 2016 International Conference on Swarm Intelligence Based Optimization: Swarm Intelligence Based Optimization, Jun 2016, Mulhouse, France. ⟨hal-01785932⟩

Share

Metrics

Record views

54