Outlier detection in non-elliptical data by kernel MRCD
Not on the map. Why?
Abstract (arXiv)
The minimum regularized covariance determinant method (MRCD) is a robust estimator for multivariate location and scatter, which detects outliers by fitting a robust covariance matrix to the data. Its regularization ensures that the covariance matrix is well-conditioned in any dimension. The MRCD assumes that the non-outlying observations are roughly elliptically distributed, but many datasets are not of that form. Moreover, the computation time of MRCD increases substantially when the number of variables goes up, and nowadays datasets with many variables are common. The proposed Kernel Minimum Regularized Covariance Determinant (KMRCD) estimator addresses both issues. It is not restricted to elliptical data because it implicitly computes the MRCD estimates in a kernel induced feature space. A fast algorithm is constructed that starts from kernel-based initial estimates and exploits the kernel trick to speed up the subsequent computations. Based on the KMRCD estimates, a rule is proposed to flag outliers. The KMRCD algorithm performs well in simulations, and is illustrated on real-life data.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Aug 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 1.
3 papers.
- 2022The Cellwise Minimum Covariance Determinant Estimatorcited by 5
- 2025Kernel Outlier Detectioncited by 1
- 2023Edgewise outliers of network indexed signalscited by 0
- 2025Kernel Outlier Detection28 Jun 2025
- 2023Edgewise outliers of network indexed signals20 Jul 2023
- 2022The Cellwise Minimum Covariance Determinant Estimator27 Jul 2022