เปรียบเทียบวิธี

	[NEEDS TRANSLATION]	Markov Chain Monte Carlo (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.	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.