@Inbook{Tavenard2017,
author="Tavenard, Romain
and Malinowski, Simon
and Chapel, Laetitia
and Bailly, Adeline
and Sanchez, Heider
and Bustos, Benjamin",
editor="Ceci, Michelangelo
and Hollm{\'e}n, Jaakko
and Todorovski, Ljup{\v{c}}o
and Vens, Celine
and D{\v{z}}eroski, Sa{\v{s}}o",
title="Efficient Temporal Kernels Between Feature Sets for Time Series Classification",
bookTitle="Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2017, Skopje, Macedonia, September 18--22, 2017, Proceedings, Part II",
year="2017",
publisher="Springer International Publishing",
address="Cham",
pages="528--543",
abstract="In the time-series classification context, the majority of the most accurate core methods are based on the Bag-of-Words framework, in which sets of local features are first extracted from time series. A dictionary of words is then learned and each time series is finally represented by a histogram of word occurrences. This representation induces a loss of information due to the quantization of features into words as all the time series are represented using the same fixed dictionary. In order to overcome this issue, we introduce in this paper a kernel operating directly on sets of features. Then, we extend it to a time-compliant kernel that allows one to take into account the temporal information. We apply this kernel in the time series classification context. Proposed kernel has a quadratic complexity with the size of input feature sets, which is problematic when dealing with long time series. However, we show that kernel approximation techniques can be used to define a good trade-off between accuracy and complexity. We experimentally demonstrate that the proposed kernel can significantly improve the performance of time series classification algorithms based on Bag-of-Words.",
isbn="978-3-319-71246-8",
doi="10.1007/978-3-319-71246-8_32",
url="https://doi.org/10.1007/978-3-319-71246-8_32"
}