Salīdzināt metodes
Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.
| Skaidrojamais K-Means× | DBSCAN× | K-Means klasterizācija× | |
|---|---|---|---|
| Nozare | Mašīnmācīšanās | Mašīnmācīšanās | Mašīnmācīšanās |
| Saime | Machine learning | Machine learning | Machine learning |
| Izcelsmes gads≠ | 2020 | 1996 | 1967 |
| Autors≠ | Dasgupta, S.; Moshkovitz, M.; Frost, N.; Rashtchian, C. | Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. | MacQueen, J. |
| Tips≠ | Explainable unsupervised clustering algorithm | Density-based clustering algorithm | Partitional clustering (centroid-based) |
| Pirmavots≠ | Dasgupta, S., Frost, N., Moshkovitz, M., & Rashtchian, C. (2020). Explainability of k-Means Clustering. Proceedings of the 37th International Conference on Machine Learning (ICML), PMLR 119. link ↗ | 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 ↗ | 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 ↗ |
| Citi nosaukumi≠ | ExKMC, interpretable k-means, decision-tree k-means, explainable clustering | DBSCAN Kümeleme, density-based clustering, density-based spatial clustering | K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering |
| Saistītās≠ | 5 | 3 | 3 |
| Kopsavilkums≠ | Explainable K-Means is a post-hoc and in-model interpretability approach to standard K-Means clustering that replaces or approximates cluster assignments with a small axis-aligned decision tree. Each leaf of the tree corresponds to one cluster, and every data point is assigned to a cluster by following a simple sequence of threshold rules on individual features — making cluster membership fully transparent and human-readable. | 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. | 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. |
| ScholarGateDatu kopa ↗ |
|
|
|