Wen Xiong

Dr. Wen Xiong


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
6 October 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
SSShuyan Si
Shuyan Si
WXWen Xiong
Wen Xiong
XCXingliang Che
Xingliang Che
Due to the rapid development of the mobile Internet and the Internet of Things, the volume of generated data keeps growing. The topic of data quality has gained increasing attention recently. Numerous studies have explored various data quality (DQ) problems across several fields, with corresponding effective data-cleaning strategies being researched. This paper begins with a comprehensive and systematic review of studies related to DQ. On the one hand, we classify these DQ-related studies into six types: redundant data, missing data, noisy data, erroneous data, conflicting data, and sparse data. On the other hand, we discuss the corresponding data-cleaning strategies for each DQ type. Secondly, we examine DQ issues and potential solutions for a public bus transportation system, utilizing a real-world traffic big data platform. Finally, we provide two representative examples, noise filtering and filling missing values, to demonstrate the DQ improvement practice. The experimental results show that: (1) The GPS noise filtering solution we proposed surpasses the baseline and achieves an accuracy of 97%; (2) The multi-source data fusion method can achieve a 100% missing repair rate (MRR) for bus arrival and departure. The average relative error (ARE) of bus arrival and departure times at stations is less than 1%, and the correlation coefficient (R) is also close to 1. Our research can offer guidance and lessons for enhancing data governance and quality improvement in the bus transportation system.

14 November 2024 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
RGRui Guo
Rui Guo
WXWen Xiong
Wen Xiong
YZYungang Zhang
Yungang Zhang
YHYanfang Hu
Yanfang Hu

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.

22 November 2024 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
XCXingliang Che
Xingliang Che
WXWen Xiong
Wen Xiong
XZXian Zhang
Xian Zhang
XZXitong Zhang
Xitong Zhang

7 July 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
WHWanbing Huang
Wanbing Huang
WXWen Xiong
Wen Xiong
XWXiaoxuan Wang
Xiaoxuan Wang
Trajectory similarity search (TSS) is a common operation for spatiotemporal data analysis. However, the existing TSS methods are mainly focused on GPS trajectories produced by moving objects such as vehicles. Further, these corresponding optimization strategies cannot be directly applied in the metro scenario because the metro passenger trajectory is totally different from the GPS trajectory. To fill this gap, we systematically analyze the unique spatiotemporal characteristics of metro passenger trajectories and propose a similarity search solution named PMMTss for the metro system. The core idea of this solution has two key points: first, we design a multi-layer index based on the spatiotemporal feature of metro trajectories, and all points of a trajectory are stored in this index. Second, we design a parallel multi-way merging-based trajectory similar search method, in which the candidate trajectory segments are merged and filtered. We evaluate this solution on a large dataset (Shenzhen Metro data for 3 consecutive months, 6.976 million trajectories with 260 million records). When lengths of input trajectories are 16, 32, and 64, respectively, the corresponding search times are 0.004 s, 0.016 s, and 0.036 s, respectively. Compared to the baseline PPJion+, the query times are reduced by 99.7%, 98.8%, and 97.6%, respectively.