Semangat Maju Terus Pantang MACET

Jangan sesali hari kemarin, jangan takut menatap masa depan, syukurilah hari ini

Fast algorithms fo r computing high breakdown covariance matrices with missing data

Posted by dhin pada 26 April 2009

Fast algorithms fo r computing high breakdown
covariance matrices with missing data
Samuel Copt and Maria-Pia Victoria-Feser
No 2003.04

Abstract
Robust estimation of covariance matrices when some of the data at hand are missing is an important problem. It has been studied by Little and Smith (1987) and more recently by Cheng and Victoria-Feser (2002). The latter propose the use of high breakdown estimators and so-called hybrid algorithms (see e.g. Woodruff and Rocke 1994). In particular, the minimum volume ellipsoid of Rousseeuw (1984) is adapted to the case of missing data. To compute it, they use (a modified version of) the forward search algorithm (see e.g. Atkinson 1994). In this paper, we propose to use instead a modification of the C-step algorithm proposed by Rousseeuw and Van Driessen (1999) which is actually a lot faster. We also adapt the orthogonalized Gnanadesikan-Kettering (OGK) estimator proposed by Maronna and Zamar (2002) to the case of missing data and use it as a starting point for an adapted Sestimator. Moreover, we conduct a simulation study to compare different robust estimators in terms of their efficiency and breakdown and use them to analyse real datasets.

Free Download

Fast algorithms fo r computing high breakdown
covariance matrices with missing data

Tinggalkan Balasan

Isikan data di bawah atau klik salah satu ikon untuk log in:

Logo WordPress.com

You are commenting using your WordPress.com account. Logout / Ubah )

Gambar Twitter

You are commenting using your Twitter account. Logout / Ubah )

Foto Facebook

You are commenting using your Facebook account. Logout / Ubah )

Foto Google+

You are commenting using your Google+ account. Logout / Ubah )

Connecting to %s

 
%d blogger menyukai ini: