Sparse non Gaussian component analysis by semidefinite programming

8Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Sparse non-Gaussian component analysis is an unsupervised linear method of extracting any structure from high-dimensional distributed data based on estimating a low-dimensional non-Gaussian data component. In this paper we discuss a new approach with known apriori reduced dimension to direct estimation of the projector on the target space using semidefinite programming. The new approach avoids the estimation of the data covariance matrix and overcomes the traditional separation of element estimation of the target space and target space reconstruction. This allows to reduced the sampling size while improving the sensitivity to a broad variety of deviations from normality. Moreover the complexity of the new approach is limited to O(dlogd). We also discuss the procedures which allows to recover the structure when its effective dimension is unknown. © 2013 The Author(s).

Cite

CITATION STYLE

APA

Diederichs, E., Juditsky, A., Nemirovski, A., & Spokoiny, V. (2013). Sparse non Gaussian component analysis by semidefinite programming. Machine Learning, 91(2), 211–238. https://doi.org/10.1007/s10994-013-5331-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free