ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

贝叶斯 K-均值聚类×混合模型×
领域统计学统计学
方法族Latent structureLatent structure
起源年份2006–20121894
提出者Kulis & Jordan (ICML 2012) formalized the Bayesian nonparametric derivation; Bishop (2006) established the variational Bayesian EM framework for Gaussian mixture models as a probabilistic foundationKarl Pearson
类型Probabilistic clustering / Bayesian nonparametricLatent variable / density estimation
开创性文献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. link ↗McLachlan, G. J. & Peel, D. (2000). Finite Mixture Models. Wiley-Interscience. ISBN: 978-0471006268
别名Bayesian K-means, probabilistic K-means, Dirichlet K-means, BKMfinite mixture model, mixture distribution model, FMM, model-based clustering
相关66
摘要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.Mixture modeling assumes that a population is composed of K unobserved subpopulations, each described by its own probability distribution. The observed data are treated as draws from a weighted combination of these component distributions. It provides a principled, model-based alternative to ad hoc clustering and supports formal comparison of solutions with different numbers of components.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 2 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Bayesian K-means clustering · Mixture Modeling. 于 2026-06-18 检索自 https://scholargate.app/zh/compare