Browse State-of-the-Art › Dynamic Community Detection
Dynamic Community Detection
5 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
community detection in dynamic networks
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Most implemented papers archive 2025-07-28
5 shown of 5 papers with code (11 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
10 Dec 2024 2 repositories listedDiscovering and tracking communities in time-varying networks is an important task in network science, motivated by applications in fields ranging from neuroscience to sociology.
-
6 Jan 2024 1 repository listed Syntology ran 5 of 8 samples · 3 unverified · 8 pointer-only (licence)Dynamic community detection methods often lack effective mechanisms to ensure temporal consistency, hindering the analysis of network evolution.
-
30 Sep 2021 1 repository listedIn this paper, we propose a Feature Transfer Based Multi-Objective Optimization Genetic Algorithm (TMOGA) based on transfer learning and traditional multi-objective evolutionary algorithm framework.
-
4 Nov 2020 1 repository listedThe method used in this study is available as a new R package called DynCommPhylo.
-
16 Jul 2020 1 repository listedWhen the network evolves from the previous snapshot to the current one, the proposed method only considers the community affiliations of partial nodes efficiently, which are either newborn nodes or some active nodes…
Syntology lines on 1 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections