Please use this identifier to cite or link to this item: /library/oar/handle/123456789/140446
Title: Sparse dynamic principal components analysis in the frequency domain
Authors: Attard, Matt
Suda, David Paul
Sammut, Fiona
Keywords: Sparse matrices -- Data processing
Principal components analysis
Time-series analysis -- Mathematical models
Multivariate analysis
Eigenvectors
Issue Date: 2025-07
Publisher: Mathematics Applications Consortium for Science & Industry (MACSI)
Citation: Attard, M., Suda, D. P., & Sammut, F. (2025, July). Sparse dynamic principal components analysis in the frequency domain. Proceedings of the 39th International Workshop on Statistical Modelling (IWSM), Limerick, 455-458.
Abstract: The main focus of this paper will be the sparsity treatment of dynamic principal components analysis (DPCA), which is an extension of principal components analysis (PCA) in a time series setting. Several sparse extensions for the high-dimensional data setting have been introduced in the past two decades. However, peer-reviewed literature addressing high-dimensionality in the DPCA setting remains scarce. This study addresses the high-dimensionality problem on the frequency-domain variant of DPCA, which replicates the classical dynamic approach on cross-spectra, the frequency domain analogue of the variancecovariance matrix. Taking cue from literature in sparse PCA, this research seeks to extend these methods on the frequency-domain DPCA via the cross-spectrum. The method being proposed is based on sparse eigenvector extraction from cross-spectral matrices with the la-penalty. Some preliminary results based on simulated data will be presented, and future research considerations set out.
URI: https://www.um.edu.mt/library/oar/handle/123456789/140446
ISBN: 9781036927110
Appears in Collections:Scholarly Works - FacSciSOR

Files in This Item:
File Description SizeFormat 
Sparse dynamic principal components analysis in the frequency domain 2025.pdf1.5 MBAdobe PDFView/Open


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.