A method for principal component analysis is proposed that is sparse and robust at the same time. The sparsity delivers principal components that have loadings on a small number of variables, making them easier to interpret. The robustness makes the analysis resistant to outlying observations....

The L1-median is a robust estimator of multivariate location with good statistical properties. Several algorithms for computing the L1-median are available. Problem specific algorithms can be used, but also general optimization routines. The aim is to compare different algorithms with respect to...

The application of “concentration” steps is the main principle behind Forgy’s k-means algorithm and the fast-MCD algorithm. Despite this coincidence, it is not completely straightforward to combine both algorithms for developing a clustering method which is not severely affected by few...

The L <Subscript>1</Subscript>-median is a robust estimator of multivariate location with good statistical properties. Several algorithms for computing the L <Subscript>1</Subscript>-median are available. Problem specific algorithms can be used, but also general optimization routines. The aim is to compare different algorithms with respect...</subscript></subscript>