Thank you for providing this awesome library. It really helps me a lot in learning different temporal graphs.
When comparing the paper, "T-GCN: A Temporal Graph Convolutional Network for Traffic Prediction" with the TGCN model implemented in this library, I meet one question regarding the calculation of the Laplacian matrix.
The paper does not directly use the normalized graph Laplacian. Instead, it uses 1st-order approximation (Eq. (2) in the paper). While the TGCN in this library seems to directly use the normalized graph Laplacian:
Thank you for providing this awesome library. It really helps me a lot in learning different temporal graphs.
When comparing the paper, "T-GCN: A Temporal Graph Convolutional Network for Traffic Prediction" with the TGCN model implemented in this library, I meet one question regarding the calculation of the Laplacian matrix.
The paper does not directly use the normalized graph Laplacian. Instead, it uses 1st-order approximation (Eq. (2) in the paper). While the TGCN in this library seems to directly use the normalized graph Laplacian:
https://github.com/LibCity/Bigscity-LibCity/blob/30c760662603efe8edbb498a27fed801640d09a0/libcity/model/traffic_speed_prediction/TGCN.py#L24
Should the code change by adding a self-connection matrix?
See the code provided by the original authors:
(https://github.com/lehaifeng/T-GCN/blob/master/T-GCN/T-GCN-TensorFlow/utils.py#L25)
Thank you!