Zemu Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zemu Liu has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Gangyi Ding
School of Computer Science, Beijing Institute of Technology, Beijing, China
3 shared publications - Tianyu Huang
School of Computer Science, Beijing Institute of Technology, Beijing, China
3 shared publications - Zhida Qin
School of Computer Science, Beijing Institute of Technology, Beijing, China
3 shared publications - Chong Zhang
Faculty of Electronic and Information Engineering, Xian Jiaotong University, Xian, China
1 shared publication - Haoyan Fu
Beijing Institute of Technology, Beijing, China
1 shared publication - Pengzhan Zhou
College of Computer Science, Chongqing University, Chongqing, China
1 shared publication
Latest Publications
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1507-1518
Bridging Behavior and Semantics for Time-aware Cross-Domain Sequential Recommendation
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1507-1518
Open AccessBridging Behavior and Semantics for Time-aware Cross-Domain Sequential Recommendation
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 6091-6102
Bridging Time and Domains: A Time-aware Framework for Cross-Domain Sequential Recommendation
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 6091-6102
Open AccessBridging Time and Domains: A Time-aware Framework for Cross-Domain Sequential Recommendation
- 24 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (14) , 27379-27392
Dynamic Graph Convolution and Spatiotemporal Self-Attention Network for Traffic Flow Prediction
As a typical spatiotemporal series prediction task, traffic flow prediction has found wide application in intelligent transportation systems (ITS). Despite some progress, several unresolved issues persist. Many existing works calculate the dependencies between nodes based on stable long-term traffic data. However, the short-term dependencies are dynamically changing over time, and neglecting them would cause a decrease in predictive performance. In this article, we propose a novel dynamic graph convolution and spatiotemporal self-attention (DGSTA) network for traffic flow prediction. Specifically, considering the large amount of short-term and the dynamic dependencies between nodes, we design a new dynamic graph convolution module, which generates adjacency matrices for each time step in a day to dynamically capture the changing short-term dependencies. Additionally, we utilize a multihead spatiotemporal self-attention module to, respectively, extract static spatial and temporal correlations between nodes. Furthermore, we design a sequential embedding to explicitly model the long-term correlation between nodes. Extensive experiments conducted on three real-world datasets demonstrate that DGSTA exhibits high competitiveness. The code and data are available at https://github.com/lzmmm30/DGSTA.
- 24 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (14) , 27379-27392
Dynamic Graph Convolution and Spatiotemporal Self-Attention Network for Traffic Flow Prediction
As a typical spatiotemporal series prediction task, traffic flow prediction has found wide application in intelligent transportation systems (ITS). Despite some progress, several unresolved issues persist. Many existing works calculate the dependencies between nodes based on stable long-term traffic data. However, the short-term dependencies are dynamically changing over time, and neglecting them would cause a decrease in predictive performance. In this article, we propose a novel dynamic graph convolution and spatiotemporal self-attention (DGSTA) network for traffic flow prediction. Specifically, considering the large amount of short-term and the dynamic dependencies between nodes, we design a new dynamic graph convolution module, which generates adjacency matrices for each time step in a day to dynamically capture the changing short-term dependencies. Additionally, we utilize a multihead spatiotemporal self-attention module to, respectively, extract static spatial and temporal correlations between nodes. Furthermore, we design a sequential embedding to explicitly model the long-term correlation between nodes. Extensive experiments conducted on three real-world datasets demonstrate that DGSTA exhibits high competitiveness. The code and data are available at https://github.com/lzmmm30/DGSTA.