Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| Ансамблевий K-середніх× | Кластеризація методом k-середніх× | |
|---|---|---|
| Галузь | Машинне навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 2002 | 1967 (formalized 1982) |
| Автор методу≠ | Strehl, A. & Ghosh, J. | MacQueen, J. B.; Lloyd, S. P. |
| Тип≠ | Ensemble clustering (consensus aggregation of K-means partitions) | Partitional clustering |
| Основоположне джерело≠ | Strehl, A. & Ghosh, J. (2002). Cluster ensembles — a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3, 583–617. link ↗ | Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗ |
| Інші назви | consensus K-means, K-means ensemble clustering, cluster ensemble with K-means, EKM | k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means |
| Пов'язані≠ | 3 | 4 |
| Підсумок≠ | Ensemble K-means runs K-means clustering many times under varied initializations, random seeds, or feature subsets, then aggregates the resulting partitions into a single consensus assignment. This approach reduces K-means' well-known sensitivity to initialization and produces more stable, reproducible clusters than any single run. | K-means is a classic unsupervised partitional clustering algorithm that divides a dataset into K non-overlapping groups by iteratively assigning each observation to its nearest centroid and updating centroids as the mean of their assigned points. It is one of the most widely used exploratory tools in machine learning and data analysis. |
| ScholarGateНабір даних ↗ |
|
|