Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| K-means-klustring× | Hierarkisk klustring× | |
|---|---|---|
| Ämnesområde | Maskininlärning | Maskininlärning |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 1967 (formalized 1982) | 1963 |
| Upphovsperson≠ | MacQueen, J. B.; Lloyd, S. P. | Ward, J. H. |
| Typ≠ | Partitional clustering | Unsupervised clustering (agglomerative) |
| Ursprungskälla≠ | Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗ | Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗ |
| Alias≠ | k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering |
| Närliggande | 4 | 4 |
| Sammanfattning≠ | 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. | Hierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963. |
| ScholarGateDatamängd ↗ |
|
|