方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 可解释K-Means× | K-Means聚类× | |
|---|---|---|
| 领域 | 机器学习 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2020 | 1967 |
| 提出者≠ | Dasgupta, S.; Moshkovitz, M.; Frost, N.; Rashtchian, C. | MacQueen, J. |
| 类型≠ | Explainable unsupervised clustering algorithm | Partitional clustering (centroid-based) |
| 开创性文献≠ | 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 ↗ | 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 ↗ |
| 别名 | ExKMC, interpretable k-means, decision-tree k-means, explainable clustering | K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering |
| 相关≠ | 5 | 3 |
| 摘要≠ | 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. | 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. |
| ScholarGate数据集 ↗ |
|
|