Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jie Zhao 0022

dblp:23/3168-22 · DBLP profile ↗
← Back
11ranked-venue papers
5as first author
11since 2021 · last 2025
0000-0003-0039-6220ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Computer networks · 2 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Data mining · 50% Spatial and temporal data management · 25% Knowledge graphs · 25%
Artificial intelligence
2 papers
Representation and self-supervised learning · 56% Graph learning · 44%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Smart cities and intelligent transportation · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › contrastive learning
graph contrastive learning
0.912025
HyperRegion: Integrating Graph and Hypergraph Contrastive Learning for Region Embeddings · IEEE Trans. Mob. Comput. 2025
Machine learning › Graph learning › hypergraph learning
hypergraph contrastive learning
0.912025
HyperRegion: Integrating Graph and Hypergraph Contrastive Learning for Region Embeddings · IEEE Trans. Mob. Comput. 2025
Data mining › structured data mining › graph mining
graph learning
0.912025
UniTR: A Unified Framework for Joint Representation Learning of Trajectories and Road Networks · AAAI 2025
Knowledge graphs › knowledge graph embedding
region embedding
0.912025
HyperRegion: Integrating Graph and Hypergraph Contrastive Learning for Region Embeddings · IEEE Trans. Mob. Comput. 2025
Spatial and temporal data management › trajectory data management
trajectory representation learning
0.912025
UniTR: A Unified Framework for Joint Representation Learning of Trajectories and Road Networks · AAAI 2025
Data mining › representation learning
urban region embedding
0.912025
HyperRegion: Integrating Graph and Hypergraph Contrastive Learning for Region Embeddings · IEEE Trans. Mob. Comput. 2025
Machine learning › Representation and self-supervised learning
contrastive learning
0.312025
UniTR: A Unified Framework for Joint Representation Learning of Trajectories and Road Networks · AAAI 2025
Smart cities and intelligent transportation
urban computing
0.312025
HyperRegion: Integrating Graph and Hypergraph Contrastive Learning for Region Embeddings · IEEE Trans. Mob. Comput. 2025

Methods — techniques the papers use, named apart from their topics

