A Review on Time Series Dimensionality Reduction
نویسندگان
چکیده
منابع مشابه
DROP: Dimensionality Reduction Optimization for Time Series
Dimensionality reduction is a critical step in analytics pipelines for high-volume, high-dimensional time series. Principal Component Analysis (PCA) is frequently the method of choice for many applications, yet is often prohibitively expensive for large datasets. Many theoretical means of accelerating PCA via sampling have recently been proposed, but these techniques typically treat PCA as a re...
متن کاملDimensionality Reduction and Filtering on Time Series Sensor Streams
This chapter surveys fundamental tools for dimensionality reduction and filtering of time series streams, illustrating what it takes to apply them efficiently and effectively to numerous problems. In particular, we show how least-squares based techniques (auto-regression and principal component analysis) can be successfully used to discover correlations both across streams, as well as across ti...
متن کاملDimensionality Reduction in Time Series: A PLA-Block-Sorting Method
We address the data reduction in time series problem through a combination of two newly developed algorithms. The first is a modified version of the Douglas-Peucker Algorithm (DPA) for short-term redundancy reduction. The second is an alternative to the classical statistic methods for long-term redundancy reduction and is based on block sorting. The block sorting technique is inspired from the ...
متن کاملModel selection using dimensionality reduction of time series characteristics
To find the best forecasting model, several methods are usually tried on training dataset and the best one is selected to forecast the testing dataset. In this paper, we propose a model which selects a forecasting method based on its previous performance on similar dataset assuming that we have historical database of predictor’s performance. Thus, we need to obtain the characteristics of time s...
متن کاملDimensionality Reduction for Stationary Time Series via Stochastic Nonconvex Optimization
Stochastic optimization naturally arises in machine learning. E cient algorithms with provable guarantees, however, are still largely missing, when the objective function is nonconvex and the data points are dependent. This paper studies this fundamental challenge through a streaming PCA problem for stationary time series data. Specifically, our goal is to estimate the principle component of ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: HELIX
سال: 2018
ISSN: 2277-3495,2319-5592
DOI: 10.29042/2018-3957-3960