방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 잠재 디리클레 할당 (Latent Dirichlet Allocation, LDA)× | 마르코프 연쇄 몬테카를로 (MCMC)× | |
|---|---|---|
| 분야≠ | 머신러닝 | 베이지안 |
| 계열≠ | Latent structure | Bayesian methods |
| 기원 연도≠ | 2003 | — |
| 창시자≠ | Blei, D. M.; Ng, A. Y.; Jordan, M. I. | — |
| 유형≠ | Generative probabilistic topic model (three-level hierarchical Bayesian) | Posterior sampling algorithm |
| 원전≠ | Blei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent Dirichlet allocation. Journal of Machine Learning Research, 3, 993–1022. 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 |
| 별칭≠ | LDA, topic model, Blei-Ng-Jordan model, probabilistic topic modeling | markov chain monte carlo, MCMC sampling, MCMC (Markov Zinciri Monte Carlo) |
| 관련 | 3 | 3 |
| 요약≠ | 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. |
| ScholarGate데이터셋 ↗ |
|
|