مقایسهٔ روش‌ها

	خوشه‌بندی بیزی K-means	تحلیل خوشه‌ای بیزی
حوزه	آمار	آمار
خانواده	Latent structure	Latent structure
سال پیدایش	2006–2012	1998–2002
پدیدآور	Kulis & Jordan (ICML 2012) formalized the Bayesian nonparametric derivation; Bishop (2006) established the variational Bayesian EM framework for Gaussian mixture models as a probabilistic foundation	Fraley & Raftery (model-based); Dirichlet process formulations by Ferguson (1973) and Antoniak (1974)
نوع	Probabilistic clustering / Bayesian nonparametric	Probabilistic / model-based clustering
منبع بنیادین	Kulis, B. & Jordan, M. I. (2012). Revisiting k-means: New algorithms via Bayesian nonparametrics. In Proceedings of the 29th International Conference on Machine Learning (ICML), Edinburgh, Scotland, pp. 513–520.	Fraley, C. & Raftery, A. E. (2002). Model-based clustering, discriminant analysis, and density estimation. Journal of the American Statistical Association, 97(458), 611–631.
نام‌های دیگر	Bayesian K-means, probabilistic K-means, Dirichlet K-means, BKM	BCA, Bayesian clustering, probabilistic cluster analysis, Bayesian model-based clustering
مرتبط	6	6
خلاصه	Bayesian K-means clustering extends the classical K-means algorithm by placing prior distributions over cluster centroids and mixing proportions. This probabilistic framework provides uncertainty estimates for cluster assignments, allows principled model selection for the number of clusters, and regularises centroid estimation — especially valuable when data are scarce or high-dimensional.	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.