Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Ergodic Subspace Analysis

View through CrossRef
Properties of psychological variables at the mean or variance level can differ between persons and within persons across multiple time points. For example, cross-sectional findings between persons of different ages do not necessarily reflect the development of a single person over time. Recently, there has been an increased interest in the difference between covariance structures, expressed by covariance matrices, that evolve between persons and within a single person over multiple time points. If these structures are identical at the population level, the structure is called ergodic. However, recent data confirms that ergodicity is not generally given, particularly not for cognitive variables. For example, the g factor that is dominant for cognitive abilities between persons seems to explain far less variance when concentrating on a single person’s data. However, other subdimensions of cognitive abilities seem to appear both between and within persons; that is, there seems to be a lower-dimensional subspace of cognitive abilities in which cognitive abilities are in fact ergodic. In this article, we present ergodic subspace analysis (ESA), a mathematical method to identify, for a given set of variables, which subspace is most important within persons, which is most important between person, and which is ergodic. Similar to the common spatial patterns method, the ESA method first whitens a joint distribution from both the between and the within variance structure and then performs a principle component analysis (PCA) on the between distribution, which then automatically acts as an inverse PCA on the within distribution. The difference of the eigenvalues allows a separation of the rotated dimensions into the three subspaces corresponding to within, between, and ergodic substructures. We apply the method to simulated data and to data from the COGITO study to exemplify its usage.
Title: Ergodic Subspace Analysis
Description:
Properties of psychological variables at the mean or variance level can differ between persons and within persons across multiple time points.
For example, cross-sectional findings between persons of different ages do not necessarily reflect the development of a single person over time.
Recently, there has been an increased interest in the difference between covariance structures, expressed by covariance matrices, that evolve between persons and within a single person over multiple time points.
If these structures are identical at the population level, the structure is called ergodic.
However, recent data confirms that ergodicity is not generally given, particularly not for cognitive variables.
For example, the g factor that is dominant for cognitive abilities between persons seems to explain far less variance when concentrating on a single person’s data.
However, other subdimensions of cognitive abilities seem to appear both between and within persons; that is, there seems to be a lower-dimensional subspace of cognitive abilities in which cognitive abilities are in fact ergodic.
In this article, we present ergodic subspace analysis (ESA), a mathematical method to identify, for a given set of variables, which subspace is most important within persons, which is most important between person, and which is ergodic.
Similar to the common spatial patterns method, the ESA method first whitens a joint distribution from both the between and the within variance structure and then performs a principle component analysis (PCA) on the between distribution, which then automatically acts as an inverse PCA on the within distribution.
The difference of the eigenvalues allows a separation of the rotated dimensions into the three subspaces corresponding to within, between, and ergodic substructures.
We apply the method to simulated data and to data from the COGITO study to exemplify its usage.

Related Results

On Subspace-recurrent Operators
On Subspace-recurrent Operators
In this article, subspace-recurrent operators are presented and it is showed that the set of subspace-transitive operators is a strict subset of the set of subspace-recurrent opera...
Optimization algorithm for omic data subspace clustering
Optimization algorithm for omic data subspace clustering
Subspace clustering identifies multiple feature subspaces embedded in a dataset together with the underlying sample clusters. When applied to omic data, subspace clustering is a ch...
Vladimir Abramovich Rokhlin (23 August 1919 to 3 December 1984): Introductory note
Vladimir Abramovich Rokhlin (23 August 1919 to 3 December 1984): Introductory note
The Ergodic Theory and Dynamical Systems journal pays tribute to V. A. Rokhlin, one of the founders of ergodic theory, a world-renowned topologist and geometer, and a man of tragic...
Adaptive Subspace Detection of Spread Spectrum Signals With General Antenna Array Configuration
Adaptive Subspace Detection of Spread Spectrum Signals With General Antenna Array Configuration
Assume that a low probability of detection communication (LPD) system has a generally configured antenna array receiver, comprising a primary array with a high-gain beam and a refe...
Subspace Complexity Reduction in Direction-of-Arrival Estimation via the RASA Algorithm
Subspace Complexity Reduction in Direction-of-Arrival Estimation via the RASA Algorithm
The complexity and scale of contemporary datasets are increasing, making the need for reliable and effective subspace processing more pressing. In array signal processing, the qual...
A subspace based subspace inclusion graph on vector space
A subspace based subspace inclusion graph on vector space
Let $\mathscr{W}$ be a fixed $k$-dimensional subspace of an $n$-dimensi\-onal vector space $\mathscr{V}$ such that $n-k\geq1.$ In this paper, we introduce a graph structure, called...
On Absolute and Quantitative Subspace Theorems
On Absolute and Quantitative Subspace Theorems
Abstract The Absolute Subspace Theorem, a vast generalization and a quantitative improvement of Schmidt’s Subspace Theorem, was first established by Evertse and Schl...
Multi-view Unsupervised Feature Selection With Joint Multi-subspace Robust Learning
Multi-view Unsupervised Feature Selection With Joint Multi-subspace Robust Learning
Multi-view unsupervised feature selection aims to extract representative and discriminative features from multiple views to improve model performance on complex datasets. However, ...

Back to Top