邻接矩阵
计算机科学
邻接表
先验与后验
图形
依赖关系(UML)
交错
经济短缺
数据挖掘
算法
拓扑(电路)
人工智能
理论计算机科学
数学
哲学
认识论
组合数学
语言学
政府(语言学)
作者
Jianli Zhao,Rumeng Zhang,Qiuxia Sun,Jingshi Shi,Futong Zhuo,Qing Li
标识
DOI:10.1080/15472450.2023.2209913
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI