Evolving network representation learning based on random walks
Abstract Large-scale network mining and analysis is key to revealing the underlying dynamics of networks, not easily observable before. Lately, there is a fast-growing interest in learning low-dimensional continuous representations of networks that can be utilized to perform highly accurate and scal...
Main Authors: | Farzaneh Heidari, Manos Papagelis |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2020-03-01
|
Series: | Applied Network Science |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1007/s41109-020-00257-3 |
Similar Items
-
An Information-Explainable Random Walk Based Unsupervised Network Representation Learning Framework on Node Classification Tasks
by: Xin Xu, et al.
Published: (2021-07-01) -
Dynamic Graph Representation Learning With Neural Networks: A Survey
by: Leshanshui Yang, et al.
Published: (2024-01-01) -
Graph Embedding Framework Based on Adversarial and Random Walk Regularization
by: Wei Dou, et al.
Published: (2021-01-01) -
HeteEdgeWalk: A Heterogeneous Edge Memory Random Walk for Heterogeneous Information Network Embedding
by: Zhenpeng Liu, et al.
Published: (2023-06-01) -
Improving Network Representation Learning via Dynamic Random Walk, Self-Attention and Vertex Attributes-Driven Laplacian Space Optimization
by: Shengxiang Hu, et al.
Published: (2022-08-01)