IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/6446941.html
   My bibliography  Save this article

A Sparse Gating Convolutional Recurrent Network for Traffic Flow Prediction

Author

Listed:
  • Xiaohui Huang
  • Jie Tang
  • Zhiying Peng
  • Zhiyi Chen
  • Hui Zeng
  • Rahib Abiyev

Abstract

With the continuous development of deep learning, more and more huge deep learning models are developed by researchers, which leads to an exponential increase of the parameters of models. Therein, the convolutional recurrent network as a type of widely used deep learning method is often employed to handle spatiotemporal data, e.g., traffic data. However, because of the large number of parameters in the model, the convolutional recurrent network needs to consume a lot of computing resources and time in the training process. To reduce the consumption of resources, we propose a sparse convolutional recurrent network with a sparse gating mechanism that is able to reduce the complexity of the network by an improved gate unit while keeping the performance of the model. We evaluate the performance of our proposed network on traffic flow datasets, and the experimental results show that the parameters of the model are significantly reduced under the condition of similar prediction accuracy compared with the traditional convolutional recurrent network.

Suggested Citation

  • Xiaohui Huang & Jie Tang & Zhiying Peng & Zhiyi Chen & Hui Zeng & Rahib Abiyev, 2022. "A Sparse Gating Convolutional Recurrent Network for Traffic Flow Prediction," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-14, February.
  • Handle: RePEc:hin:jnlmpe:6446941
    DOI: 10.1155/2022/6446941
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/6446941.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/6446941.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/6446941?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Shuoben Bi & Cong Yuan & Shaoli Liu & Luye Wang & Lili Zhang, 2022. "Spatiotemporal Prediction of Urban Online Car-Hailing Travel Demand Based on Transformer Network," Sustainability, MDPI, vol. 14(20), pages 1-21, October.

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:6446941. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.