Abstract

With the development and acceleration of urbanization, urban metro traffic is gradually growing up to a large network, and the structure of topology between stations becomes more complex, which makes it increasingly difficult to capture the spatial dependency. The vertical and horizontal interlacing of multiple lines makes the stations distributed topologically, and the traditional graph convolution is implemented on the adjacency matrix generated based on a priori knowledge, which cannot reflect the actual spatial dependence between stations. To address these problems, this paper proposes an adaptive graph convolutional network model (Adapt-GCN), which replaces the fixed adjacency matrix obtained from a priori knowledge in the traditional GCN with a trainable adaptive adjacency matrix. This can not only effectively adjust the weights of correlations between adjacent stations, but also adaptively capture the spatial dependencies between non-adjacent stations. This paper uses the Shanghai Metro dataset to verify the effectiveness of the model in improving prediction accuracy and reducing training time.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.