方法对比
并排查看您选择的方法;存在差异的行会高亮显示。
| 贝叶斯聚类分析× | 层次聚类× | |
|---|---|---|
| 领域≠ | 统计学 | 机器学习 |
| 方法族≠ | Latent structure | Machine learning |
| 起源年份≠ | 1998–2002 | 1963 |
| 提出者≠ | Fraley & Raftery (model-based); Dirichlet process formulations by Ferguson (1973) and Antoniak (1974) | Ward, J. H. |
| 类型≠ | Probabilistic / model-based clustering | Unsupervised clustering (agglomerative) |
| 开创性文献≠ | Fraley, C. & Raftery, A. E. (2002). Model-based clustering, discriminant analysis, and density estimation. Journal of the American Statistical Association, 97(458), 611–631. DOI ↗ | Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗ |
| 别名≠ | BCA, Bayesian clustering, probabilistic cluster analysis, Bayesian model-based clustering | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering |
| 相关≠ | 6 | 4 |
| 摘要≠ | Bayesian cluster analysis assigns observations to latent groups by combining a probabilistic model of within-cluster data with prior beliefs about cluster parameters and the number of clusters. It yields posterior probabilities of cluster membership and principled uncertainty estimates, making it more transparent than classical distance-based clustering algorithms. | 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. |
| ScholarGate数据集 ↗ |
|
|