DyCSC: Modeling the Evolutionary Process of Dynamic Networks Based on Cluster Structure
원문 초록
Temporal networks are an important type of network whose topological structure changes over time. Compared with methods on static networks, temporal network embedding (TNE) methods are facing three challenges: 1) it cannot describe the temporal dependence across network snapshots; 2) the node embedding in the latent space fails to indicate changes in the network topology; and 3) it cannot avoid a lot of redundant computation via parameter inheritance on a series of snapshots. To this end, we propose a novel temporal network embedding method named Dynamic Cluster Structure Constraint model (DyCSC), whose core idea is to capture the evolution of temporal networks by imposing a temporal constraint on the tendency of the nodes in the network to a given number of clusters. It not only generates low-dimensional embedding vectors for nodes but also preserves the dynamic nonlinear features of temporal networks. Experimental results on multiple realworld datasets have demonstrated the superiority of DyCSC for temporal graph embedding, as it consistently outperforms competing methods by significant margins in multiple temporal link prediction tasks. Moreover, the ablation study further validates the effectiveness of the proposed temporal constraint.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A Survey on Signed Graph Embedding: Methods and Applications
Binarized Attributed Network Embedding
Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition
Optimal Embedding Guided Negative Sample Generation for Knowledge Graph Link Prediction
Finsler Multi-Dimensional Scaling: Manifold Learning for Asymmetric Dimensionality Reduction and Embedding
Structure-Preference Enabled Graph Embedding Generation under Differential Privacy
토론
이 논문과 연결된 포럼 글이 아직 없습니다.