# Use of EM algorithm for data reduction under sparsity assumption

## Author

Listed:
• Atanu Kumar Ghosh

() (Indian Statistical Institute)

• Arnab Chakraborty

(Indian Statistical Institute)

## Abstract

Abstract Recent scientific applications produce data that are too large for storing or rendering for further statistical analysis. This motivates the construction of an optimum mechanism to choose only a subset of the available information and drawing inferences about the parent population using only the stored subset. This paper addresses the issue of estimation of parameter from such filtered data. Instead of all the observations we observe only a few chosen linear combinations of them and treat the remaining information as missing. From the observed linear combinations we try to estimate the parameter using EM based technique under the assumption that the parameter is sparse. In this paper we propose two related methods called ASREM and ESREM. The methods developed here are also used for hypothesis testing and construction of confidence interval. Similar data filtering approach already exists in signal sampling paradigm, for example, Compressive Sampling introduced by Candes et al. (Commun Pure Appl Math 59(8):1207–1223, 2006) and Donoho (IEEE Trans Inf Theory 52: 1289–1306, 2006). The methods proposed in this paper are not claimed to outperform all the available techniques of signal recovery, rather our methods are suggested as an alternative way of data compression using EM algorithm. However, we shall compare our methods to one standard algorithm, viz., robust signal recovery from noisy data using min- $$\ell _{1}$$ ℓ 1 with quadratic constraints. Finally we shall apply one of our methods to a real life dataset.

## Suggested Citation

• Atanu Kumar Ghosh & Arnab Chakraborty, 2017. "Use of EM algorithm for data reduction under sparsity assumption," Computational Statistics, Springer, vol. 32(2), pages 387-407, June.
• Handle: RePEc:spr:compst:v:32:y:2017:i:2:d:10.1007_s00180-016-0657-3
DOI: 10.1007/s00180-016-0657-3
as

File Function: Abstract

As the access to this document is restricted, you may want to search for a different version of it.

## References listed on IDEAS

as
1. Shi, Ning-Zhong & Zheng, Shu-Rong & Guo, Jianhua, 2005. "The restricted EM algorithm under inequality restrictions on the parameters," Journal of Multivariate Analysis, Elsevier, vol. 92(1), pages 53-76, January.
2. Tian, Guo-Liang & Ng, Kai Wang & Tan, Ming, 2008. "EM-type algorithms for computing restricted MLEs in multivariate normal distributions and multivariate t-distributions," Computational Statistics & Data Analysis, Elsevier, vol. 52(10), pages 4768-4778, June.
Full references (including those not matched with items on IDEAS)

### Keywords

Compressive sampling; Data reduction; General linear hypothesis; Identifiability of parameter; Least norm solution; Restricted EM algorithm; Sparse data recovery;

## Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:compst:v:32:y:2017:i:2:d:10.1007_s00180-016-0657-3. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Mallaigh Nolan). General contact details of provider: http://www.springer.com .

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.