Xiao Xuan Wang

Xiao Xuan Wang


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
24 August 2023 in Electronics
Verified
Journal Article
Open access
PDF file
WXWen Xiong
Wen Xiong
XWXiao Xuan Wang
Xiao Xuan Wang
HLHao Li
Hao Li
Every day, hundreds of thousands of vehicles, including buses, taxis, and ride-hailing cars, continuously generate GPS positioning records. Simultaneously, the traffic big data platform of urban transportation systems has already collected a large amount of GPS trajectory datasets. These incremental and historical GPS datasets require more and more storage space, placing unprecedented cost pressure on the big data platform. Therefore, it is imperative to efficiently compress these large-scale GPS trajectory datasets, saving storage cost and subsequent computing cost. However, a set of classical trajectory compression algorithms can only be executed in a single-threaded manner and are limited to running in a single-node environment. Therefore, these trajectory compression algorithms are insufficient to compress this incremental data, which often amounts to hundreds of gigabytes, within an acceptable time frame. This paper utilizes Spark, a popular big data processing engine, to parallelize a set of classical trajectory compression algorithms. These algorithms consist of the DP (Douglas–Peucker), the TD-TR (Top-Down Time-Ratio), the SW (Sliding Window), SQUISH (Spatial Quality Simplification Heuristic), and the V-DP (Velocity-Aware Douglas–Peucker). We systematically evaluate these parallelized algorithms on a very large GPS trajectory dataset, which contains 117.5 GB of data produced by 20,000 taxis. The experimental results show that: (1) It takes only 438 s to compress this dataset in a Spark cluster with 14 nodes; (2) These parallelized algorithms can save an average of 26% on storage cost, and up to 40%. In addition, we design and implement a pipeline-based solution that automatically performs preprocessing and compression for continuous GPS trajectories on the Spark platform.

15 September 2023 in Electronics
Verified
Journal Article
Open access
PDF file
QZQian Zou
Qian Zou
WXWen Xiong
Wen Xiong
XWXiao Xuan Wang
Xiao Xuan Wang
FQFukun Qin
Fukun Qin
Bus transportation system has become the primary mode of traffic for urban residents. Every day, thousands of buses provide services for millions of passengers. Efficiently monitoring bus trajectories is essential for evaluating service quality and ensuring public safety. In this study, we propose a Flink-based solution to detect anomalies for bus trajectories in real time. Specifically, it can identify two types of anomalies. The first type is when a bus deviates from its designated route during a trip. The second type is when a bus arrives at a scheduled stop along its route but fails to stop. This solution employs CEP (Complex Event Processing) to determine bus arrival events and control the detection process. In this process, it utilizes the state management mechanism to save and update a bus’s actual trajectory, which is derived from the raw GPS trajectory and maintained as a stop sequence. Subsequently, it uses LCSS (Longest Common Subsequence) to measure the trajectory similarity between the actual bus trajectory and the scheduled route. We validate the solution using a large-scale real dataset in a Flink cluster with six virtual machines. The experimental results show that (1) each core can handle anomaly detection on 12.5 buses simultaneously and (2) the detection accuracies of the two anomalies are 90.5% and 89.3%, respectively.

5 December 2025 in EPJ Data Science
Verified
Journal Article
Open access
PDF file
PJPeijie Jin
Peijie Jin
CLChunhu Luo
Chunhu Luo
XWXiao Xuan Wang
Xiao Xuan Wang
PTPan Tan
Pan Tan
WXWen Xiong
Wen Xiong
Spatial co-location patterns (SCPs) are sets of spatial features with instances frequently co-occurring proximally in geographical space. Extracting SCPs i

1 August 2024
Verified
Book Chapter
Closed access
PDF file
PJPeijie Jin
Peijie Jin
XWXiao Xuan Wang
Xiao Xuan Wang
WXWen Xiong
Wen Xiong
LWLizhen Wang
Lizhen Wang
SGSong Gao
Song Gao

25 June 2025 in Research Square
Verified
Preprint
Open access
PDF file
PJPeijie Jin
Peijie Jin
XWXiao Xuan Wang
Xiao Xuan Wang
PTPan Tan
Pan Tan
WXWen Xiong
Wen Xiong
Spatial co-location patterns (SCPs) are sets of spatial features with instances frequently co-occurring proximally in geographical space. Extracting SCPs is crucial for understanding urban space structure and function. Given that spatial datasets frequently exhibit non-uniform density distributions, such characteristics impose significant limitations and constraints on classical spatial co-location pattern (SCP) mining algorithms in accurately capturing the nuanced proximity relationships among spatial instances. This paper introduces a new materialized model with γ-quasi-clique to comprehensively and flexibly capture complex instance spatial relations. However, the γ-quasi-clique's structural relaxation can violate downward closure in certain cases, and exhaustive clique enumeration for co-location identification is computationally challenging. To address these problems, we develop a novel neighbor relationship function and a shared scoring mechanism to avoid instance over-counting in this paper. We also implement candidate feature and pattern filtering strategies to reduce computational complexity, along with a filtering-verification framework for participation instance determination. Empirical evaluations on three real-world datasets show the γ-quasi-clique framework's theoretical advantage and the proposed algorithms' computational efficiency.