Robust refinement of initial prototypes for partitioning-based clustering algorithms
暂无分享,去创建一个
[1] Vipin Kumar,et al. Introduction to Data Mining , 2022, Data Mining and Machine Learning Applications.
[2] T. Kärkkäinen,et al. Robust Clustering Methods For Incomplete AndErroneous Data , 2004 .
[3] Heikki Mannila,et al. Principles of Data Mining , 2001, Undergraduate Topics in Computer Science.
[4] Man Lan,et al. Initialization of cluster refinement algorithms: a review and comparative study , 2004, 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541).
[5] J. MacQueen. Some methods for classification and analysis of multivariate observations , 1967 .
[6] Paul S. Bradley,et al. Refining Initial Points for K-Means Clustering , 1998, ICML.
[7] C.-C. Jay Kuo,et al. A new initialization technique for generalized Lloyd iteration , 1994, IEEE Signal Processing Letters.
[8] Nicole A. Lazar,et al. Statistical Analysis With Missing Data , 2003, Technometrics.
[9] T. Kärkkäinen,et al. ON COMPUTATION OF SPATIAL MEDIAN FOR ROBUST DATA MINING , 2022 .
[10] Tommi Kärkkäinen,et al. Robust Formulations for Training Multilayer Perceptrons , 2004, Neural Computation.
[11] Catherine Blake,et al. UCI Repository of machine learning databases , 1998 .