Towards Fine-Grained Temporal Network Representation via Time-Reinforced Random Walk
Zhining Liu, Dawei Zhou, Yada Zhu, Jinjie Gu, Jingrui He
Abstract
Encoding a large-scale network into a low-dimensional space is a fundamental step for various network analytic problems, such as node classification, link prediction, community detection, etc. Existing methods focus on learning the network representation from either the static graphs or time-aggregated graphs (e.g., time-evolving graphs). However, many real systems are not static or time-aggregated as the nodes and edges are timestamped and dynamically changing over time. For examples, in anti-money laundering analysis, cycles formed with time-ordered transactions might be red flags in online transaction networks; in novelty detection, a star-shaped structure appearing in a short burst might be an underlying hot topic in social networks. Existing embedding models might not be able to well preserve such fine-grained network dynamics due to the incapability of dealing with continuous-time and the negligence of fine-grained interactions. To bridge this gap, in this paper, we propose a fine-grained temporal network embedding framework named FiGTNE, which aims to learn a comprehensive network representation that preserves the rich and complex network context in the temporal network. In particular, we start from the notion of fine-grained temporal networks, where the temporal network can be represented as a series of timestamped nodes and edges. Then, we propose the time-reinforced random walk (TRRW) with a bi-level context sampling strategy to explore the essential structures and temporal contexts in temporal networks. Extensive experimental results on real graphs demonstrate the efficacy of our FiGTNE framework.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers6
- Hyperbolic Variational Graph Neural Network for Modeling Dynamic GraphsLi Sun, Zhongbao Zhang, Jiawei Zhang, Feiyang Wang et al.AAAI 2021 · 97 citations
- BRIGHT: A Bridging Algorithm for Network AlignmentYuchen Yan, Si Zhang, Hanghang TongWWW 2021 · 87 citations
- Controlling Graph Dynamics with Reinforcement Learning and Graph Neural NetworksEli A. Meirom, Haggai Maron, Shie Mannor, Gal ChechikICML 2021 · 56 citations
- Neural-Answering Logical Queries on Knowledge GraphsLihui Liu, Boxin Du, Heng Ji, ChengXiang Zhai et al.KDD 2021 · 40 citations
- CAT-Walk: Inductive Hypergraph Learning via Set WalksAli Behrouz, Farnoosh Hashemi, Sadaf Sadeghian, Margo I. SeltzerNeurIPS 2023 · 21 citations
Related papers
- Forecasting Interaction Order on Temporal GraphsWenwen Xia, Yuchen Li, Jianwei Tian, Shenghong LiKDD 2021 · 8 citations
- Temporal Network Embedding with High-Order Nonlinear InformationZhenyu Qiu, Wenbin Hu, Jia Wu, Weiwei Liu et al.AAAI 2020 · 24 citations
- Temporal Network Representation Learning via Historical Neighborhoods AggregationShixun Huang, Zhifeng Bao, Guoliang Li, Yanghao Zhou et al.ICDE 2020 · 26 citations
- Motif-Preserving Dynamic Attributed Network EmbeddingZhijun Liu, Chao Huang, Yanwei Yu, Junyu DongWWW 2021 · 67 citations
- FTM: A Frame-Level Timeline Modeling Method for Temporal Graph Representation LearningBowen Cao, Qichen Ye, Weiyuan Xu, Yuexian ZouAAAI 2023 · 1 citation
