Data representation for time series data mining: time domain approaches
Author:
- 25 December 2016
- journal article
- research article
- Published by Wiley in WIREs Computational Statistics
- Vol. 9 (1)
Abstract
In most time series data mining, alternate forms of data representation or data preprocessing is required because of the unique characteristics of time series, such as high dimension (the number of data points), presence of random noise, and nonlinear relationship of the data elements. Therefore, any data representation method aims to achieve substantial data reduction to a manageable size, while preserving important characteristics of the original data, and robustness to random noise. Moreover, appropriate choice of a data representation method may result in meaningful data mining. Many high level representation methods of time series data are based on time domain approaches. These methods preprocess the original data in the time domain directly and are useful to understand the behavior of data over time. Piecewise approximation, data representation by identification important points, and symbolic representation are some of the main ideas of time domain approaches, and widely used in various fields. WIREs Comput Stat 2017, 9:e1392. doi: 10.1002/wics.1392This article is categorized under: Statistical and Graphical Methods of Data Analysis > Dimension Reduction Statistical and Graphical Methods of Data Analysis > Data Reduction, Smoothing, and FilteringKeywords
This publication has 9 references indexed in Scilit:
- Time-series data miningACM Computing Surveys, 2012
- A review on time series data miningEngineering Applications of Artificial Intelligence, 2011
- Compression of time series by extracting major extremaJournal of Experimental & Theoretical Artificial Intelligence, 2010
- Mining Time Series Data2009
- Experiencing SAX: a novel symbolic representation of time seriesData Mining and Knowledge Discovery, 2007
- A symbolic representation of time series, with implications for streaming algorithms2003
- Dimensionality Reduction for Fast Similarity Search in Large Time Series DatabasesKnowledge and Information Systems, 2001
- Locally adaptive dimensionality reduction for indexing large time series databasesACM SIGMOD Record, 2001
- The hybrid tree: an index structure for high dimensional feature spaces1999