পদ্ধতির তুলনা করুন

	বেয়েশীয় অনুক্রমিক ক্লাস্টারিং (BHC)	Hierarchical Clustering
ক্ষেত্র	পরিসংখ্যান	যন্ত্র শিখন
পরিবার	Latent structure	Machine learning
উদ্ভবের বছর	2005	1963
প্রবর্তক	Katherine Heller & Zoubin Ghahramani	Ward, J. H.
ধরন	Probabilistic clustering / model-based hierarchical agglomeration	Unsupervised clustering (agglomerative)
মৌলিক উৎস	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.	Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244.
অপর নাম	BHC, probabilistic hierarchical clustering, Bayesian agglomerative clustering	Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
সম্পর্কিত	6	4
সারসংক্ষেপ	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.