Сравнение методов

	Смесь с процессом Дирихле (Dirichlet Process Mixture Model, DPMM)	Байесовская регрессия	Латентное размещение Дирихле (LDA)	Метод Монте-Карло по цепям Маркова (MCMC)
Область	Байесовские методы	Байесовские методы	Машинное обучение	Байесовские методы
Семейство	Bayesian methods	Bayesian methods	Latent structure	Bayesian methods
Год появления	1973	—	2003	—
Автор метода	Ferguson (1973); mixture model formulation by Lo (1984)	—	Blei, D. M.; Ng, A. Y.; Jordan, M. I.	—
Тип	Nonparametric Bayesian mixture model	Bayesian linear model	Generative probabilistic topic model (three-level hierarchical Bayesian)	Posterior sampling algorithm
Основополагающий источник	Ferguson, T. S. (1973). A Bayesian analysis of some nonparametric problems. The Annals of Statistics, 1(2), 209–230.	Gelman, A., Carlin, J. B., Stern, H. S., Dunson, D. B., Vehtari, A. & Rubin, D. B. (2013). Bayesian Data Analysis (3rd ed.). CRC Press. ISBN: 978-1439840955	Blei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent Dirichlet allocation. Journal of Machine Learning Research, 3, 993–1022.	Gelman, A., Carlin, J. B., Stern, H. S., Dunson, D. B., Vehtari, A. & Rubin, D. B. (2013). Bayesian Data Analysis (3rd ed.). CRC Press. ISBN: 978-1439840955
Другие названия	DPMM, DP mixture model, infinite mixture model, Dirichlet process mixture	bayesian linear regression, probabilistic regression, bayesian regresyon	LDA, topic model, Blei-Ng-Jordan model, probabilistic topic modeling	markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo)
Связанные	3	2	3	3
Сводка	The Dirichlet Process Mixture Model (DPMM) is a nonparametric Bayesian clustering method introduced through Ferguson's (1973) Dirichlet process prior that places a probability distribution over distributions. Unlike finite mixture models, the DPMM does not require the analyst to specify the number of clusters in advance; instead it infers the number of components from the data, allowing an effectively unbounded mixture that grows as more observations arrive.	Bayesian regression is a probabilistic version of linear regression that treats the model parameters as uncertain quantities. Instead of returning a single best-fit estimate, it combines prior knowledge with the observed data to produce a full posterior probability distribution for each parameter, from which credible intervals and predictions are read off.	Latent Dirichlet Allocation (LDA) is a generative probabilistic model for collections of discrete data, introduced by Blei, Ng, and Jordan in 2003. It treats each document as a mixture of latent topics and each topic as a probability distribution over words, enabling unsupervised discovery of thematic structure across large text corpora. It is one of the most cited papers in machine learning and natural language processing.	Markov Chain Monte Carlo (MCMC) is a family of computational algorithms for sampling from complex probability distributions, most commonly the posterior distributions that arise in Bayesian inference. Rather than computing posteriors analytically — which is rarely possible for realistic models — MCMC constructs a Markov chain whose stationary distribution is the target posterior and draws dependent samples from it, enabling full probabilistic inference for virtually any model.