השוואת שיטות
סקרו את השיטות שבחרתם זו לצד זו; שורות שבהן יש הבדל מודגשות.
| K-means מאוחד (Ensemble K-means)× | HDBSCAN× | אשכול K-means× | |
|---|---|---|---|
| תחום | למידת מכונה | למידת מכונה | למידת מכונה |
| משפחה | Machine learning | Machine learning | Machine learning |
| שנת המקור≠ | 2002 | 2013 | 1967 (formalized 1982) |
| הוגה השיטה≠ | Strehl, A. & Ghosh, J. | Campello, R. J. G. B.; Moulavi, D.; Sander, J. | MacQueen, J. B.; Lloyd, S. P. |
| סוג≠ | Ensemble clustering (consensus aggregation of K-means partitions) | Hierarchical density-based clustering | 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 ↗ | Campello, R. J. G. B., Moulavi, D., & Sander, J. (2013). Density-Based Clustering Based on Hierarchical Density Estimates. In J. Pei et al. (Eds.), Advances in Knowledge Discovery and Data Mining. PAKDD 2013. Lecture Notes in Computer Science, vol. 7819 (pp. 160–172). Springer, Berlin, Heidelberg. DOI ↗ | 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 | HDBSCAN, Hierarchical DBSCAN, hierarchical density-based clustering, HDBSCAN* | k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means |
| קשורות≠ | 3 | 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. | HDBSCAN (Hierarchical Density-Based Spatial Clustering of Applications with Noise) is a density-based clustering algorithm introduced by Campello, Moulavi, and Sander in 2013. It extends DBSCAN by building a full hierarchy of density-based clusters across all density scales and then extracting a stable flat partition, making it robust to datasets where cluster densities vary substantially across regions. | 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מערך נתונים ↗ |
|
|
|