Time-varying graph representation learning via higher-order skip-gram with negative sampling
Abstract Representation learning models for graphs are a successful family of techniques that project nodes into feature spaces that can be exploited by other machine learning algorithms. Since many real-world networks are inherently dynamic, with interactions among nodes changing over time, these t...
Main Authors: | Simone Piaggesi, André Panisson |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2022-05-01
|
Series: | EPJ Data Science |
Subjects: | |
Online Access: | https://doi.org/10.1140/epjds/s13688-022-00344-8 |
Similar Items
-
Temporal Multiresolution Graph Learning
by: Koki Yamada, et al.
Published: (2021-01-01) -
Memory-Enhanced Transformer for Representation Learning on Temporal Heterogeneous Graphs
by: Longhai Li, et al.
Published: (2023-03-01) -
Reliable Knowledge Graph Path Representation Learning
by: Seungmin Seo, et al.
Published: (2020-01-01) -
Improved Skip-Gram Based on Graph Structure Information
by: Xiaojie Wang, et al.
Published: (2023-07-01) -
Temporal Knowledge Graph Representation Learning
by: XU Yong-xin, ZHAO Jun-feng, WANG Ya-sha, XIE Bing, YANG Kai
Published: (2022-09-01)