Cyclic Graph Attentive Match Encoder (CGAME): A Novel Neural Network For OD Estimation

• URL: http://arxiv.org/abs/2111.14625v1
• Date: Fri, 26 Nov 2021 08:57:21 GMT
• Title: Cyclic Graph Attentive Match Encoder (CGAME): A Novel Neural Network For OD Estimation
• Authors: Guanzhou Li, Yujing He, Jianping Wu
• Abstract summary: Origin-Destination Estimation plays an important role in traffic management and traffic simulation in the era of Intelligent Transportation System (ITS) Previous model-based models face the under-determined challenge, thus desperate demand for additional assumptions and extra data exists. We propose Cyclic Graph Attentive Matching (C-GAME) based on a novel Graph Matcher with double-layer attention mechanism.
• Score: 8.398623478484248
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Origin-Destination Estimation plays an important role in traffic management and traffic simulation in the era of Intelligent Transportation System (ITS). Nevertheless, previous model-based models face the under-determined challenge, thus desperate demand for additional assumptions and extra data exists. Deep learning provides an ideal data-based method for connecting inputs and results by probabilistic distribution transformation. While relevant researches of applying deep learning into OD estimation are limited due to the challenges lying in data transformation across representation space, especially from dynamic spatial-temporal space to heterogeneous graph in this issue. To address it, we propose Cyclic Graph Attentive Matching Encoder (C-GAME) based on a novel Graph Matcher with double-layer attention mechanism. It realizes effective information exchange in underlying feature space and establishes coupling relationship across spaces. The proposed model achieves state-of-the-art results in experiments, and offers a novel framework for inference task across spaces in prospective employments.

Related papers

• Graph Masked Autoencoder for Spatio-Temporal Graph Learning [38.085962443141206]
  In urban sensing applications, effective-temporal prediction frameworks play a crucial role in traffic analysis, human mobility evaluations and crime prediction. The presence of data noise and sparsity in spatial and temporal data presents significant challenges for existing neural network models in learning robust representations. We propose a novel self-supervised learning paradigm for effective-temporal data augmentation.
  arXiv  Detail & Related papers  (2024-10-14T07:33:33Z)
• Spatial-Temporal Graph Learning with Adversarial Contrastive Adaptation [19.419836274690816]
  We propose a new spatial-temporal graph learning model (GraphST) for enabling effective self-supervised learning. Our proposed model is an adversarial contrastive learning paradigm that automates the distillation of crucial multi-view self-supervised information. We demonstrate the superiority of our proposed GraphST method in various spatial-temporal prediction tasks on real-life datasets.
  arXiv  Detail & Related papers  (2023-06-19T03:09:35Z)
• Deep Graph Reprogramming [112.34663053130073]
  "Deep graph reprogramming" is a model reusing task tailored for graph neural networks (GNNs) We propose an innovative Data Reprogramming paradigm alongside a Model Reprogramming paradigm.
  arXiv  Detail & Related papers  (2023-04-28T02:04:29Z)
• VTAE: Variational Transformer Autoencoder with Manifolds Learning [144.0546653941249]
  Deep generative models have demonstrated successful applications in learning non-linear data distributions through a number of latent variables. The nonlinearity of the generator implies that the latent space shows an unsatisfactory projection of the data space, which results in poor representation learning. We show that geodesics and accurate computation can substantially improve the performance of deep generative models.
  arXiv  Detail & Related papers  (2023-04-03T13:13:19Z)
• Adaptive Graph Spatial-Temporal Transformer Network for Traffic Flow Forecasting [6.867331860819595]
  Traffic forecasting can be highly challenging due to complex spatial-temporal correlations and non-linear traffic patterns. Existing works mostly model such spatial-temporal dependencies by considering spatial correlations and temporal correlations separately. We propose to directly model the cross-spatial-temporal correlations on the spatial-temporal graph using local multi-head self-attentions.
  arXiv  Detail & Related papers  (2022-07-09T19:21:00Z)
• Continuous-Time and Multi-Level Graph Representation Learning for Origin-Destination Demand Prediction [52.0977259978343]
  This paper proposes a Continuous-time and Multi-level dynamic graph representation learning method for Origin-Destination demand prediction (CMOD) The state vectors keep historical transaction information and are continuously updated according to the most recently happened transactions. Experiments are conducted on two real-world datasets from Beijing Subway and New York Taxi, and the results demonstrate the superiority of our model against the state-of-the-art approaches.
  arXiv  Detail & Related papers  (2022-06-30T03:37:50Z)
• Interpolation-based Correlation Reduction Network for Semi-Supervised Graph Learning [49.94816548023729]
  We propose a novel graph contrastive learning method, termed Interpolation-based Correlation Reduction Network (ICRN) In our method, we improve the discriminative capability of the latent feature by enlarging the margin of decision boundaries. By combining the two settings, we extract rich supervision information from both the abundant unlabeled nodes and the rare yet valuable labeled nodes for discnative representation learning.
  arXiv  Detail & Related papers  (2022-06-06T14:26:34Z)
• Handling Distribution Shifts on Graphs: An Invariance Perspective [78.31180235269035]
  We formulate the OOD problem on graphs and develop a new invariant learning approach, Explore-to-Extrapolate Risk Minimization (EERM) EERM resorts to multiple context explorers that are adversarially trained to maximize the variance of risks from multiple virtual environments. We prove the validity of our method by theoretically showing its guarantee of a valid OOD solution.
  arXiv  Detail & Related papers  (2022-02-05T02:31:01Z)
• SGCN:Sparse Graph Convolution Network for Pedestrian Trajectory Prediction [64.16212996247943]
  We present a Sparse Graph Convolution Network(SGCN) for pedestrian trajectory prediction. Specifically, the SGCN explicitly models the sparse directed interaction with a sparse directed spatial graph to capture adaptive interaction pedestrians. visualizations indicate that our method can capture adaptive interactions between pedestrians and their effective motion tendencies.
  arXiv  Detail & Related papers  (2021-04-04T03:17:42Z)
• Representation Learning via Adversarially-Contrastive Optimal Transport [40.52344027750609]
  We set the problem within the context of contrastive representation learning. We propose a framework connecting Wasserstein GANs with a novel classifier. Our results demonstrate competitive performance against challenging baselines.
  arXiv  Detail & Related papers  (2020-07-11T19:46:18Z)
• Spatial-Temporal Dynamic Graph Attention Networks for Ride-hailing Demand Prediction [3.084885761077852]
  Ride-hailing demand prediction can help to pre-allocate resources, improve vehicle utilization and user experiences. Existing ride-hailing demand prediction methods only assign the same importance to different neighbor regions. We propose the Spatial-Temporal Dynamic Graph Attention Network (STDGAT), a novel ride-hailing demand prediction method.
  arXiv  Detail & Related papers  (2020-06-07T13:00:19Z)

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.