방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 베이지안 군집 분석× | 계층적 군집화× | |
|---|---|---|
| 분야≠ | 통계학 | 머신러닝 |
| 계열≠ | 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데이터셋 ↗ |
|
|