IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i19p3694-d936831.html
   My bibliography  Save this article

Application of an Adaptive Adjacency Matrix-Based Graph Convolutional Neural Network in Taxi Demand Forecasting

Author

Listed:
  • Jian-You Xu

    (College of Information Science and Engineering, Northeastern University, Shenyang 110819, China)

  • Shuo Zhang

    (College of Information Science and Engineering, Northeastern University, Shenyang 110819, China)

  • Chin-Chia Wu

    (Department of Statistics, Feng Chia University, Taichung 40724, Taiwan)

  • Win-Chin Lin

    (Department of Statistics, Feng Chia University, Taichung 40724, Taiwan)

  • Qing-Li Yuan

    (College of Information Science and Engineering, Northeastern University, Shenyang 110819, China)

Abstract

Accurate forecasting of taxi demand has facilitated the rational allocation of urban public transport resources, reduced congestion in urban transport networks, and shortened passenger waiting time. However, virtual station discovery and modelling of the demand when forecasting through graph convolutional neural networks remains challenging. In this study, the virtual station discovery problem was addressed by using a two-stage clustering approach, which considers the geographical and load characteristics of taxi demand. Furthermore, a fusion model combining non-negative matrix decomposition and a graph convolutional neural network was proposed in order to extract the features of the nodes for dimension reduction and adaptive adjacency matrix computation. By the construction of a local processing structure, further extraction of the local characteristics of the demand was achieved. The experimental results show that the method in this study outperforms state-of-the-art methods in terms of the root mean square error and average absolute value error. Therefore, the model proposed in this study is able to achieve accurate forecasting of taxi demand.

