Name
Title | ||
|---|---|---|
Evolutionary clustering via graph regularized nonnegative matrix factorization for exploring temporal networks. |
Abstract | ||
|---|---|---|
Evolutionary clustering is a classic and helpful framework for modeling dynamic data and has been devoted to analyzing the temporal networks recently. However, all methods based on evolutionary clustering either does not directly model the evolution, predict the varying of dynamic communities, deal with the case of the time-varying number of communities or have a high computational complexity and are not easily extended, which limits the applications for exploring the dynamic networks. In this paper, we propose a new novel framework of Evolutionary Clustering based on Graph regularized Nonnegative Matrix Factorization (ECGNMF), to detect dynamic communities and the evolution patterns and predict the varying structure across the temporal networks. More concretely, we construct a generated model to fit the observed snapshot networks based on nonnegative matrix factorization (NMF). Any one of series intuitive and interpretable penalty items as we denoted could be integrated into the proposed framework via a graph regularization way, which can be optimized efficiently and model changes of the number of communities across different snapshots of temporal networks. We also detect the evolution patterns of the dynamic communities in the temporal networks in a principled manner. Experimental results show that our framework has better performance on community detection in temporal networks compared to some widely used models based on evolutionary clustering and heuristic methods. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.knosys.2019.01.024 | Knowledge-Based Systems |
Keywords | Field | DocType |
Non-negative matrix factorization (NMF),Temporal network,Evolutionary clustering,Dynamic community detection | Graph,Data mining,Heuristic,Computer science,Dynamic data,Graph regularization,Evolutionary clustering,Non-negative matrix factorization,Snapshot (computer storage),Computational complexity theory | Journal |
Volume | ISSN | Citations |
167 | 0950-7051 | 0 |
PageRank | References | Authors |
0.34 | 19 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wei Yu | 1 | 0 | 0.34 |
| Wenjun Wang | 2 | 304 | 42.81 |
| Pengfei Jiao | 3 | 84 | 19.26 |
| Xuewei Li | 4 | 8 | 5.90 |