TY - JOUR
T1 - Uniqueness of non-gaussianity-based dimension reduction
AU - Theis, Fabian J.
AU - Kawanabe, Motoaki
AU - Müller, Klaus Robert
N1 - Funding Information:
Manuscript received July 29, 2010; revised November 22, 2010, March 03, 2011, and May 26, 2011; accepted May 27, 2011. Date of publication June 16, 2011; date of current version August 10, 2011. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Kainam Thomas Wong. F. J. Theis gratefully acknowledges partial financial supported by the Helmholtz Alliance on Systems Biology (project “CoReNe”). M. Kawanabe and K.-R. Müller acknowledge the THESEUS project (01MQ07018) funded by the German Federal Ministry of Economics and Technology. K.-R. Müller also acknowledges general support by the BMBF and DFG.
PY - 2011/9
Y1 - 2011/9
N2 - Dimension reduction is a key step in preprocessing large-scale data sets. A recently proposed method named non-Gaussian component analysis searches for a projection onto the non-Gaussian part of a given multivariate recording, which is a generalization of the deflationary projection pursuit model. In this contribution, we discuss the uniqueness of the subspaces of such a projection. We prove that a necessary and sufficient condition for uniqueness is that the non-Gaussian signal subspace is of minimal dimension. Furthermore, we propose a measure for estimating this minimal dimension and illustrate it by numerical simulations. Our result guarantees that projection algorithms uniquely recover the underlying lower dimensional data signals.
AB - Dimension reduction is a key step in preprocessing large-scale data sets. A recently proposed method named non-Gaussian component analysis searches for a projection onto the non-Gaussian part of a given multivariate recording, which is a generalization of the deflationary projection pursuit model. In this contribution, we discuss the uniqueness of the subspaces of such a projection. We prove that a necessary and sufficient condition for uniqueness is that the non-Gaussian signal subspace is of minimal dimension. Furthermore, we propose a measure for estimating this minimal dimension and illustrate it by numerical simulations. Our result guarantees that projection algorithms uniquely recover the underlying lower dimensional data signals.
KW - Identifiability
KW - independent subspace analysis
KW - non-Gaussian component analysis
KW - projection pursuit
UR - http://www.scopus.com/inward/record.url?scp=80051716561&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80051716561&partnerID=8YFLogxK
U2 - 10.1109/TSP.2011.2159600
DO - 10.1109/TSP.2011.2159600
M3 - Article
AN - SCOPUS:80051716561
VL - 59
SP - 4478
EP - 4482
JO - IEEE Transactions on Signal Processing
JF - IEEE Transactions on Signal Processing
SN - 1053-587X
IS - 9
M1 - 5876340
ER -