DBScholar

Back to papers

BigST: Linear Complexity Spatio-Temporal Graph Neural Network for Traffic Forecasting on Large-Scale Road Networks

Summary: BigST is a linear-complexity STGNN that encodes node-wise long-range sequences via a precomputable low-dimensional feature extractor and a linearized global spatial convolution to distill time-varying graph structure. Scales to ~100k-node road networks, delivering improved accuracy and runtime for long-horizon traffic forecasting versus quadratic-cost baselines. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13546
Venue
VLDB
Year
2024
Pagerank
6.9431109e-05
Overall Rank
4,038 | 72.30%
DOI
10.14778/3641204.3641217

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{han_vldb24,
        title = {{BigST: Linear Complexity Spatio-Temporal Graph Neural Network for Traffic Forecasting on Large-Scale Road Networks}},
        author = {Han, Jindong and Zhang, Weijia and Liu, Hao and Tao, Tao and Tan, Naiqiang and Xiong, Hui},
        journal = {PVLDB},
        series = {{VLDB} '24},
        volume = {17},
        number = {5},
        pages = {1081--1090},
        doi = {10.14778/3641204.3641217},
        url = {https://doi.org/10.14778/3641204.3641217},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers