A Weighted Distance Measure for Calculating the Similarity of Sparsely Distributed Trajectories

This article presents a method for the calculating similarity of two trajectories. The method is especially designed for a situation where the points of the trajectories are distributed sparsely and at non-equidistant intervals. The proposed method is based on giving different weights to different points: points that are close to each other get smaller weights than the points that do not have neighbors nearby. The effectiveness of the method was tested with 12 data sets generated from two benchmark data sets. The classifying accuracy of the proposed similarity measure was compared with three other methods, such as dynamic time warping, and it was noted that the new proposed method classifies instances mainly more accurately and faster than the other three methods.

[1]  Juha Röning,et al.  Efficient Algorithm for Calculating Similarity between Trajectories Containing an Increasing Dimension , 2006, Artificial Intelligence and Applications.

[2]  Donald J. Berndt,et al.  Using Dynamic Time Warping to Find Patterns in Time Series , 1994, KDD Workshop.

[3]  Yun-tao Qian,et al.  Markov model based time series similarity measuring , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[4]  Stan Salvador,et al.  FastDTW: Toward Accurate Dynamic Time Warping in Linear Time and Space , 2004 .

[5]  Eamonn J. Keogh,et al.  Making Time-Series Classification More Accurate Using Learned Constraints , 2004, SDM.

[6]  Ronald R. Coifman,et al.  Local discriminant bases , 1994, Optics & Photonics.

[7]  Hong Guo,et al.  Automotive signal fault diagnostics - part I: signal fault analysis, signal segmentation, feature extraction and quasi-optimal feature selection , 2003, IEEE Trans. Veh. Technol..

[8]  Qiang Wang,et al.  A symbolic representation of time series , 2005, Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005..

[9]  Eamonn J. Keogh,et al.  Scaling and time warping in time series querying , 2005, The VLDB Journal.

[10]  Alberto O. Mendelzon,et al.  Querying Time Series Data Based on Similarity , 2000, IEEE Trans. Knowl. Data Eng..

[11]  Michael Unser,et al.  Wavelet Applications in Signal and Image Processing II: 27-29 July 1994, San Diego, California , 1994 .

[12]  Shusaku Tsumoto,et al.  Mining similar temporal patterns in long time-series data and its application to medicine , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[13]  Eamonn J. Keogh,et al.  Mining motifs in massive time series databases , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[14]  Dimitrios Gunopulos,et al.  Discovering similar multidimensional trajectories , 2002, Proceedings 18th International Conference on Data Engineering.

[15]  Wesley W. Chu,et al.  Efficient searches for similar subsequences of different lengths in sequence databases , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).