Computer Science – Computer Vision and Pattern Recognition
Scientific paper
2006-10-06
Computer Science
Computer Vision and Pattern Recognition
Scientific paper
10.1109/ICASSP.2007.366260
We propose in this paper a new family of kernels to handle times series, notably speech data, within the framework of kernel methods which includes popular algorithms such as the Support Vector Machine. These kernels elaborate on the well known Dynamic Time Warping (DTW) family of distances by considering the same set of elementary operations, namely substitutions and repetitions of tokens, to map a sequence onto another. Associating to each of these operations a given score, DTW algorithms use dynamic programming techniques to compute an optimal sequence of operations with high overall score. In this paper we consider instead the score spanned by all possible alignments, take a smoothed version of their maximum and derive a kernel out of this formulation. We prove that this kernel is positive definite under favorable conditions and show how it can be tuned effectively for practical applications as we report encouraging results on a speech recognition task.
Birkenes Oystein
Cuturi Marco
Matsui Tomoko
Vert Jean-Philippe
No associations
LandOfFree
A kernel for time series based on global alignments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A kernel for time series based on global alignments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A kernel for time series based on global alignments will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-634020