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 work is devoted to analyzing, from the asymptotic point of view, some examples of sequences of pairwise independent identically distributed random variables. Special attention is paid to the case of stationary sequences by the consideration of different situations that can arise in...

The paper is devoted to study the uniform consistency of the r-mean for B-valued random variables, where B is a uniformly convex Banach space. We conclude that, for bounded B-valued random variables, the consistency of the r-means is uniform in r [epsilon] [1, [infinity]] iff the variable has a...