Jie Bao

Jie Bao

Auto-generated profile, based on publicly available information

Jie Bao

JD iCity, JD Technology, Beijing, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
20 August 2019 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
ZDZikun Deng
Zikun Deng
DWDi Weng
Di Weng
JCJiahui Chen
Jiahui Chen
RLRen Liu
Ren Liu
ZWZhibin Wang
Zhibin Wang
YWYingcai Wu
Yingcai Wu
Air pollution has become a serious public health problem for many cities around the world. To find the causes of air pollution, the propagation processes of air pollutants must be studied at a large spatial scale. However, the complex and dynamic wind fields lead to highly uncertain pollutant transportation. The state-of-the-art data mining approaches cannot fully support the extensive analysis of such uncertain spatiotemporal propagation processes across multiple districts without the integration of domain knowledge. The limitation of these automated approaches motivates us to design and develop AirVis, a novel visual analytics system that assists domain experts in efficiently capturing and interpreting the uncertain propagation patterns of air pollution based on graph visualizations. Designing such a system poses three challenges: a) the extraction of propagation patterns; b) the scalability of pattern presentations; and c) the analysis of propagation processes. To address these challenges, we develop a novel pattern mining framework to model pollutant transportation and extract frequent propagation patterns efficiently from large-scale atmospheric data. Furthermore, we organize the extracted patterns hierarchically based on the minimum description length (MDL) principle and empower expert users to explore and analyze these patterns effectively on the basis of pattern topologies. We demonstrated the effectiveness of our approach through two case studies conducted with a real-world dataset and positive feedback from domain experts.

27 July 2021 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
SRSijie Ruan
Sijie Ruan
XFXi Fu
Xi Fu
CLCheng Long
Cheng Long
ZXZi Xiong
Zi Xiong
JBJie Bao
Jie Bao
YZYu Zheng
Yu Zheng
Nowadays, couriers are still the main solution to address the "last mile" problem in logistics. They are usually required to record the delivery time of each parcel manually, which is essential for delivery insurances, delivery performance evaluations, and customer available time discovery. Stay points extracted from couriers' trajectories provide a chance to fill the delivery time automatically to ease their burdens. However, it is challenging due to inaccurate delivery locations and various stay scenarios. To this end, we propose the improved Delivery Time Inference (DTInf+), to infer the delivery time of waybills based on couriers' trajectories. Our solution is composed of three steps: 1) Data Pre-processing, which organizes waybills and stay points by delivery trips, 2) Delivery Location Mining, which obtains the delivery location for each address and each Geocoded waybill location by mining historical delivery caused stay points, and 3) Delivery Event-based Matching, which jointly selects the best-matched stay point for waybills at the same delivery location based on Pointer Network-like model SPSelector to infer the delivery time. Extensive experiments and case studies based on real-world datasets from JD Logistics confirm the effectiveness of our approach. Finally, a system powered by DTInf+ is deployed in JD Logistics.

9 December 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
Shuliang WangShuliang Wang
Shuliang Wang
QYQianyu Yang
Qianyu Yang
SRSijie Ruan
Sijie Ruan
CLCheng Long
Cheng Long
YYYe Yuan
Ye Yuan
YZYu Zheng
Yu Zheng
Intelligent logistics relies on accurately predicting the service time, which is a part of time cost in the last-mile delivery. However, service time prediction (STP) is non-trivial given complex delivery circumstances, location heterogeneity, and skewed observations in space, which are not well-handled by existing solutions. In our prior work, we treat STP at each location as a learning task to keep the location heterogeneity, propose a prior knowledge-enhanced meta-learning to tackle skewed observations, and introduce a Transformer-based representation module to encode complex delivery circumstances. Maintaining the design principles of prior work, in this extended paper, we propose MetaSTP+. In addition to fusing the prior knowledge after the meta-learning process, MetaSTP+ also injects the prior knowledge before and during the meta-learning process to better tackle skewed observations. More specifically, MetaSTP+ completes the support set of tasks with scarce samples from other tasks based on prior knowledge and is equipped with a prior knowledge-aware historical observation encoding module to achieve those purposes accordingly. Experiments show MetaSTP+ outperforms the best baseline by 11.2% and 8.4% on two real-world datasets. Finally, an intelligent waybill assignment system based on MetaSTP+ is deployed in JD Logistics.

