Name
Abstract | ||
|---|---|---|
One of the advantages of the kernel methods is that they can deal with various kinds of objects, not necessarily vectorial data with a fixed number of attributes. In this paper, we develop kernels for time series data using dynamic time warping (DTW) distances. Since DTW distances are pseudo distances that do not satisfy the triangle inequality, a kernel matrix based on them is not positive semidefinite, in general. We use semidefinite programming (SDP) to guarantee the positive definiteness of a kernel matrix. We present neighborhood preserving embedding (NPE), an SDP formulation to obtain a kernel matrix that best preserves the local geometry of time series data. We also present an out-of-sample extension (OSE) for NPE. We use two applications, time series classification and time series embedding for similarity search, to validate our approach. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1587/transinf.E92.D.51 | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS |
Keywords | Field | DocType |
DTW, SDP, SVM | Kernel (linear algebra),Dynamic time warping,Pattern recognition,Kernel embedding of distributions,Computer science,Algorithm,Tree kernel,Kernel principal component analysis,Artificial intelligence,Kernel method,Variable kernel density estimation,Semidefinite programming | Journal |
Volume | Issue | ISSN |
E92D | 1 | 1745-1361 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hiroyuki Narita | 1 | 2 | 0.71 |
| Yasumasa Sawamura | 2 | 2 | 0.71 |
| Akira Hayashi | 3 | 51 | 9.08 |