The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Predicting origin-destination ride-sourcing demand with a spatio-temporal encoder-decoder residual multi-graph convolutional network
Open accessAbstract
With the rapid development of mobile-internet technologies, on-demand ride-sourcing services have become increasingly popular and largely reshaped the way people travel. Demand prediction is one of the most fundamental components in supply-demand management systems of ride-sourcing platforms. With accurate short-term prediction for origin-destination (OD) demand, the platforms make precise and timely decisions on real-time matching, idle vehicle reallocations and ride-sharing vehicle routing, etc. Compared to zone-based demand prediction that has been examined by many previous studies, OD-based demand prediction is more challenging. This is mainly due to the complicated spatial and temporal dependencies among demand of different OD pairs. To overcome this challenge, we propose the Spatio-Temporal Encoder-Decoder Residual Multi-Graph Convolutional network (ST-ED-RMGC), a novel deep learning model for predicting ride-sourcing demand of various OD pairs. Firstly, the model constructs OD graphs, which utilize adjacent matrices to characterize the non-Euclidean pair-wise geographical and semantic correlations among different OD pairs. Secondly, based on the constructed graphs, a residual multi-graph convolutional (RMGC) network is designed to encode the contextual-aware spatial dependencies, and a long-short term memory (LSTM) network is used to encode the temporal dependencies, into a dense vector space. Finally, we reuse the RMGC networks to decode the compressed vector back to OD graphs and predict the future OD demand. Through extensive experiments on the for-hire-vehicles datasets in Manhattan, New York City, we show that our proposed deep learning framework outperforms the state-of-arts by a significant margin.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Deep Residual Learning for Image Recognition
He, K., Zhang, X., Ren, S., & Sun, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.90 · Cited by 235,474
XGBoost: A Scalable Tree Boosting System
Chen, T., & Guestrin, C. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939785 · Cited by 54,569
A Comprehensive Survey on Graph Neural Networks
Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Yu, P. S. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2978386 · Cited by 11,000 · cited 1×
“To see a comprehensive review on GCNs, readers may refer to Wu et al. (2019).”
BackgroundGraph Convolutional Neural Networks for Web-Scale Recommender Systems
Ying, R., He, R., Chen, K., Eksombatchai, P., Hamilton, W. L., & Leskovec, J. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3219890 · Cited by 3,733
Attention Based Spatial-Temporal Graph Convolutional Networks for Traffic Flow Forecasting
Guo, S., Lin, Y., Feng, N., Song, C., & Wan, H. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.3301922 · Cited by 3,123
Large-Scale Learnable Graph Convolutional Networks
Gao, H., Wang, Z., & Ji, S. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3219947 · Cited by 638 · cited 1×
“Others directly perform convolution operations in the original graph domain by aggregating the features of neighboring nodes (Gao et al. 2018; Monti et al. 2017).”
Background
Cited by
Graph neural network for traffic forecasting: A survey
Jiang, W., & Luo, J. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.117921 · Cited by 1,316
Graph Neural Networks for Intelligent Transportation Systems: A Survey
Rahmani, S., Baghbani, A., Bouguila, N., & Patterson, Z. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2023.3257759 · Cited by 353
How to Build a Graph-Based Deep Learning Architecture in Traffic Domain: A Survey
Ye, J., Zhao, J., Ye, K., & Xu, C. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2020.3043250 · Cited by 281
Self-citationShaygan, M., Meese, C., Li, W., Zhao, X. (., & Nejad, M. (2022) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2022.103921 · Cited by 267
Coordinating matching, rebalancing and charging of electric ride-hailing fleet under hybrid requests
Yu, X., Zhu, Z., Mao, H., Hua, M., Li, D., Chen, J., & Xu, H. (2023) · Transportation Research Part D: Transport and Environment · doi:10.1016/j.trd.2023.103903 · Cited by 12
Self-citation
Metadata
- Authors
- Ke, J., Qin, X., Yang, H., Zheng, Z., Zhu, Z., & Ye, J.
- Venue
- Transportation Research Part C: Emerging Technologies
- Publisher
- Elsevier BV
- Published
- 2021-01
- Volume
- 122
- Pages
- 102858
- ISSN
- 2331-8422 (ISSN-L)
- 0968-090X
- OpenAlex
- W3109254449
- Cited by
- 222
- References
- 6
- Type
- posted content
- Language
- en
- Open access
- green
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
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.