Unsupervised Attributed Dynamic Network Embedding with Stability Guarantees
Stability for dynamic network embeddings ensures that nodes behaving the same at different times receive the same embedding, allowing comparison of nodes in the network across time. We present attributed unfolded adjacency spectral embedding (AUASE), a stable unsupervised representation learning framework for dynamic networks in which nodes are attributed with time-varying covariate information. To establish stability, we prove uniform convergence to an associated latent position model. We quantify the benefits of our dynamic embedding by comparing with state-of-the-art network representation learning methods on three real attributed networks. To the best of our knowledge, AUASE is the only attributed dynamic embedding that satisfies stability guarantees without the need for ground truth labels, which we demonstrate provides significant improvements for link prediction and node classification.
Code (0)
등록된 구현이 없습니다.
Tasks
Link PredictionNetwork EmbeddingNode ClassificationPositionRepresentation LearningSimilar Papers 제목 키워드 기반
Unsupervised Deep Manifold Attributed Graph Embedding
Unsupervised attributed graph representation learning is challenging since both structural and feature information are required to be represented in the latent space. Existing methods concentrate on learning latent repre…
ClusteringGraph EmbeddingGraph Representation LearningLink Prediction+2Hierarchical and Unsupervised Graph Representation Learning with Loukas's Coarsening
We propose a novel algorithm for unsupervised graph representation learning with attributed graphs. It combines three advantages addressing some current limitations of the literature: i) The model is inductive: it can em…
Graph Representation LearningRepresentation LearningAttributed Sequence Embedding
Mining tasks over sequential data, such as clickstreams and gene sequences, require a careful design of embeddings usable by learning algorithms. Recent research in feature learning has been extended to sequential data, …
ClusteringSpectral embedding for dynamic networks with stability guarantees
We consider the problem of embedding a dynamic network, to obtain time-evolving vector representations of each node, which can then be used to describe changes in behaviour of individual nodes, communities, or the entire…
ClusteringPositionStochastic Block ModelUnfolded Laplacian Spectral Embedding: A Theoretically Grounded Approach to Dynamic Network Representation
Dynamic relational data arise in many machine learning applications, yet their evolving structure poses challenges for learning representations that remain consistent and interpretable over time. A common approach is to …