Principal component analysis and its generalizations for any type of sequence (PCA-Seq)

In the 1940s, Karhunen and Loève proposed a method for processing a one-dimensional numeric time series by converting it into multidimensional by shifts. In fact, a one-dimensional number series was decomposed into several orthogonal time series. This method has many times been independently develop...

Full description

Bibliographic Details
Main Authors: V. M. Efimov, K. V. Efimov, V. Y. Kovaleva
Format: Article
Language:English
Published: Siberian Branch of the Russian Academy of Sciences, Federal Research Center Institute of Cytology and Genetics, The Vavilov Society of Geneticists and Breeders 2020-01-01
Series:Вавиловский журнал генетики и селекции
Subjects:
Online Access:https://vavilov.elpub.ru/jour/article/view/2395
_version_ 1797214010690502656
author V. M. Efimov
K. V. Efimov
V. Y. Kovaleva
author_facet V. M. Efimov
K. V. Efimov
V. Y. Kovaleva
author_sort V. M. Efimov
collection DOAJ
description In the 1940s, Karhunen and Loève proposed a method for processing a one-dimensional numeric time series by converting it into multidimensional by shifts. In fact, a one-dimensional number series was decomposed into several orthogonal time series. This method has many times been independently developed and applied in practice under various names (EOF, SSA, Caterpillar, etc.). Nowadays, the name ‘SSA’ (Singular Spectral Analysis) is the most often used. It turned out that it is universal, applicable to any time series without requiring stationary assumptions, automatically decomposes time series into a trend, cyclic components and noise. By the beginning of the 1980s, Takens had shown that for a dynamical system such a method makes it possible to obtain an attractor from observing only one of these variables, thereby bringing the method to a powerful theoretical basis. In the same years, the practical benefits of phase portraits became clear. In particular, it was used in the analysis and forecast of animal abundance dynamics. In this paper we propose to extend SSA to a one-dimensional sequence of any type of elements, including numbers, symbols, figures, etc., and, as a special case, to a molecular sequence. Technically, the problem is solved using an algorithm like SSA. The sequence is cut by a sliding window into fragments of a given length. Between all fragments, the matrix of Euclidean distances is calculated. This is always possible. For example, the square root of the Hamming distance between fragments is a Euclidean distance. For the resulting matrix, the principal components are calculated by the principal-coordinate method (PCo). Instead of a distance matrix, one can use a matrix of any similarity/dissimilarity indexes and apply methods of multidimensional scaling (MDS). The result will always be PCs in some Euclidean space. We called this method ‘PCA-Seq’. It is certainly an exploratory method, as is its particular case SSA. For any sequence, in cluding molecular, PCA-Seq without any additional assumptions allows presenting its principal components in a numerical form and visualizing them in the form of phase portraits. A long history of SSA application for numerical data gives all reason to believe that PCA-Seq will be not less useful in the analysis of non-numerical data, especially in hypothesizing. PCA-Seq is implemented in the freely distributed Jacobi 4 package (http://jacobi4.ru/).
first_indexed 2024-03-07T16:06:06Z
format Article
id doaj.art-70002a29bde642a99fd52ab3623bc674
institution Directory Open Access Journal
issn 2500-3259
language English
last_indexed 2024-04-24T11:07:23Z
publishDate 2020-01-01
publisher Siberian Branch of the Russian Academy of Sciences, Federal Research Center Institute of Cytology and Genetics, The Vavilov Society of Geneticists and Breeders
record_format Article
series Вавиловский журнал генетики и селекции
spelling doaj.art-70002a29bde642a99fd52ab3623bc6742024-04-11T15:31:02ZengSiberian Branch of the Russian Academy of Sciences, Federal Research Center Institute of Cytology and Genetics, The Vavilov Society of Geneticists and BreedersВавиловский журнал генетики и селекции2500-32592020-01-012381032103610.18699/VJ19.5841003Principal component analysis and its generalizations for any type of sequence (PCA-Seq)V. M. Efimov0K. V. Efimov1V. Y. Kovaleva2Institute of Cytology and Genetics, SB RAS; Institute of Systematics and Ecology of Animals, SB RAS; Novosibirsk State University; Tomsk State UniversityMoscow Institute of Physics and Technology (State University)Institute of Systematics and Ecology of Animals, SB RASIn the 1940s, Karhunen and Loève proposed a method for processing a one-dimensional numeric time series by converting it into multidimensional by shifts. In fact, a one-dimensional number series was decomposed into several orthogonal time series. This method has many times been independently developed and applied in practice under various names (EOF, SSA, Caterpillar, etc.). Nowadays, the name ‘SSA’ (Singular Spectral Analysis) is the most often used. It turned out that it is universal, applicable to any time series without requiring stationary assumptions, automatically decomposes time series into a trend, cyclic components and noise. By the beginning of the 1980s, Takens had shown that for a dynamical system such a method makes it possible to obtain an attractor from observing only one of these variables, thereby bringing the method to a powerful theoretical basis. In the same years, the practical benefits of phase portraits became clear. In particular, it was used in the analysis and forecast of animal abundance dynamics. In this paper we propose to extend SSA to a one-dimensional sequence of any type of elements, including numbers, symbols, figures, etc., and, as a special case, to a molecular sequence. Technically, the problem is solved using an algorithm like SSA. The sequence is cut by a sliding window into fragments of a given length. Between all fragments, the matrix of Euclidean distances is calculated. This is always possible. For example, the square root of the Hamming distance between fragments is a Euclidean distance. For the resulting matrix, the principal components are calculated by the principal-coordinate method (PCo). Instead of a distance matrix, one can use a matrix of any similarity/dissimilarity indexes and apply methods of multidimensional scaling (MDS). The result will always be PCs in some Euclidean space. We called this method ‘PCA-Seq’. It is certainly an exploratory method, as is its particular case SSA. For any sequence, in cluding molecular, PCA-Seq without any additional assumptions allows presenting its principal components in a numerical form and visualizing them in the form of phase portraits. A long history of SSA application for numerical data gives all reason to believe that PCA-Seq will be not less useful in the analysis of non-numerical data, especially in hypothesizing. PCA-Seq is implemented in the freely distributed Jacobi 4 package (http://jacobi4.ru/).https://vavilov.elpub.ru/jour/article/view/2395time seriessvdpcapcomdsssamolecular sequencesp-distance
spellingShingle V. M. Efimov
K. V. Efimov
V. Y. Kovaleva
Principal component analysis and its generalizations for any type of sequence (PCA-Seq)
Вавиловский журнал генетики и селекции
time series
svd
pca
pco
mds
ssa
molecular sequences
p-distance
title Principal component analysis and its generalizations for any type of sequence (PCA-Seq)
title_full Principal component analysis and its generalizations for any type of sequence (PCA-Seq)
title_fullStr Principal component analysis and its generalizations for any type of sequence (PCA-Seq)
title_full_unstemmed Principal component analysis and its generalizations for any type of sequence (PCA-Seq)
title_short Principal component analysis and its generalizations for any type of sequence (PCA-Seq)
title_sort principal component analysis and its generalizations for any type of sequence pca seq
topic time series
svd
pca
pco
mds
ssa
molecular sequences
p-distance
url https://vavilov.elpub.ru/jour/article/view/2395
work_keys_str_mv AT vmefimov principalcomponentanalysisanditsgeneralizationsforanytypeofsequencepcaseq
AT kvefimov principalcomponentanalysisanditsgeneralizationsforanytypeofsequencepcaseq
AT vykovaleva principalcomponentanalysisanditsgeneralizationsforanytypeofsequencepcaseq