Using temporal node embeddings for community detection

Abstract

The application of machine learning methodologies in networks requires an appropriate representation of network data in vector form. Several embedding methods already facilitate the representation of network information at graph, node, and community levels. However, the majority of research focuses on static graph snapshots, largely ignoring any temporal network dynamics. As a result, the outcome of network analysis tasks -such as graph visualisation or community detection- is informed by overly reduced data. In response, this work attempts to model temporal dependencies in graphs by introducing ComE+, a dynamic graph embedding and community detection framework which extends the standard ComE clustering algorithm by employing CTDNE’s temporal embedding approach. The proposed model is tested in a variety of datasets compared to several established baselines, proving its capacity for yielding more meaningful network community estimates by relying on time-sensitive node representations.