contrastive learning · 4.4hypergraph learning · 2.6graph neural network · 2.6hierarchical propagation · 1.7
YearPublicationVenuePosition
2025 UniTR: A Unified Framework for Joint Representation Learning of Trajectories and Road Networks
abstract
Representation learning of urban spatial-temporal data is fundamental and critical, serving a wide range of intelligent applications. Given that road networks and trajectories are inherently interrelated, their joint representation learning can significantly enhance the accuracy and utility of these applications. However, effectively learning joint representations for these two types of data remains challenging, particularly due to the complexities of interaction modeling and cross-scale optimization. To this end, we propose a unified framework, named UniTR, for joint representation learning of road networks and trajectories. Specifically, we first design a hierarchical propagation mechanism to model the complex many-to-many interactions between road networks and trajectories, thereby generating informative embeddings. Then, a triple-level contrastive optimization module is incorporated to systematically select valid positive and negative samples, further refining the embeddings. Experiments conducted on real-world datasets from two cities clearly demonstrate the effectiveness and superiority of UniTR.
Jie Zhao 0022, Chao Chen 0004, Yuanshao Zhu, Mingyu Deng, Yuxuan Liang 0002
AAAI1
2025 AgentMove: A Large Language Model based Agentic Framework for Zero-shot Next Location Prediction
abstract
Jie Feng, Yuwei Du, Jie Zhao, Yong Li. Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2025.
Jie Feng 0002, Yuwei Du, Jie Zhao 0022, Yong Li 0008
NAACL (Long Papers)3
2025 TrajAgent: An LLM-Agent Framework for Trajectory Modeling via Large-and-Small Model Collaboration
abstract
Trajectory modeling, which includes research on trajectory data pattern mining and future prediction, has widespread applications in areas such as life services, urban transportation, and public administration. Numerous methods have been proposed to address specific problems within trajectory modeling. However, the heterogeneity of data and the diversity of trajectory tasks make effective and reliable trajectory modeling an important yet highly challenging endeavor, even for domain experts. In this paper, we propose TrajAgent, a agent framework powered by large language models (LLMs), designed to facilitate robust and efficient trajectory modeling through automation modeling. This framework leverages and optimizes diverse specialized models to address various trajectory modeling tasks across different datasets effectively. In TrajAgent, we first develop UniEnv, an execution environment with a unified data and model interface, to support the execution and training of various models. Building on UniEnv, we introduce an agentic workflow designed for automatic trajectory modeling across various trajectory tasks and data. Furthermore, we introduce collaborative learning schema between LLM-based agents and small speciallized models, to enhance the performance of the whole framework effectively. Extensive experiments on four tasks using four real-world datasets demonstrate the effectiveness of TrajAgent in automated trajectory modeling, achieving a performance improvement of 2.38%-69.91% over baseline methods. The codes and data can be accessed via https://github.com/tsinghua-fib-lab/TrajAgent.
Yuwei Du, Jie Feng 0002, Jie Zhao 0022, Yong Li 0008
NeurIPS3
2025 SE-GCL: A Semantic-Enhanced Graph Contrastive Learning Framework for Road Network Embedding
abstract
Representation learning of road networks is essential for various downstream traffic-related tasks, as road network contain multi-modal data with rich information, and the learned embeddings can be directly used in machine learning models. However, due to the dynamic changes in road networks with respect to topology and associated data, as well as the local and long-range dependency caused by complex mobility semantics, learning robust and effective representations remains challenging. To this end, we exploit the properties of the road network and the mobility semantics embedded in trajectories, and propose a novel S emantic- E nhanced G raph C ontrastive L earning (SE-GCL) framework, for learning general-purpose embeddings of road networks. Specifically, in this framework, we propose (1) a multi-modal feature embedding module to capture both the attribute and visual information of road segments, (2) a semantic-enhanced graph augmentation strategy to simulate topological changes and data missing in the road network, and (3) a semantic-enhanced contrastive optimization module that leverages geo-locality and mobility semantics to guide representation learning. Extensive experiments are conducted on two real-world road networks with three representative downstream tasks. The result demonstrate that SE-GCL yields more robust and effective representations, outperforming the state-of-the-art baselines. The source code is available at https://github.com/csjiezhao/SE-GCL .
Jie Zhao 0022, Chao Chen 0004, Wanyi Zhang, Mingyu Deng, Huayan Pu, Jun Luo 0006
ACM Trans. Knowl. Discov. Data1
2025 HyperRegion: Integrating Graph and Hypergraph Contrastive Learning for Region Embeddings
abstract
Region representations (also called embeddings) are useful for various urban computing tasks. While graph-based region representation learning methods have shown outstanding performance, they encounter two major challenges: 1) the pervasive data noise and missing data can affect the quality of the constructed region graphs; and 2) high-order relationships (i.e., group-wise relationships) among regions are often insufficiently modeled and sometimes entirely overlooked. To this end, we proposeHyperRegion, an unsupervised region representation learning framework that integrates graph and hypergraph contrastive learning to learn comprehensive region embeddings from multi-modal data. Built upon a region hybrid graph network, this framework models both pair-wise and group-wise dependencies involving POI semantics, mobility patterns, geographic neighbors, and visual semantics. To mitigate the impact of data noise and missing data, graph and hypergraph contrastive learning are performed in parallel, and a cross-module contrast is further introduced to facilitate information exchange and collaboration. Extensive experiments on real-world datasets across three downstream tasks demonstrate thatHyperRegionoutperforms all baselines, particularly improving check-in prediction by reducing MAE and RMSE by approximately 8.5% and 8.2%, respectively, and increasing$R^{2}$by about 7%.
Mingyu Deng, Chao Chen 0004, Wanyi Zhang, Jie Zhao 0022, Suiming Guo, Huayan Pu, Jun Luo 0006
IEEE Trans. Mob. Comput.4
2024 Coupling Makes Better: An Intertwined Neural Network for Taxi and Ridesourcing Demand Co-Prediction
abstract
While a variety of innovative travel modes, such as taxi service and ridesourcing service, have been launched to improve the transportation efficiency, people still encounter travel problems in real life. The major cause is the imbalance between transportation supply and demand. To strike a balance, it is well-recognized that an accurate and timely passenger demand prediction model is the foundation to enable high-level human intelligence (i.e., taxi drivers) or machine intelligence (i.e., ride-hailing platforms) to allocate resources in advance. Although quite a lot of deep models have been designed to model the complicated spatial and temporal dependencies in a data-driven way, they focus on the demand prediction of a single mode and ignore the fact that passengers may shift between different modes, especially between taxis and ridesourcing cars. In this paper, we target a co-prediction problem that considers the prediction of taxi and ridesourcing as two coupled and associated tasks, and propose a novel Temporal and Spatial Intertwined Network (TSIN) that consists of two twin components and an intertwined component. Each twin in the TSIN model is able to extract spatial and temporal dependencies from its corresponding travel mode separately (i.e., intra-mode features), and the in-between intertwined component is designed to bridge the twins and allow them to exchange information (i.e., inter-mode features), thus enabling better prediction. We first evaluate our model on four real-world datasets. Results demonstrate the outstanding performance of our model and the necessity to take into account the influence between modes. Based on an additional demand data from bike in NYC, we then discuss the generalizability in coupling more transportation modes. Further results demonstrate that our proposed intertwined neural network is highly flexible and extendable, and can yield better prediction performance.
Jie Zhao 0022, Chao Chen 0004, Wanyi Zhang, Fuqiang Gu, Songtao Guo, Jun Luo 0006, Yu Zheng 0004
IEEE Trans. Intell. Transp. Syst.1
2024 A Novel Framework for Joint Learning of City Region Partition and Representation
abstract
The proliferation of multimodal big data in cities provides unprecedented opportunities for modeling and forecasting urban problems, such as crime prediction and house price prediction, through data-driven approaches. A fundamental and critical issue in modeling and forecasting urban problems lies in identifying suitable spatial analysis units, also known as city region partition. Existing works rely on subjective domain knowledge for static partitions, which is general and universal for all tasks. In fact, different tasks may need different city region partitions. To address this issue, we propose JLPR , a task-oriented framework for J oint L earning of region P artition and R epresentation. To make partitions fit tasks, JLPR integrates the region partition into the representation model training and learns region partitions using the supervision signal from the downstream task. We evaluate the framework on two prediction tasks (i.e., crime prediction and housing price prediction) in Chicago. Experiments show that JLPR consistently outperforms state-of-the-art partitioning methods in both tasks, which achieves above 25% and 70% performance improvements in terms of mean absolute error for crime prediction and house price prediction tasks, respectively. Additionally, we meticulously undertake three visualization case studies, which yield profound and illuminating findings from diverse perspectives, demonstrating the remarkable effectiveness and superiority of our approach.
Mingyu Deng, Wanyi Zhang, Jie Zhao 0022, Zhu Wang 0001, Mingliang Zhou 0001, Jun Luo 0002, Chao Chen 0004
ACM Trans. Multim. Comput. Commun. Appl.3
2023 Temporal super-resolution traffic flow forecasting via continuous-time network dynamics
Yi Xie 0003, Yun Xiong, Jiawei Zhang 0001, Chao Chen 0004, Yao Zhang 0009, Jie Zhao 0022, Yizhu Jiao, Jinjing Zhao, Yangyong Zhu
Knowl. Inf. Syst.6
2023 Unifying Uber and taxi data via deep models for taxi passenger demand prediction
Jie Zhao 0022, Chao Chen 0004, Hongyu Huang 0001, Chaocan Xiang
Pers. Ubiquitous Comput.1
2023 2F-TP: Learning Flexible Spatiotemporal Dependency for Flexible Traffic Prediction
abstract
Accurate traffic prediction is a critical yet challenging task in Intelligent Transportation Systems, benefiting a variety of smart services, e.g., route planning and traffic management. Although extensive efforts have been devoted to this problem, it is still not well solved due to the flexible dependency within traffic data along both spatial and temporal dimensions. In this paper, we explore the flexibility from three aspects, namely the time-varying local spatial dependency, the dynamic temporal dependency, and the global spatial dependency. Then we propose a novel Dual Graph Gated Recurrent Neural Network (DG2RNN) to effectively model all these dependencies and offer flexible (multi-step) predictions for future traffic flow. Specifically, we design a Dual Graph Convolution Module to capture the local spatial dependency from two perspectives, namely road distance and adaptive correlation. To model the dynamic temporal dependency, we firstly develop a Bidirectional Gated Recurrent Layer to capture the forward and backward sequential contexts of historical traffic flow, then combine the derived hidden states with their various contributions learned by a temporal attention mechanism. Besides, we further design a spatial attention mechanism to learn the latent global spatial dependency among all locations to facilitate the prediction. Extensive experiments on three types of real-world traffic datasets demonstrate that our model outperforms state-of-the-arts. Results also show our model has more stable performance for the flexible prediction with varying prediction horizons.
Jie Zhao 0022, Chao Chen 0004, Chengwu Liao, Hongyu Huang 0001, Huayan Pu, Jun Luo 0006, Tao Zhu 0003, Shilong Wang 0001
IEEE Trans. Intell. Transp. Syst.1
2021 AF-TCP: Traffic Congestion Prediction at Arbitrary Road Segment and Flexible Future Time
Xuefeng Xie, Jie Zhao 0022, Chao Chen 0004
ICA3PP (3)2