Suggested Citation

  • Jian-You Xu & Shuo Zhang & Chin-Chia Wu & Win-Chin Lin & Qing-Li Yuan, 2022. "Application of an Adaptive Adjacency Matrix-Based Graph Convolutional Neural Network in Taxi Demand Forecasting," Mathematics, MDPI, vol. 10(19), pages 1-17, October.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:19:p:3694-:d:936831
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/19/3694/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/19/3694/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Daniel D. Lee & H. Sebastian Seung, 1999. "Learning the parts of objects by non-negative matrix factorization," Nature, Nature, vol. 401(6755), pages 788-791, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Del Corso, Gianna M. & Romani, Francesco, 2019. "Adaptive nonnegative matrix factorization and measure comparisons for recommender systems," Applied Mathematics and Computation, Elsevier, vol. 354(C), pages 164-179.
    2. P Fogel & C Geissler & P Cotte & G Luta, 2022. "Applying separative non-negative matrix factorization to extra-financial data," Working Papers hal-03689774, HAL.
    3. Xiao-Bai Li & Jialun Qin, 2017. "Anonymizing and Sharing Medical Text Records," Information Systems Research, INFORMS, vol. 28(2), pages 332-352, June.
    4. Naiyang Guan & Lei Wei & Zhigang Luo & Dacheng Tao, 2013. "Limited-Memory Fast Gradient Descent Method for Graph Regularized Nonnegative Matrix Factorization," PLOS ONE, Public Library of Science, vol. 8(10), pages 1-10, October.
    5. Spelta, A. & Pecora, N. & Rovira Kaltwasser, P., 2019. "Identifying Systemically Important Banks: A temporal approach for macroprudential policies," Journal of Policy Modeling, Elsevier, vol. 41(1), pages 197-218.
    6. M. Moghadam & K. Aminian & M. Asghari & M. Parnianpour, 2013. "How well do the muscular synergies extracted via non-negative matrix factorisation explain the variation of torque at shoulder joint?," Computer Methods in Biomechanics and Biomedical Engineering, Taylor & Francis Journals, vol. 16(3), pages 291-301.
    7. Markovsky, Ivan & Niranjan, Mahesan, 2010. "Approximate low-rank factorization with structured factors," Computational Statistics & Data Analysis, Elsevier, vol. 54(12), pages 3411-3420, December.
    8. Paul Fogel & Yann Gaston-Mathé & Douglas Hawkins & Fajwel Fogel & George Luta & S. Stanley Young, 2016. "Applications of a Novel Clustering Approach Using Non-Negative Matrix Factorization to Environmental Research in Public Health," IJERPH, MDPI, vol. 13(5), pages 1-14, May.
    9. Le Thi Khanh Hien & Duy Nhat Phan & Nicolas Gillis, 2022. "Inertial alternating direction method of multipliers for non-convex non-smooth optimization," Computational Optimization and Applications, Springer, vol. 83(1), pages 247-285, September.
    10. Zhaoyu Xing & Yang Wan & Juan Wen & Wei Zhong, 2024. "GOLFS: feature selection via combining both global and local information for high dimensional clustering," Computational Statistics, Springer, vol. 39(5), pages 2651-2675, July.
    11. Chae, Bongsug (Kevin), 2018. "The Internet of Things (IoT): A Survey of Topics and Trends using Twitter Data and Topic Modeling," 22nd ITS Biennial Conference, Seoul 2018. Beyond the boundaries: Challenges for business, policy and society 190376, International Telecommunications Society (ITS).
    12. Jingfeng Guo & Chao Zheng & Shanshan Li & Yutong Jia & Bin Liu, 2022. "BiInfGCN: Bilateral Information Augmentation of Graph Convolutional Networks for Recommendation," Mathematics, MDPI, vol. 10(17), pages 1-16, August.
    13. Jianfei Cao & Han Yang & Jianshu Lv & Quanyuan Wu & Baolei Zhang, 2023. "Estimating Soil Salinity with Different Levels of Vegetation Cover by Using Hyperspectral and Non-Negative Matrix Factorization Algorithm," IJERPH, MDPI, vol. 20(4), pages 1-15, February.
    14. Wang, Ketong & Porter, Michael D., 2018. "Optimal Bayesian clustering using non-negative matrix factorization," Computational Statistics & Data Analysis, Elsevier, vol. 128(C), pages 395-411.
    15. Lei, Da & Cheng, Long & Wang, Pengfei & Chen, Xuewu & Zhang, Lin, 2024. "Identifying service bottlenecks in public bikesharing flow networks," Journal of Transport Geography, Elsevier, vol. 116(C).
    16. Semi Min & Juyong Park, 2019. "Modeling narrative structure and dynamics with networks, sentiment analysis, and topic modeling," PLOS ONE, Public Library of Science, vol. 14(12), pages 1-20, December.
    17. Zhang, Lifeng & Chao, Xiangrui & Qian, Qian & Jing, Fuying, 2022. "Credit evaluation solutions for social groups with poor services in financial inclusion: A technical forecasting method," Technological Forecasting and Social Change, Elsevier, vol. 183(C).
    18. Wentao Qu & Xianchao Xiu & Huangyue Chen & Lingchen Kong, 2023. "A Survey on High-Dimensional Subspace Clustering," Mathematics, MDPI, vol. 11(2), pages 1-39, January.
    19. Anna Luiza Silva Almeida Vicente & Alexei Novoloaca & Vincent Cahais & Zainab Awada & Cyrille Cuenin & Natália Spitz & André Lopes Carvalho & Adriane Feijó Evangelista & Camila Souza Crovador & Rui Ma, 2022. "Cutaneous and acral melanoma cross-OMICs reveals prognostic cancer drivers associated with pathobiology and ultraviolet exposure," Nature Communications, Nature, vol. 13(1), pages 1-15, December.
    20. Guillote, Simon & Perron, Francois & Segers, Johan, 2018. "Bayesian Inference For Bivariate Ranks," LIDAM Discussion Papers ISBA 2018005, Université catholique de Louvain, Institute of Statistics, Biostatistics and Actuarial Sciences (ISBA).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2022:i:19:p:3694-:d:936831. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.