Linganisha mbinu
Pitia mbinu ulizochagua bega kwa bega; safu zinazotofautiana zinaangaziwa.
| DBSCAN× | Ngeli ya Kiwango cha Juu (Hierarchical Clustering)× | K-Means Clustering× | |
|---|---|---|---|
| Nyanja | Ujifunzaji wa Mashine | Ujifunzaji wa Mashine | Ujifunzaji wa Mashine |
| Familia | Machine learning | Machine learning | Machine learning |
| Mwaka wa asili≠ | 1996 | 1963 | 1967 |
| Mwanzilishi≠ | Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. | Ward, J. H. | MacQueen, J. |
| Aina≠ | Density-based clustering algorithm | Unsupervised clustering (agglomerative) | Partitional clustering (centroid-based) |
| Chanzo asilia≠ | Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231. link ↗ | Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗ | MacQueen, J. (1967). Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, 281–297. link ↗ |
| Majina mbadala≠ | DBSCAN Kümeleme, density-based clustering, density-based spatial clustering | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering | K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering |
| Zinazohusiana≠ | 3 | 4 | 3 |
| Muhtasari≠ | DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes. | 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. | K-Means Clustering is a centroid-based partitional clustering algorithm, traced to J. MacQueen in 1967, that splits data into k clusters by assigning each observation to its nearest cluster centre. It is widely used for marketing segmentation, customer grouping, and exploratory analysis. |
| ScholarGateSeti ya data ↗ |
|
|
|