WalkingTime: Dynamic Graph Embedding Using Temporal-Topological Flows
- URL: http://arxiv.org/abs/2111.10928v1
- Date: Mon, 22 Nov 2021 00:04:02 GMT
- Title: WalkingTime: Dynamic Graph Embedding Using Temporal-Topological Flows
- Authors: David Bayani
- Abstract summary: We propose a novel embedding algorithm, WalkingTime, based on a fundamentally different handling of time.
We hold flows comprised of temporally and topologically local interactions as our primitives, without any discretization or alignment of time-related attributes being necessary.
- Score: 3.8073142980733
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Increased attention has been paid over the last four years to dynamic network
embedding. Existing dynamic embedding methods, however, consider the problem as
limited to the evolution of a topology over a sequence of global, discrete
states. We propose a novel embedding algorithm, WalkingTime, based on a
fundamentally different handling of time, allowing for the local consideration
of continuously occurring phenomena; while others consider global time-steps to
be first-order citizens of the dynamic environment, we hold flows comprised of
temporally and topologically local interactions as our primitives, without any
discretization or alignment of time-related attributes being necessary.
Keywords: dynamic networks , representation learning , dynamic graph
embedding , time-respecting paths , temporal-topological flows , temporal
random walks , temporal networks , real-attributed knowledge graphs , streaming
graphs , online networks , asynchronous graphs , asynchronous networks , graph
algorithms , deep learning , network analysis , datamining , network science
Related papers
- TimeGraphs: Graph-based Temporal Reasoning [64.18083371645956]
TimeGraphs is a novel approach that characterizes dynamic interactions as a hierarchical temporal graph.
Our approach models the interactions using a compact graph-based representation, enabling adaptive reasoning across diverse time scales.
We evaluate TimeGraphs on multiple datasets with complex, dynamic agent interactions, including a football simulator, the Resistance game, and the MOMA human activity dataset.
arXiv Detail & Related papers (2024-01-06T06:26:49Z) - Continuous-time Graph Representation with Sequential Survival Process [0.17265013728931003]
We propose a process relying on survival functions to model the durations of links and their absences over time.
GraSSP: Graph Representation with Sequential Survival Process forms a generic new likelihood explicitly accounting for intermittent edge-persistent networks.
We quantitatively assess the developed framework in various downstream tasks, such as link prediction and network completion.
arXiv Detail & Related papers (2023-12-20T14:46:54Z) - Temporal Aggregation and Propagation Graph Neural Networks for Dynamic
Representation [67.26422477327179]
Temporal graphs exhibit dynamic interactions between nodes over continuous time.
We propose a novel method of temporal graph convolution with the whole neighborhood.
Our proposed TAP-GNN outperforms existing temporal graph methods by a large margin in terms of both predictive performance and online inference latency.
arXiv Detail & Related papers (2023-04-15T08:17:18Z) - A Dynamic Temporal Self-attention Graph Convolutional Network for
Traffic Prediction [7.23135508361981]
This paper proposes a temporal self-attention graph convolutional network (DT-SGN) model which considers the adjacent matrix as a trainable attention score matrix.
Experiments demonstrate the superiority of our method over state-of-art model-driven model and data-driven models on real-world traffic datasets.
arXiv Detail & Related papers (2023-02-21T03:51:52Z) - Piecewise-Velocity Model for Learning Continuous-time Dynamic Node
Representations [0.0]
Piecewise-Veable Model (PiVeM) for representation of continuous-time dynamic networks.
We show that PiVeM can successfully represent network structure and dynamics in ultra-low two-dimensional spaces.
It outperforms relevant state-of-art methods in downstream tasks such as link prediction.
arXiv Detail & Related papers (2022-12-23T13:57:56Z) - Direct Embedding of Temporal Network Edges via Time-Decayed Line Graphs [51.51417735550026]
Methods for machine learning on temporal networks generally exhibit at least one of two limitations.
We present a simple method that avoids both shortcomings: construct the line graph of the network, which includes a node for each interaction, and weigh the edges of this graph based on the difference in time between interactions.
Empirical results on real-world networks demonstrate our method's efficacy and efficiency on both edge classification and temporal link prediction.
arXiv Detail & Related papers (2022-09-30T18:24:13Z) - Time-aware Dynamic Graph Embedding for Asynchronous Structural Evolution [60.695162101159134]
Existing works merely view a dynamic graph as a sequence of changes.
We formulate dynamic graphs as temporal edge sequences associated with joining time of.
vertex and timespan of edges.
A time-aware Transformer is proposed to embed.
vertex' dynamic connections and ToEs into the learned.
vertex representations.
arXiv Detail & Related papers (2022-07-01T15:32:56Z) - Spatial-Temporal Interactive Dynamic Graph Convolution Network for
Traffic Forecasting [1.52292571922932]
We propose a neural network-based Spatial-Temporal Interactive Dynamic Graph Convolutional Network (STIDGCN) for traffic forecasting in this paper.
In STIDGCN, we propose an interactive dynamic graph convolution structure, which first divides the sequences at intervals and captures the spatial-temporal dependence of the traffic data simultaneously.
Experiments on four real-world traffic flow datasets demonstrate that STIDGCN outperforms the state-of-the-art baseline.
arXiv Detail & Related papers (2022-05-18T01:59:30Z) - Spatio-Temporal Joint Graph Convolutional Networks for Traffic
Forecasting [75.10017445699532]
Recent have shifted their focus towards formulating traffic forecasting as atemporal graph modeling problem.
We propose a novel approach for accurate traffic forecasting on road networks over multiple future time steps.
arXiv Detail & Related papers (2021-11-25T08:45:14Z) - Temporal Graph Network Embedding with Causal Anonymous Walks
Representations [54.05212871508062]
We propose a novel approach for dynamic network representation learning based on Temporal Graph Network.
For evaluation, we provide a benchmark pipeline for the evaluation of temporal network embeddings.
We show the applicability and superior performance of our model in the real-world downstream graph machine learning task provided by one of the top European banks.
arXiv Detail & Related papers (2021-08-19T15:39:52Z) - A Survey on Embedding Dynamic Graphs [0.0]
We overview dynamic graph embedding, discussing its fundamentals and the recent advances developed so far.
We introduce the formal definition of dynamic graph embedding, focusing on the problem setting.
We explore different dynamic behaviors that may be encompassed by embeddings, classifying by topological evolution, feature evolution, and processes on networks.
arXiv Detail & Related papers (2021-01-04T20:35:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.