An information geometrical view of stationary subspace analysis

Authors:
Motoaki Kawanabe;Wojciech Samek;Paul Von Bünau;Frank C. Meinecke
Affiliations:
Fraunhofer Institute FIRST, Berlin, Germany and Berlin Institute of Technology, Berlin, Germany;Fraunhofer Institute FIRST, Berlin, Germany and Berlin Institute of Technology, Berlin, Germany;Fraunhofer Institute FIRST, Berlin, Germany;Fraunhofer Institute FIRST, Berlin, Germany
Venue:
ICANN'11 Proceedings of the 21st international conference on Artificial neural networks - Volume Part II
Year:
2011

Citing 6
Cited 1

In Search of Non-Gaussian Components of a High-Dimensional Distribution

The Journal of Machine Learning Research
A Projection Pursuit Algorithm for Exploratory Data Analysis

IEEE Transactions on Computers
Geometrical methods for non-negative ICA: Manifolds, Lie groups and toral subalgebras

Neurocomputing
Sparse non-Gaussian component analysis

IEEE Transactions on Information Theory
Colored subspace analysis: dimension reduction based on a signal's autocorrelation structure

IEEE Transactions on Circuits and Systems Part I: Regular Papers
Stationary subspace analysis as a generalized eigenvalue problem

ICONIP'10 Proceedings of the 17th international conference on Neural information processing: theory and algorithms - Volume Part I

The Stationary Subspace Analysis Toolbox

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Stationary Subspace Analysis (SSA) is an unsupervised learning method that finds subspaces in which data distributions stay invariant over time. It has been shown to be very useful for studying non-stationarities in various applications. In this paper, we present the first SSA algorithm based on a full generative model of the data. This new derivation relates SSA to previous work on finding interesting subspaces from high-dimensional data in a similar way as the three easy routes to independent component analysis, and provides an information geometric view.