Zelong Li

Zelong Li

Auto-generated profile, based on publicly available information

Zelong Li

JD Logistics, Beijing, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 May 2024 in Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies
Verified
Journal Article
Open access
ZHZhiqing Hong
Zhiqing Hong
ZLZelong Li
Zelong Li
SZShuxin Zhong
Shuxin Zhong
WLWenjun Lyu
Wenjun Lyu
HWHaotian Wang
Haotian Wang
DZDesheng Zhang
Desheng Zhang
The increasing availability of low-cost wearable devices and smartphones has significantly advanced the field of sensor-based human activity recognition (HAR), attracting considerable research interest. One of the major challenges in HAR is the domain shift problem in cross-dataset activity recognition, which occurs due to variations in users, device types, and sensor placements between the source dataset and the target dataset. Although domain adaptation methods have shown promise, they typically require access to the target dataset during the training process, which might not be practical in some scenarios. To address these issues, we introduce CrossHAR, a new HAR model designed to improve model performance on unseen target datasets. CrossHAR involves three main steps: (i) CrossHAR explores the sensor data generation principle to diversify the data distribution and augment the raw sensor data. (ii) CrossHAR then employs a hierarchical self-supervised pretraining approach with the augmented data to develop a generalizable representation. (iii) Finally, CrossHAR fine-tunes the pretrained model with a small set of labeled data in the source dataset, enhancing its performance in cross-dataset HAR. Our extensive experiments across multiple real-world HAR datasets demonstrate that CrossHAR outperforms current state-of-the-art methods by 10.83% in accuracy, demonstrating its effectiveness in generalizing to unseen target datasets.

3 August 2025
Verified
Conference Paper
Open access
ZHZhiqing Hong
Zhiqing Hong
YSYiwei Song
Yiwei Song
ZLZelong Li
Zelong Li
AYAnlan Yu
Anlan Yu
SZShuxin Zhong
Shuxin Zhong
DZDesheng Zhang
Desheng Zhang

21 October 2024
Verified
Conference Paper
Open access
GYGuang Yang
Guang Yang
MTMeiqi Tu
Meiqi Tu
ZLZelong Li
Zelong Li
JHJinquan Hang
Jinquan Hang
TLTaichi Liu
Taichi Liu
DZDesheng Zhang
Desheng Zhang
Illegal parking prediction is a crucial problem to help stakeholders with better urban planning and management. Existing works advance the field by capturing complex traffic correlations from spatial and temporal perspectives using deep learning models, and achieve state-of-the-art performance. However, current works do not consider the unique perspective from the illegal parking data collection process carried out by patrol officers, which can reflect a wealth of knowledge gained from each officer's on-the-ground experiences for more effective patrol. In this paper, we propose a novel behavior-aware hypergraph convolutional network named BHIPP for city-wide illegal parking prediction. To better represent the correlations of illegal parking events from patrol officers' perspective, we construct a new patrol hypergraph integrating patrol officers' experience alongsie multi-source contextual information. Additionally, we design a behavior-aware hypergraph convolutional network, which captures the complex and high-order illegal parking event correlations with officers' patrol behaviors explicitly considered. Further, we introduce a spatial-temporal illegal parking approximation module to estimate parking violations in under-patrolled regions using both historical and multi-source contextual data. Extensive experiments on real-world datasets demonstrate the superiority of our proposed BHIPP compared with a broad range of state-of-the-art baseline models across varying spatial-temporal granularities, from both regression and ranking aspects.

20 April 2026
Verified
Conference Paper
Open access
ZHZhiqing Hong
Zhiqing Hong
ZLZelong Li
Zelong Li
XFXiubin Fan
Xiubin Fan
GYGuang Yang
Guang Yang
BGBaoshen Guo
Baoshen Guo
DZDesheng Zhang
Desheng Zhang