So sánh phương pháp
Xem các phương pháp đã chọn cạnh nhau; những hàng khác biệt được làm nổi bật.
| Phân cụm phân cấp Bayes (BHC)× | Phân cụm phân cấp× | |
|---|---|---|
| Lĩnh vực≠ | Thống kê | Học máy |
| Họ≠ | Latent structure | Machine learning |
| Năm ra đời≠ | 2005 | 1963 |
| Người khởi xướng≠ | Katherine Heller & Zoubin Ghahramani | Ward, J. H. |
| Loại≠ | Probabilistic clustering / model-based hierarchical agglomeration | Unsupervised clustering (agglomerative) |
| Công trình gốc≠ | Heller, K. A. & Ghahramani, Z. (2005). Bayesian hierarchical clustering. In Proceedings of the 22nd International Conference on Machine Learning (ICML 2005), pp. 297–304. ACM. DOI ↗ | Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗ |
| Tên gọi khác≠ | BHC, probabilistic hierarchical clustering, Bayesian agglomerative clustering | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering |
| Liên quan≠ | 6 | 4 |
| Tóm tắt≠ | Bayesian hierarchical clustering is a probabilistic agglomerative algorithm that builds a tree of nested cluster merges using Bayesian model comparison at each step. Rather than minimising a geometric linkage criterion, it evaluates at every candidate merge whether the data from two clusters are better explained by a single combined model or by two separate models, yielding a statistically principled dendrogram. | 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. |
| ScholarGateBộ dữ liệu ↗ |
|
|