SCOUT: simultaneous time segmentation and community detection in dynamic networks
Yuriy Hulovatyy, Tijana Milenkovic

TL;DR
SCOUT is a novel method for simultaneously detecting time segments and community structures in dynamic networks, capturing evolving and stable community patterns more accurately than existing approaches.
Contribution
The paper introduces SCOUT, an optimization framework that jointly performs time segmentation and community detection, addressing limitations of methods that consider only one aspect.
Findings
SCOUT outperforms existing methods in accuracy.
SCOUT has lower computational complexity.
SCOUT effectively captures evolving community structures.
Abstract
Many evolving complex systems can be modeled via dynamic networks. An important problem in dynamic network research is community detection, which identifies groups of topologically related nodes. Typically, this problem is approached by assuming either that each time point has a distinct community organization or that all time points share one community organization. In reality, the truth likely lies between these two extremes, since some time periods can have community organization that evolves while others can have community organization that stays the same. To find the compromise, we consider community detection in the context of the problem of segment detection, which identifies contiguous time periods with consistent network structure. Consequently, we formulate a combined problem of segment community detection (SCD), which simultaneously partitions the network into contiguous time…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
