Fast estimation of the median covariation matrix with application to online robust principal components analysis

From MaRDI portal
Publication:89458

DOI10.1007/S11749-016-0519-XzbMATH Open1373.62124arXiv1504.02852OpenAlexW2963891697MaRDI QIDQ89458FDOQ89458

Hervé Cardot, Antoine Godichon-Baggioni, Antoine Godichon-Baggioni

Publication date: 8 December 2016

Published in: Test, TEST (Search for Journal in Brave)

Abstract: The geometric median covariation matrix is a robust multivariate indicator of dispersion which can be extended without any difficulty to functional data. We define estimators, based on recursive algorithms, that can be simply updated at each new observation and are able to deal rapidly with large samples of high dimensional data without being obliged to store all the data in memory. Asymptotic convergence properties of the recursive algorithms are studied under weak conditions. The computation of the principal components can also be performed online and this approach can be useful for online outlier detection. A simulation study clearly shows that this robust indicator is a competitive alternative to minimum covariance determinant when the dimension of the data is small and robust principal components analysis based on projection pursuit and spherical projections for high dimension data. An illustration on a large sample and high dimensional dataset consisting of individual TV audiences measured at a minute scale over a period of 24 hours confirms the interest of considering the robust principal components analysis based on the median covariation matrix. All studied algorithms are available in the R package Gmedian on CRAN.


Full work available at URL: https://arxiv.org/abs/1504.02852





Cites Work


Cited In (5)

Uses Software






This page was built for publication: Fast estimation of the median covariation matrix with application to online robust principal components analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q89458)