scholarly journals Research on The Effectiveness of Trajectory Similarity Measurement Algorithm

2021 ◽  
Vol 791 (1) ◽  
pp. 012020
Author(s):  
Yanfu Wu
2018 ◽  
Vol 11 (4) ◽  
pp. 486-495
Author(s):  
Ke Yi Zhou ◽  
Shaolin Hu

Purpose The similarity measurement of time series is an important research in time series detection, which is a basic work of time series clustering, anomaly discovery, prediction and many other data mining problems. The purpose of this paper is to design a new similarity measurement algorithm to improve the performance of the original similarity measurement algorithm. The subsequence morphological information is taken into account by the proposed algorithm, and time series is represented by a pattern, so the similarity measurement algorithm is more accurate. Design/methodology/approach Following some previous researches on similarity measurement, an improved method is presented. This new method combines morphological representation and dynamic time warping (DTW) technique to measure the similarities of time series. After the segmentation of time series data into segments, three parameter values of median, point number and slope are introduced into the improved distance measurement formula. The effectiveness of the morphological weighted DTW algorithm (MW-DTW) is demonstrated by the example of momentum wheel data of an aircraft attitude control system. Findings The improved method is insensitive to the distortion and expansion of time axis and can be used to detect the morphological changes of time series data. Simulation results confirm that this method proposed in this paper has a high accuracy of similarity measurement. Practical implications This improved method has been used to solve the problem of similarity measurement in time series, which is widely emerged in different fields of science and engineering, such as the field of control, measurement, monitoring, process signal processing and economic analysis. Originality/value In the similarity measurement of time series, the distance between sequences is often used as the only detection index. The results of similarity measurement should not be affected by the longitudinal or transverse stretching and translation changes of the sequence, so it is necessary to incorporate the morphological changes of the sequence into similarity measurement. The MW-DTW is more suitable for the actual situation. At the same time, the MW-DTW algorithm reduces the computational complexity by transforming the computational object to subsequences.


2014 ◽  
Vol 9 (9) ◽  
Author(s):  
Jun Shang ◽  
Chuanbo Chen ◽  
Hu Liang ◽  
He Tang ◽  
Mudar Sarem

Author(s):  
Yiwei Song ◽  
Dongzhe Jiang ◽  
Yunhuai Liu ◽  
Zhou Qin ◽  
Chang Tan ◽  
...  

Efficient representations for spatio-temporal cellular Signaling Data (SD) are essential for many human mobility applications. Traditional representation methods are mainly designed for GPS data with high spatio-temporal continuity, and thus will suffer from poor embedding performance due to the unique Ping Pong Effect in SD. To address this issue, we explore the opportunity offered by a large number of human mobility traces and mine the inherent neighboring tower connection patterns. More specifically, we design HERMAS, a novel representation learning framework for large-scale cellular SD with three steps: (1) extract rich context information in each trajectory, adding neighboring tower information as extra knowledge in each mobility observation; (2) design a sequence encoding model to aggregate the embedding of each observation; (3) obtain the embedding for a trajectory. We evaluate the performance of HERMAS based on two human mobility applications, i.e. trajectory similarity measurement and user profiling. We conduct evaluations based on a 30-day SD dataset with 130,612 users and 2,369,267 moving trajectories. Experimental results show that (1) for the trajectory similarity measurement application, HERMAS improves the Hitting Rate (HR@10) from 15.2% to 39.2%; (2) for the user profiling application, HERMAS improves the F1-score for around 9%. More importantly, HERMAS significantly improves the computation efficiency by over 30x.


2012 ◽  
Vol 182-183 ◽  
pp. 1169-1173
Author(s):  
Li Fang Yang ◽  
Xiang Lin Huang ◽  
Rui Lv ◽  
Hui Lv

For the reason that dominant colors can characterize color information of image region and can represent the image using fewer dimensions, it is one of the widely used color features in image retrieval. We extract the dominant color feature in HSV color space, and combine it with color distribution information. In this paper, a new similarity measurement algorithm based on block distance is proposed for dominant color matching. Our proposed algorithm not only takes the distance between dominant colors into account, but also the difference of the percentage of dominant colors. The average precision of our algorithm improves about 5% and about 14% respectively compared with block distance and Euclidean distance. Although the average precision of our algorithm is almost equal to quadratic form distance, the computation cost of our algorithm is obviously less than it.


Sign in / Sign up

Export Citation Format

Share Document