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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Shawe-Taylor, J., Cristianini, N.: Kernel Methods for Pattern Analysis. Cambridge University Press, Cambridge (2004)
Corres, C., Vapnik, V.: Support vector networks. Machine Learning 20, 273–297 (1995)
Schölkopf, B., Smola, A., Müller, K.: Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation 10, 1299–1319 (1998)
Rabiner, L., Juang, B.: Fundamentals of Speech Recognition. Prentice-Hall, Englewood Cliffs (1993)
Shimodaira, H., Noma, K., Nakai, M., Sagayama, S.: Dynamic time-alignment kernel in support vector machine. In: Neural Information Processing Systems 14, pp. 921–928. MIT Press, Cambridge (2002)
Bahlmann, C., Haasdonk, B., Burkhardt, H.: On-line handwriting recognition with support vector machines-a kernel approach. In: Proc. 8th Int. W/S on Frontiers in Handwriting Recognition, pp. 49–54 (2002)
Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38(1), 49–95 (1996)
Lanckriet, G., Christianini, N., Barlett, P., Ghaoui, L., Jordan, M.: Learning the kernel matrix with semidifinite programming. Journal of Machine Learning Research 5, 27–72 (2004)
Weinberger, K.Q., Sha, F., Saul, L.K.: Learning a kernel matrix for nonlinear dimensionality reduction. In: Proc. 21st Int. Conf. on Machine Learning (ICML 2004), pp. 839–846 (2004)
Lu, F., Keles, S., Wright, S., Wahba, G.: Framework for kernel regularization with application to protein clustering. PNAS 102(35), 12332–12337 (2005)
Hayashi, A., Mizuhara, Y., Suematsu, N.: Embedding time series data for classification. In: Perner, P., Imiya, A. (eds.) MLDM 2005. LNCS (LNAI), vol. 3587, pp. 356–365. Springer, Heidelberg (2005)
Hayashi, A., Nisizaki, K., Suematsu, N.: Fast similarity search of time series data using the nystrom method. In: ICDM 2005 Workshop on Temporal Data Mining, pp. 157–164 (2005)
Haasdonk, B., Bahlmann, C.: Learning with distance substitution kernels. In: Rasmussen, C.E., Bülthoff, H.H., Schölkopf, B., Giese, M.A. (eds.) DAGM 2004. LNCS, vol. 3175, pp. 220–227. Springer, Heidelberg (2004)
Toh, K., Tütüncü, R., Todd, M.: Solving semidefinite-quadratic-linear programming using sdpt3. Mathematical Programming 95, 180–217 (2003)
Friedman, J., Bentley, J., Finkel, R.: An algorithm for finding the best matches in logarithmic expected time. ACM Trans. Mathematical Software 3(3), 209–226 (1977)
Kadous, W.: Australian sign language data in the uci kdd archive (1995), http://www.cse.unsw.edu.au/~waleed/tml/data/
Cole, R., Muthusamy, Y., Fanty, M.: The ISOLET spoken letter database. Technical Report CS/E 90-004 (1990)
Cox, T., Cox, M.: Multidimensional Scaling. Chapman and Hall, Boca Raton (2001)
Bengio, Y., Vincent, P., Paiement, J.: Learning eigenfunctions links spectral embedding and kernel pca. Neural Computation 16(10), 2197–2219 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Narita, H., Sawamura, Y., Hayashi, A. (2008). Learning a Kernel Matrix for Time Series Data from DTW Distances. In: Ishikawa, M., Doya, K., Miyamoto, H., Yamakawa, T. (eds) Neural Information Processing. ICONIP 2007. Lecture Notes in Computer Science, vol 4985. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69162-4_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-69162-4_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69159-4
Online ISBN: 978-3-540-69162-4
eBook Packages: Computer ScienceComputer Science (R0)