Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 188

The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.

Coupled Layer-wise Graph Convolution for Transportation Demand Prediction

Open access
Ye, Junchen, Sun, Leilei, Du, Bowen, Fu, Yanjie, Xiong, Hui · 2021 · Proceedings of the AAAI Conference on Artificial Intelligence

Abstract

Graph Convolutional Network (GCN) has been widely applied in transportation demand prediction due to its excellent ability to capture non-Euclidean spatial dependence among station-level or regional transportation demands. However, in most of the existing research, the graph convolution was implemented on a heuristically generated adjacency matrix, which could neither reflect the real spatial relationships of stations accurately, nor capture the multi-level spatial dependence of demands adaptively. To cope with the above problems, this paper provides a novel graph convolutional network for transportation demand prediction. Firstly, a novel graph convolution architecture is proposed, which has different adjacency matrices in different layers and all the adjacency matrices are self-learned during the training process. Secondly, a layer-wise coupling mechanism is provided, which associates the upper-level adjacency matrix with the lower-level one. It also reduces the scale of parameters in our model. Lastly, a unitary network is constructed to give the final prediction result by integrating the hidden spatial states with gated recurrent unit, which could capture the multi-level spatial dependence and temporal dynamics simultaneously. Experiments have been conducted on two real-world datasets, NYC Citi Bike and NYC Taxi, and the results demonstrate the superiority of our model over the state-of-the-art ones.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1609/aaai.v35i5.16591

Cites

8 of 8 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 8 references

Cited by

See all 188

Metadata

Authors
Ye, J., Sun, L., Du, B., Fu, Y., & Xiong, H.
Venue
Proceedings of the AAAI Conference on Artificial Intelligence
Published
2021-05-18
Volume
35
Issue
5
Pages
4617-4625
ISSN
  • 2159-5399 (ISSN-L)
  • 2374-3468
OpenAlex
W3176075655
Cited by
188
References
8
FWCI
67.73
Type
conference paper
Language
en
Open access
diamond

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Coupled Layer-wise Graph Convolution for Transportation Demand Prediction. https://app.cochat.ai/papers/10.1609/aaai.v35i5.16591
The paper
Ye, J., Sun, L., Du, B., Fu, Y., & Xiong, H. (2021). Coupled Layer-wise Graph Convolution for Transportation Demand Prediction. Proceedings of the AAAI Conference on Artificial Intelligence. https://doi.org/10.1609/aaai.v35i5.16591

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.