BEATS: Blocks of Eigenvalues Algorithm for Time series Segmentation
- 19 March 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1
Abstract
The massive collection of data via emerging technologies like the Internet of Things (IoT) requires finding optimal ways to reduce the observations in the time series analysis domain. The IoT time series require aggregation methods that can preserve and represent the key characteristics of the data. In this paper, we propose a segmentation algorithm that adapts to unannounced mutations of the data (i.e. data drifts). The algorithm splits the data streams into blocks and groups them in square matrices, computes the Discrete Cosine Transform (DCT) and quantizes them. The key information is contained in the upper-left part of the resulting matrix. We extract this sub-matrix, compute the modulus of its eigenvalues and remove duplicates. The algorithm, called BEATS, is designed to tackle dynamic IoT streams, whose distribution changes over time. We implement experiments with six datasets combining real, synthetic, real-world data, and data with drifts. Compared to other segmentation methods like Symbolic Aggregate approXimation (SAX), BEATS shows significant improvements. Trying it with classification and clustering algorithms it provides efficient results. BEATS is an effective mechanism to work with dynamic and multi-variate data, making it suitable for IoT data sources. The datasets, code of the algorithm and the analysis results can be accessed publicly at: https://github.com/auroragonzalez/BEATS.Keywords
Funding Information
- European Commission (CNECT-ICT-643943, H2020 FIESTA, H2020- ENTROPY-649849)
- Ministerio de Economía y Competitividad (BES-2015-071956, TIN2017-86885-R)
This publication has 43 references indexed in Scilit:
- Studying and modelling dynamic biological processes using time-series gene expression dataNature Reviews Genetics, 2012
- Experimental comparison of representation methods and distance measures for time series dataData Mining and Knowledge Discovery, 2012
- Weighted dynamic time warping for time series classificationPattern Recognition, 2011
- Faster retrieval with a two-pass dynamic-time-warping lower boundPattern Recognition, 2009
- Particle swarm optimization for parameter determination and feature selection of support vector machinesExpert Systems with Applications, 2008
- Fast segmentation algorithms for long hydrometeorological time seriesHydrological Processes, 2008
- Discrimination of Arabica and Robusta in Instant Coffee by Fourier Transform Infrared Spectroscopy and ChemometricsJournal of Agricultural and Food Chemistry, 1996
- The JPEG still picture compression standardIEEE Transactions on Consumer Electronics, 1992
- Fast algorithms for the discrete W transform and for the discrete Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- A fast cosine transform in one and two dimensionsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1980