Published on Fri Jan 29 2016

Kernels for sequentially ordered data

Franz J Király, Harald Oberhauser

We present a novel framework for kernel learning with sequential data of any kind. Our approach is based on signature features which can be seen as an ordered variant of sample(cross-)moments. The sequential kernels are efficiently computable for discrete sequences.

0
0
0
Abstract

We present a novel framework for kernel learning with sequential data of any kind, such as time series, sequences of graphs, or strings. Our approach is based on signature features which can be seen as an ordered variant of sample (cross-)moments; it allows to obtain a "sequentialized" version of any static kernel. The sequential kernels are efficiently computable for discrete sequences and are shown to approximate a continuous moment form in a sampling sense. A number of known kernels for sequences arise as "sequentializations" of suitable static kernels: string kernels may be obtained as a special case, and alignment kernels are closely related up to a modification that resolves their open non-definiteness issue. Our experiments indicate that our signature-based sequential kernel framework may be a promising approach to learning with sequential data, such as time series, that allows to avoid extensive manual pre-processing.

Mon Jan 26 2015
Machine Learning
On a Family of Decomposable Kernels on Sequences
In many applications data is naturally presented in terms of orderings of some basic elements or symbols. Reasoning about such data requires a notion of similarity capable of handling sequences of different lengths. In this paper we describe a family of Mercer kernel functions for such sequentially structured data.
0
0
0
Fri Jun 26 2020
Machine Learning
The Signature Kernel is the solution of a Goursat PDE
The signature kernel is a learning tool with potential to handle irregularly sampled, multivariate time series. The authors introduced a kernel trick for the truncated version of this kernel avoiding the exponential complexity involved in a direct computation.
1
0
0
Sun Oct 20 2019
Artificial Intelligence
Rational Kernels: A survey
Many kinds of data are naturally amenable to being treated as sequences. Using such data with statistical learning techniques can often prove to be cumbersome. The framework of rational kernels partly addresses this problem by providing an elegant representation.
0
0
0
Fri Oct 06 2006
Machine Learning
A kernel for time series based on global alignments
0
0
0
Sat Apr 18 2020
Machine Learning
Kernels for time series with irregularly-spaced multivariate observations
Time series are an interesting frontier for kernel-based methods. There is no kernel designed to represent them and their unique characteristics in full generality. Existing sequential kernels ignore the time indices, with many assuming that the series must be regularly-spaced.
0
0
0
Fri Nov 29 2019
Machine Learning
Embedding and learning with signatures
The signature method is based on an embedding principle. It is shown that a specific embedding, called lead-lag, is systematically the strongest performer across all datasets and algorithms considered.
1
0
0