Trimmed best k-nets: A robustified version of an L∞-based clustering method
暂无分享,去创建一个
A. Gordaliza | Carlos Matrán | J. A. Cuesta-Albertos | Juan A. Cuesta-Albertos | C. Matrán | A. Gordaliza
[1] A. Gordaliza,et al. On the breakdown point of multivariate location estimators based on trimming procedures , 1991 .
[2] A. Gordaliza. Best approximations to random variables based on trimming procedures , 1991 .
[3] P. Rousseeuw. Least Median of Squares Regression , 1984 .
[4] D. Pollard. Convergence of stochastic processes , 1984 .
[5] Peter J. Rousseeuw,et al. Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .
[6] David J. Hand,et al. A Handbook of Small Data Sets , 1993 .
[7] S. Hakimi. Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems , 1965 .
[8] J. A. Cuesta,et al. The strong law of large numbers for k-means and best possible nets of Banach valued random variables , 1988 .
[9] J. A. Cuesta-Albertos,et al. Trimmed $k$-means: an attempt to robustify quantizers , 1997 .
[10] John A. Hartigan,et al. Clustering Algorithms , 1975 .