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

DCAST: A Spatiotemporal Model with DenseNet and GRU Based on Attention Mechanism

Author

Listed:
  • Liyan Xiong
  • Lei Zhang
  • Xiaohui Huang
  • Xiaofei Yang
  • Weichun Huang
  • Hui Zeng
  • Hong Tang

Abstract

The accurate prediction of crowd flow in urban areas is becoming more and more important in many fields such as traffic management and public safety. However, the complex spatiotemporal relationship of the traffic data and the influence of events, weather, and other factors makes it very difficult to accurately predict the crowd flow. In this study, we propose a spatiotemporal prediction model that is based on densely connected convolutional networks and gated recurrent units (GRU) with the attention mechanism to predict the inflow and outflow of the crowds in regions within a specific area. The DCAST model divides the time axis into three parts: short-term dependence, period rule, and long-term dependence. For each part, we employ densely connected convolutional networks to extract spatial characteristics. Attention-based GRU module is used to capture the temporal features. And then, the outputs of the three parts are fused by weighting elementwise addition. At last, we combine the results of the fusion and external factors to predict the crowd flow in each region. The root mean square errors of the DCAST model in two real datasets of taxis in Beijing (TaxiBJ) and bikes in New York (BikeNYC) are 15.70 and 5.53, respectively. The experimental results show that the results are more accurate and reliable than that of the baseline model.

Suggested Citation

  • Liyan Xiong & Lei Zhang & Xiaohui Huang & Xiaofei Yang & Weichun Huang & Hui Zeng & Hong Tang, 2021. "DCAST: A Spatiotemporal Model with DenseNet and GRU Based on Attention Mechanism," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-12, February.
  • Handle: RePEc:hin:jnlmpe:8867776
    DOI: 10.1155/2021/8867776
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2021/8867776.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2021/8867776.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/8867776?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
    ---><---

    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:8867776. 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.