Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Model Mixtură cu Proces Dirichlet× | Bayesian Regression× | Latent Dirichlet Allocation (LDA)× | |
|---|---|---|---|
| Domeniu≠ | Bayesian | Bayesian | Învățare automată |
| Familie≠ | Bayesian methods | Bayesian methods | Latent structure |
| Anul apariției≠ | 1973 | — | 2003 |
| Autorul original≠ | Ferguson (1973); mixture model formulation by Lo (1984) | — | Blei, D. M.; Ng, A. Y.; Jordan, M. I. |
| Tip≠ | Nonparametric Bayesian mixture model | Bayesian linear model | Generative probabilistic topic model (three-level hierarchical Bayesian) |
| Sursa seminală≠ | Ferguson, T. S. (1973). A Bayesian analysis of some nonparametric problems. The Annals of Statistics, 1(2), 209–230. DOI ↗ | 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. DOI ↗ |
| Denumiri alternative≠ | 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 |
| Înrudite≠ | 3 | 2 | 3 |
| Rezumat≠ | 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. |
| ScholarGateSet de date ↗ |
|
|
|