Report
OA Policy
English

Fast Algorithms for Computing High Breakdown Covariance Matrices with Missing Data

Number of pages

19

Publisher

Genève

Collection

  • Cahiers du département d'économétrie; 2003.04

Publication date

2003

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 n 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.

Keywords

  • C-step algorithm
  • Minimum volume ellipsoid
  • Outliers
  • Robust statistics
  • Sestimators
  • Orthogonalized Gnanadesikan-Kettering robust estimator

Citation (ISO format)

COPT, Samuel, VICTORIA-FESER, Maria-Pia. Fast Algorithms for Computing High Breakdown Covariance Matrices with Missing Data. 2003

Main files (1)

Report

Identifiers

  • PID : unige:6623
1110views
1476downloads

Technical informations

Creation

12/05/2010 10:52:00

First validation

12/05/2010 10:52:00

Update

14/03/2023 15:29:07

Status update

14/03/2023 15:29:07

Last indexation

29/10/2024 14:46:46
All rights reserved by Archive ouverte UNIGE and the University of Geneva
OpenAIRE Indexed & Validated