Kaveh Vakili
Katholieke Universiteit Leuven
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Kaveh Vakili.
Journal of the American Statistical Association | 2014
Gerda Claeskens; Mia Hubert; Leen Slaets; Kaveh Vakili
This article defines and studies a depth for multivariate functional data. By the multivariate nature and by including a weight function, it acknowledges important characteristics of functional data, namely differences in the amount of local amplitude, shape, and phase variation. We study both population and finite sample versions. The multivariate sample of curves may include warping functions, derivatives, and integrals of the original curves for a better overall representation of the functional data via the depth. We present a simulation study and data examples that confirm the good performance of this depth function. Supplementary materials for this article are available online.
Computational Statistics & Data Analysis | 2014
Kaveh Vakili; Eric Schmitt
The Projection Congruent Subset (PCS) is a new method for finding multivariate outliers. Like many other outlier detection procedures, PCS searches for a subset which minimizes a criterion. The difference is that the new criterion was designed to be insensitive to the outliers. PCS is supported by FastPCS, a fast and affine equivariant algorithm which is also detailed. Both an extensive simulation study and a real data application from the field of engineering show that FastPCS performs better than its competitors.
Statistics and Computing | 2016
Eric Schmitt; Kaveh Vakili
Principal component analysis (PCA) is widely used to analyze high-dimensional data, but it is very sensitive to outliers. Robust PCA methods seek fits that are unaffected by the outliers and can therefore be trusted to reveal them. FastHCS (high-dimensional congruent subsets) is a robust PCA algorithm suitable for high-dimensional applications, including cases where the number of variables exceeds the number of observations. After detailing the FastHCS algorithm, we carry out an extensive simulation study and three real data applications, the results of which show that FastHCS is systematically more robust to outliers than state-of-the-art methods.
Statistical Papers | 2014
Mia Hubert; Peter J. Rousseeuw; Kaveh Vakili
Statistics & Probability Letters | 2014
Eric Schmitt; Viktoria Öllerer; Kaveh Vakili
Proceedings of Compstat 2012 - 20th International Conference on Computational Statistics | 2012
Mia Hubert; Gerda Claeskens; Bart De Ketelaere; Kaveh Vakili
arXiv: Methodology | 2013
Kaveh Vakili; Eric Schmitt
Proceedings of Compstat 2012 - 20th International Conference on Computational Statistics | 2012
Kaveh Vakili; Mia Hubert; Peter J. Rousseeuw
Archive | 2015
Viktoria Oellerer; Kaveh Vakili
Archive | 2015
Mia Hubert; Peter J. Rousseeuw; Pieter Segaert; Kaveh Vakili