3260 papers • 126 benchmarks • 313 datasets
community detection in dynamic networks
(Image credit: Papersgraph)
These leaderboards are used to track progress in dynamic-community-detection-5
No benchmarks available.
Use these libraries to find dynamic-community-detection-5 models and implementations
No datasets available.
No subtasks available.
The results show that the proposed incremental detection method can detect satisfactory community structure from each of snapshot graphs efficiently and steadily, and outperforms the competitors significantly.
A Feature Transfer Based Multi-Objective Optimization Genetic Algorithm (TMOGA) based on transfer learning and traditional multi-objective evolutionary algorithm framework to extract stable features from past community structures, retain valuable feature information, and integrate this feature information into current optimization processes to improve the evolutionary algorithms.
This paper proposes a novel deep graph clustering framework with temporal consistency regularization on inter-community structures, inspired by the concept of minimal network topological changes within short intervals, and introduces MFC, a matrix factorization-based deep graph clustering algorithm that preserves node embedding.
Adding a benchmark result helps the community track progress.