방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 변분 추론× | 잠재 디리클레 할당 (Latent Dirichlet Allocation, LDA)× | |
|---|---|---|
| 분야≠ | 베이지안 | 머신러닝 |
| 계열≠ | Bayesian methods | Latent structure |
| 기원 연도≠ | 1999 | 2003 |
| 창시자≠ | Jordan, Ghahramani, Jaakkola & Saul | Blei, D. M.; Ng, A. Y.; Jordan, M. I. |
| 유형≠ | Approximate Bayesian inference | Generative probabilistic topic model (three-level hierarchical Bayesian) |
| 원전≠ | Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1999). An introduction to variational methods for graphical models. Machine Learning, 37(2), 183–233. DOI ↗ | Blei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent Dirichlet allocation. Journal of Machine Learning Research, 3, 993–1022. DOI ↗ |
| 별칭≠ | VI, variational Bayes, VB, mean-field variational inference | LDA, topic model, Blei-Ng-Jordan model, probabilistic topic modeling |
| 관련≠ | 4 | 3 |
| 요약≠ | Variational inference (VI) is a family of techniques that turn Bayesian posterior computation into an optimisation problem. Instead of drawing samples from the exact posterior — as Markov chain Monte Carlo does — VI posits a simpler, tractable family of distributions and finds the member of that family closest to the true posterior by maximising the evidence lower bound (ELBO). Introduced in its modern graphical-model form by Jordan, Ghahramani, Jaakkola and Saul (1999) and given a comprehensive statistical treatment by Blei, Kucukelbir and McAuliffe (2017), VI is now the standard scalable inference engine in probabilistic machine learning. | 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. |
| ScholarGate데이터셋 ↗ |
|
|