Graph Contrastive Learning for Tracking Dynamic Communities in Temporal Networks

Temporal networks are ubiquitous because complex systems in nature and society are evolving, and tracking dynamic communities is critical for revealing the mechanism of systems. Moreover, current algorithms utilize temporal smoothness framework to balance clustering accuracy at current time and clustering drift at historical time, which are criticized for failing to characterize the temporality of networks and determine its importance. To overcome these problems, we propose a novel algorithm by
j
oining
N
on-negative matrix factorization and
C
ontrastive learning for
D
ynamic
C
ommunity detection (jNCDC). Specifically, jNCDC learns the features of vertices by projecting successive snapshots into a shared subspace to learn the low-dimensional representation of vertices with matrix factorization. Subsequently, it constructs an evolution graph to explicitly measure relations of vertices by representing vertices at current time with features at historical time, paving a way to characterize the dynamics of networks at the vertex-level. Finally, graph contrastive learning utilizes the roles of vertices to select positive and negative samples to further improve the quality of features. These procedures are seamlessly integrated into an overall objective function, and optimization rules are deduced. To the best of our knowledge, jNCDC is the first graph contrastive learning for dynamic community detection, that provides an alternative for the current temporal smoothness framework. Experimental results demonstrate that jNCDC is superior to the state-of-the-art approaches in terms of accuracy.