An approach for heuristic parallel LDTW distance optimization method with bio-inspired strategy

Abstract

Dynamic time warping (DTW) is a classical similarity measure for arbitrary length time series. As an effective improvement of DTW, dynamic time warping under limited warping path length (LDTW) oppresses the long-term pathological alignment problem and allows better flexibility. However, since LDTW increases path lengths, it directly leads to higher time-consuming. In this paper, a new method of similarity sequence measurement (ACO LDTW) is proposed by the parallel computing characteristics of ant colony optimization (ACO) algorithm with bio-inspired strategy and the idea of LDTW path restriction. This algorithm searches the optimal path on the restricted distance matrix by simulating the behavior of ant colony parallel foraging. Firstly, the distance matrix is mapped to the 0− 1 matrix of grid method, and the search range of ants is limited by the warping path in LDTW. Secondly, the state transition probability function, pheromone initialization and update mechanism of ACO algorithm are adapted. On the basis of ensuring the accurate results, the convergence rate can be effectively improved. The validity of ACO LDTW is verified by cases. In the 22 data sets of 1NN classification experiment, ACO LDTW has the lowest classification error rate in 16 data sets, and it is shorter than the calculation time of LDTW. At the same time, it is applied to the field of mechanical fault diagnosis and has the ability to solve practical engineering applications. Experiments show that ACO LDTW is more effective in terms of accuracy and computation time.