Efficient Kernel-based Subsequence Search for User Identification from Walking Activity

06/11/2019
by   Candelieri Antonio, et al.
0

This paper presents an efficient approach for subsequence search in data streams. The problem consists in identifying coherent repetitions of a given reference time-series, eventually multi-variate, within a longer data stream. Dynamic Time Warping (DTW) is the metric most widely used to implement pattern query, but its computational complexity is a well-known issue. In this paper we present an approach aimed at learning a kernel able to approximate DTW to be used for efficiently analyse streaming data collected from wearable sensors, reducing the burden of computation. Contrary to kernel, DTW allows for comparing time series with different length. Thus, to use a kernel, a feature embedding is used to represent a time-series as a fixed length vector. Each vector component is the DTW between the given time-series and a set of 'basis' series, usually randomly chosen. The vector size is the number of basis series used for the feature embedding. Searching for the portion of the data stream minimizing the DTW with the reference subsequence leads to a global optimization problem. The proposed approach has been validated on a benchmark dataset related to the identification of users depending on their walking activity. A comparison with a traditional DTW implementation is also provided.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 8

09/14/2018

Random Warping Series: A Random Features Method for Time-Series Embedding

Time series data analytics has been a problem of substantial interests f...
04/18/2020

Kernels for time series with irregularly-spaced multivariate observations

Time series are an interesting frontier for kernel-based methods, for th...
02/10/2020

Time Series Alignment with Global Invariances

In this work we address the problem of comparing time series while takin...
01/04/2011

Autoregressive Kernels For Time Series

We propose in this work a new family of kernels for variable-length time...
03/07/2022

S-Rocket: Selective Random Convolution Kernels for Time Series Classification

Random convolution kernel transform (Rocket) is a fast, efficient, and n...
08/28/2021

A new rotating machinery fault diagnosis method based on the Time Series Transformer

Fault diagnosis of rotating machinery is an important engineering proble...
08/14/2018

Plato: Approximate Analytics over Compressed Time Series with Tight Deterministic Error Guarantees

Plato provides sound and tight deterministic error guarantees for approx...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.