Dynamic time warping constraint learning for large margin nearest neighbor classification
Information Sciences: an International Journal
Boundary-based lower-bound functions for dynamic time warping and their indexing
Information Sciences: an International Journal
Time series classification by class-specific Mahalanobis distance measures
Advances in Data Analysis and Classification
| Hi-index | 0.00 |
Most machine learning and data mining algorithms for time series datasets need a suitable distance measure. In addition to classic p-norm distance, numerous other distance measures exist and the most popular is Dynamic Time Warping. Here we propose a new distance measure, called Adaptable Time Warping (ATW), which generalizes all previous time warping distances. We present a learning process using a genetic algorithm that adapts ATW in a locally optimal way, according to the current classification issue we have to resolve. It's possible to prove that ATW with optimal parameters is at least equivalent or at best superior to the other time warping distances for all classification problems. We show this assertion by performing comparative tests on two real datasets. The originality of this work is that we propose a whole learning process directly based on the distance measure rather than on the time series themselves.