A Survey on Dimensionality Reduction Techniques for Time-Series Data

54Citations
Citations of this article
67Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Data analysis in modern times involves working with large volumes of data, including time-series data. This type of data is characterized by its high dimensionality, enormous volume, and the presence of both noise and redundant features. However, the 'curse of dimensionality' often causes issues for learning approaches, which can fail to capture the temporal dependencies present in time-series data. To address this problem, it is essential to reduce dimensionality while preserving the intrinsic properties of temporal dependencies. This will help to avoid lower learning and predictive performances. This study presents twelve different dimensionality reduction algorithms that are specifically suited for working with time-series data and fall into different categories, such as supervision, linearity, time and memory complexity, hyper-parameters, and drawbacks.

Cite

CITATION STYLE

APA

Ashraf, M., Anowar, F., Setu, J. H., Chowdhury, A. I., Ahmed, E., Islam, A., & Al-Mamun, A. (2023). A Survey on Dimensionality Reduction Techniques for Time-Series Data. IEEE Access, 11, 42909–42923. https://doi.org/10.1109/ACCESS.2023.3269693

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free