Chuanming Chen

Mr. Chuanming Chen


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
Verified
Journal Article
Open access
PDF file
QYQingying Yu
Qingying Yu
YLYonglong Luo
Yonglong Luo
CCChuanming Chen
Chuanming Chen
Xiaoyao ZhengXiaoyao Zheng
Xiaoyao Zheng
The results of road congestion detection can be used for the rational planning of travel routes and as guidance for traffic management. The trajectory data of moving objects can record their positions at each moment and reflect their moving features. Utilizing trajectory mining technology to effectively identify road congestion locations is of great importance and has practical value in the fields of traffic and urban planning. This paper addresses the issue by proposing a novel approach to detect road congestion locations based on trajectory stay-place clustering. First, this approach estimates the speed status of each time-stamped location in each trajectory. Then, it extracts the stay places of the trajectory, each of which is denoted as a seven-tuple containing information such as starting and ending time, central coordinate, average direction difference, and so on. Third, the time-stamped locations included in stay places are partitioned into different stay-place equivalence classes according to the timestamps. Finally, stay places in each equivalence class are clustered to mine the congestion locations of multiple trajectories at a certain period of time. Visual representation and experimental results on real-life cab trajectory datasets show that the proposed approach is suitable for the detection of congestion locations at different timestamps.

8 March 2022 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
QYQingying Yu
Qingying Yu
FHFan Hu
Fan Hu
ZYZhen Ye
Zhen Ye
CCChuanming Chen
Chuanming Chen
LSLiping Sun
Liping Sun
YLYonglong Luo
Yonglong Luo
Accurately mapping the raw global position system (GPS) trajectories to the road network is the basis for studying the application of trajectory data. This study proposes a novel off-line map matching algorithm based on road network topology, to address the problems of low execution efficiency and poor matching accuracy of selective look-ahead map matching (SLAMM) algorithm. First, the noise points of the trajectory data are removed by data preprocessing. Second, the algorithm searches for critical samples in the trajectory data and segments the data accordingly. Then, the adjacent road segments around the transition node corresponding to the critical sample are selected as candidate arcs. Finally, the segmented trajectory data are matched to the road network by constructing an error ellipse. The algorithm fully considers the topology of the road network and the characteristics of high-frequency trajectory data. The experimental results, using Beijing trajectory data to perform matching on an actual road network environment, show that the proposed algorithm is more efficient and robust than other map matching algorithms for high-frequency trajectories.

Verified
Journal Article
Open access
PDF file
QYQingying Yu
Qingying Yu
CCChuanming Chen
Chuanming Chen
LSLiping Sun
Liping Sun
Xiaoyao ZhengXiaoyao Zheng
Xiaoyao Zheng
Urban hotspot area detection is an important issue that needs to be explored for urban planning and traffic management. It is of great significance to mine hotspots from taxi trajectory data, which reflect residents’ travel characteristics and the operational status of urban traffic. The existing clustering methods mainly concentrate on the number of objects contained in an area within a specified size, neglecting the impact of the local density and the tightness between objects. Hence, a novel algorithm is proposed for detecting urban hotspots from taxi trajectory data based on nearest neighborhood-related quality clustering techniques. The proposed spatial clustering algorithm not only considers the maximum clustering in a limited range but also considers the relationship between each cluster center and its nearest neighborhood, effectively addressing the clustering issue of unevenly distributed datasets. As a result, the proposed algorithm obtains high-quality clustering results. The visual representation and simulated experimental results on a real-life cab trajectory dataset show that the proposed algorithm is suitable for inferring urban hotspot areas, and that it obtains better accuracy than traditional density-based methods.

Verified
Journal Article
Open access
PDF file
CCChuanming Chen
Chuanming Chen
DXDongsheng Xu
Dongsheng Xu
QYQingying Yu
Qingying Yu
SGShan Gong
Shan Gong
GSGege Shi
Gege Shi
WCWen Chen
Wen Chen
Abnormal-trajectory detection can be used to detect fraudulent behavior by taxi drivers when carrying passengers. Existing methods usually detect abnormal trajectories based on the characteristics of “few and different”, which require large data sets and, therefore, may identify “few and near” trajectories chosen by drivers according to their driving experience as abnormal situations. This study proposed an abnormal-trajectory detection method based on a variable grid to address this problem. First, the urban road network was divided into three regions: high-, medium-, and low-density road network regions using a kernel density analysis method. Second, grids with different sizes were set for different types of road network regions; trajectory tuples were obtained based on the grid division results, and the abnormality rate of the trajectory was calculated. Finally, a trajectory-abnormality probability function was developed to calculate the deviation of each trajectory from the benchmark trajectory to detect abnormal trajectories. Experimental results on a real taxi trajectory dataset demonstrated that the proposed method achieved a higher accuracy in detecting abnormal trajectories than similar methods.

17 December 2019 in IEEE Access
Verified
Journal Article
Open access
HLHui Li
Hui Li
DPDechang Pi
Dechang Pi
CCChuanming Chen
Chuanming Chen
HLHongyi Li
Hongyi Li
In the prediction of zinc-binding sites in proteins, there are few real binding-site residues, whereas most residues are non-binding-site residues, resulting in a typical imbalanced classification problem. This paper proposes a novel method, SSWPNN (an ensemble of support vector machine and sample-weighted probabilistic neural network), based on downsampling and an ensemble of different classifiers, in view of the imbalance of zinc-binding sites in proteins. Multiple random downsampling techniques without replacement are performed on the whole set, and the support vector machine is trained as the base classifier on each subset to calculate the weights of samples, while the sample-weighted probabilistic neural network is constructed as a strong classifier for prediction. The experimental results showed that our method is superior to other methods not only in the overall prediction performance for the four types of residues but also in the prediction performance for any type of residue. The results of experimental testing on an independent test set collected by the authors in recent years showed that our method achieved better prediction performance than others not only for the four types of residues overall but also for any one type of residue. In addition, the importance of the features selected by the method is analyzed by reducing certain feature to calculate the scores of the performance index. The source code and datasets are available at http://net.jitsec.cn:88/UploadedImages/SSWPNN.rar.

Verified
Journal Article
Open access
PDF file
QYQingying Yu
Qingying Yu
FHFan Hu
Fan Hu
CCChuanming Chen
Chuanming Chen
LSLiping Sun
Liping Sun
Xiaoyao ZhengXiaoyao Zheng
Xiaoyao Zheng
Numerous Global Positioning System connected vehicles are collecting extensive data remotely in cities, enabling data-driven infrastructure planning. To truly benefit from this emerging technology, it is important to combine telematics and map data to make it easier to extract and mine useful information from the data. By performing map matching, data points that cannot be accurately located on the road network can be projected onto the correct road segment. As an important means of remote data processing, it has become an important pre-processing step in the field of data mining. However, due to the various errors of location devices and the complexity of road networks, map matching technology also faces great challenges. In order to improve the efficiency and accuracy of the map matching algorithm, this study proposes an offline method for low-frequency trajectory data map matching based on vehicle trajectory segmentation. First, the trajectory is segmented based on the vehicle’s travel direction. Then, the comprehensive probability of the corresponding road segment is calculated based on the spatial probability and the directional probability of each road segment around the location. Third, the k candidate matching paths under consideration are selected based on the comprehensive probability evaluation. Finally, the shortest path planning and the probability calculation of the different candidate paths are combined to find the optimal matching path. The experimental results on the real trajectory dataset in Shanghai and the road network environment show that the proposed algorithm has better accuracy, efficiency, and robustness than other algorithms.