17 June 2025 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
RLRuiyuan Li
Ruiyuan Li
ZCZechao Chen
Zechao Chen
RLRuyun Lu
Ruyun Lu
XXXiaolong Xu
Xiaolong Xu
GYGuangchao Yang
Guangchao Yang
YZYu Zheng
Yu Zheng
In IoT (Internet of Things) scenarios, massive floating-point time series data are generated in a streaming manner and transmitted within limited bandwidth for real-time analysis. To enhance the efficiency, it is acknowledged to compress the data before transmission. Existing floating-point compression methods are either for batched compression that may cause long delays, or for streaming lossless compression that has an unsatisfactory compression ratio when certain errors are allowed. In this paper, we propose the first Streaming ERror-bounded Floating-point compression Serf , which has two implementations: Serf-Qt and Serf-XOR . Serf-Qt first quantizes each floating-point value into an integer, and then encodes the integer with Elias gamma coding. Serf-XOR is the first lossy floating-point compression based on the XORing operation. To enhance the compression ratio of Serf-XOR , we propose a novel data offset technique to increase the leading zeros of the XORed values, and design a novel approximation technique to search for an error-qualified value that produces an XORed value with many trailing zeros. To improve the compression efficiency, we propose a pruning strategy to accelerate the process of approximated values search. We further build a streaming transmission prototype system based on a real development board, and deploy the proposed methods to it. Extensive experiments using 13 datasets show that, compared with 17 competitors, both Serf-Qt and Serf-XOR enjoy remarkable compression ratios with high efficiency in streaming scenarios. The transmission experiments based on the proposed system also showcase that Serf-XOR always takes the least overall time when the bandwidth is limited.

13 August 2024 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
RLRuiyuan Li
Ruiyuan Li
JLJiajun Li
Jiajun Li
MZMinxin Zhou
Minxin Zhou
RWRubin Wang
Rubin Wang
HHHuajun He
Huajun He
YZYu Zheng
Yu Zheng
The rapid development of positioning technology produces an extremely large volume of spatio-temporal data with various geometry types such as point, line string, polygon, or a mixed combination of them. As one of the most fundamental but time-consuming operations, $k$ nearest neighbors join ($k$NN join) has attracted much attention. However, most existing works for $k$NN join either ignore temporal information or consider only point data. Besides, most of them do not automatically adapt to the different features of spatio-temporal data. This paper proposes to address a novel and useful problem, i.e., ST-$k$NN join, which considers both spatial closeness and temporal concurrency. To support ST-$k$NN join over a large amount of spatio-temporal data with any geometry types efficiently, we propose a novel distributed solution based on Apache Spark. Specifically, our method adopts a two-round join framework. In the first round join, we propose a new spatio-temporal partitioning method that achieves spatio-temporal locality and load balance at the same time. We also propose a lightweight index structure, i.e., Time Range Count Index (TRC-index), to enable efficient ST-$k$NN join. In the second round join, to reduce the data transmission among different machines, we remove duplicates based on spatio-temporal reference points before shuffling local results. Furthermore, we design a set of models based on Bayesian optimization to automatically determine the values for the introduced parameters. Extensive experiments are conducted using three real big datasets, showing that our method is much more scalable and achieves 9X faster than baselines, and that the proposed models can always predict appropriate parameters for different datasets.

2 March 2025 in Journal of Visualization
Verified
Journal Article
Closed access
PDF file
JTJunxiu Tang
Junxiu Tang
HRHuimin Ren
Huimin Ren
ZDZikun Deng
Zikun Deng
DWDi Weng
Di Weng
TTTan Tang
Tan Tang
YWYingcai Wu
Yingcai Wu