Clustering dynamic networks by discriminating roles of vertices and capturing temporality with subsequent feature projection

• Published in: Knowledge-based systems Vol. 305; p. 112660
• Main Authors: Ma, Yaxiong, Gao, Yue, Dou, Zengfa, Huang, Guohua, Ma, Xiaoke
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 03-12-2024
• Subjects: Clustering; Dynamic networks; Matrix projection; Non-negative matrix factorization; Dynamic networks; Non-negative matrix factorization; Clustering; Matrix projection
• ISSN: 0950-7051
• DOI: 10.1016/j.knosys.2024.112660

Clustering dynamic networks has gained popularity due to the need to analyze complex systems that evolve over time, which cannot be fully characterized by traditional static models. It is highly non-trivial in comparison to clustering static network since it requires simultaneously to balance clustering accuracy and clustering drift, where clustering accuracy measures how clustering reflects structure of graph at current time, and clustering drift quantifies how clustering smoothes historical snapshot(s). In this study, we propose an algorithm clustering dynamic network by discriminating roles of vertices and capturing temporality with subsequent feature projection (CDN-DRCT). Specifically, clustering accuracy is achieved by factorizing high-order matrix of slice at current time, and vertices are divided into static and dynamic ones by the reconstruction errors. Finally, the proposed algorithm measures temporality of networks with a projection matrix, which connects subsequent features at the previous and current time, thereby enhancing clustering drift of clusters. In this case, temporality of dynamic networks is characterized from vertex and global level, providing a better way to balance clustering accuracy and clustering drift. Experimental results on 10 typical dynamic networks demonstrate the proposed algorithm is superior to baselines in terms of accuracy as well efficiency.