Online Segmentation of Time Series Based on Polynomial Least-Squares Approximations

Authors:
Erich Fuchs;Thiemo Gruber;Jiri Nitschke;Bernhard Sick
Affiliations:
University of Passau, Passau;Univerisity of Applied Sciences, Deggendorf;University of Passau, Passau;Univerisity of Applied Sciences, Deggendorf
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
2010

Citing 0
Cited 8

On-line motif detection in time series with SwiftMotif

Pattern Recognition
Online signature verification with support vector machines based on LCSS kernel functions

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on gait analysis
Temporal data mining using shape space representations of time series

Neurocomputing
An adaptive algorithm for online time series segmentation with error bound guarantee

Proceedings of the 15th International Conference on Extending Database Technology
An adaptive approach for online segmentation of multi-dimensional mobile data

MobiDE '12 Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
Real-Time recognizing human hand gestures

ICIRA'12 Proceedings of the 5th international conference on Intelligent Robotics and Applications - Volume Part III
Symbolic representation of smart meter data

Proceedings of the Joint EDBT/ICDT 2013 Workshops
OBST-based segmentation approach to financial time series

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.15

Visualization

Abstract

The paper presents SwiftSeg, a novel technique for online time series segmentation and piecewise polynomial representation. The segmentation approach is based on a least-squares approximation of time series in sliding and/or growing time windows utilizing a basis of orthogonal polynomials. This allows the definition of fast update steps for the approximating polynomial, where the computational effort depends only on the degree of the approximating polynomial and not on the length of the time window. The coefficients of the orthogonal expansion of the approximating polynomial—obtained by means of the update steps—can be interpreted as optimal (in the least-squares sense) estimators for average, slope, curvature, change of curvature, etc., of the signal in the time window considered. These coefficients, as well as the approximation error, may be used in a very intuitive way to define segmentation criteria. The properties of SwiftSeg are evaluated by means of some artificial and real benchmark time series. It is compared to three different offline and online techniques to assess its accuracy and runtime. It is shown that SwiftSeg—which is suitable for many data streaming applications—offers high accuracy at very low computational costs.