Souâad Boudebza

Souâad Boudebza

Auto-generated profile, based on publicly available information

Souâad Boudebza

Université Mohamed Seddik Benyahia de Jijel, BP 98 Ouled Aïssa, 18000, Jijel, Algeria

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2018 in Computer Communications
Verified
Journal Article
Closed access
SBSouâad Boudebza
Souâad Boudebza
RCRemy Cazabet
Remy Cazabet
FAFaiçal Azouaou
Faiçal Azouaou
ONOmar Nouali
Omar Nouali

1 December 2020 in Journal of Complex Networks
Verified
Journal Article
Open access
RCRemy Cazabet
Remy Cazabet
SBSouâad Boudebza
Souâad Boudebza
Giulio RossettiGiulio Rossetti
Giulio Rossetti
Many algorithms have been proposed in the last 10 years for the discovery of dynamic communities. However, these methods are seldom compared between themselves. In this article, we propose a generator of dynamic graphs with planted evolving community structure, as a benchmark to compare and evaluate such algorithms. Unlike previously proposed benchmarks, it is able to specify any desired evolving community structure through a descriptive language, and then to generate the corresponding progressively evolving network. We empirically evaluate six existing algorithms for dynamic community detection in terms of instantaneous and longitudinal similarity with the planted ground truth, smoothness of dynamic partitions and scalability. We notably observe different types of weaknesses depending on their approach to ensure smoothness, namely Glitches, Oversimplification and Identity loss. Although no method arises as a clear winner, we observe clear differences between methods, and we identified the fastest, those yielding the most smoothed or the most accurate solutions at each step.


28 March 2020
Verified
Book Chapter
Closed access
PDF file
SBSouâad Boudebza
Souâad Boudebza
RCRémy Cazabet
Rémy Cazabet
ONOmar Nouali
Omar Nouali
FAFaiçal Azouaou
Faiçal Azouaou

11 April 2018 in arXiv
Verified
Preprint
Open access
PDF file
SBSouâad Boudebza
Souâad Boudebza
RCRémy Cazabet
Rémy Cazabet
FAFaiçal Azouaou
Faiçal Azouaou
ONOmar Nouali
Omar Nouali
Community structure is one of the most prominent features of complex networks. Community structure detection is of great importance to provide insights into the network structure and functionalities. Most proposals focus on static networks. However, finding communities in a dynamic network is even more challenging, especially when communities overlap with each other. In this article , we present an online algorithm, called OLCPM, based on clique percolation and label propagation methods. OLCPM can detect overlapping communities and works on temporal networks with a fine granularity. By locally updating the community structure, OLCPM delivers significant improvement in running time compared with previous clique percolation techniques. The experimental results on both synthetic and real-world networks illustrate the effectiveness of the method.

1 January 2013
Verified
Book Chapter
Closed access
PDF file
SBSouâad Boudebza
Souâad Boudebza
LBLamia Berkani
Lamia Berkani
FAFaiçal Azouaou
Faiçal Azouaou
ONOmar Nouali
Omar Nouali