Embedding of time series data by using dynamic time warping distances

Authors:
Yuko Mizuhara;Akira Hayashi;Nobuo Suematsu
Affiliations:
Graduate School of Information Sciences, Hiroshima City University, Hiroshima, 731-3194 Japan (Currently with Panasonic AVC Networks, Kadoma, 571-8505 Japan);Graduate School of Information Sciences, Hiroshima City University, Hiroshima, 731-3194 Japan;Graduate School of Information Sciences, Hiroshima City University, Hiroshima, 731-3194 Japan
Venue:
Systems and Computers in Japan
Year:
2006

Citing 0
Cited 2

Invariant time-series classification

ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Dimensionality reduction via isomap with lock-step and elastic measures for time series gene expression classification

EvoBIO'13 Proceedings of the 11th European conference on Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an approach to embedding time series data in a vector space based on the distances obtained from Dynamic Time Warping (DTW), and classifying them in the embedded space. Under the problem formulation in which both labeled data and unlabeled data are given beforehand, we consider three embeddings: embedding in a Euclidean space by MDS, embedding in a pseudo-Euclidean space, and embedding in a Euclidean space by the Laplacian eigenmap technique. We have found through analysis and experiment that embedding by the Laplacian eigenmap method leads to the best classification results. Furthermore, the proposed approach with Laplacian eigenmap embedding gives better performance than the k nearest neighbor method. © 2006 Wiley Periodicals, Inc. Syst Comp Jpn, 37(3): 1–9, 2006; Published online in Wiley InterScience (). DOI 10.1002/scj.20486