השוואת שיטות

	הקצאת דיריכלה סמויה (LDA)	אשכול K-Means
תחום	למידת מכונה	למידת מכונה
משפחה	Latent structure	Machine learning
שנת המקור	2003	1967
הוגה השיטה	Blei, D. M.; Ng, A. Y.; Jordan, M. I.	MacQueen, J.
סוג	Generative probabilistic topic model (three-level hierarchical Bayesian)	Partitional clustering (centroid-based)
מקור מכונן	Blei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent Dirichlet allocation. Journal of Machine Learning Research, 3, 993–1022.	MacQueen, J. (1967). Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, 281–297.
כינויים	LDA, topic model, Blei-Ng-Jordan model, probabilistic topic modeling	K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering
קשורות	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.	K-Means Clustering is a centroid-based partitional clustering algorithm, traced to J. MacQueen in 1967, that splits data into k clusters by assigning each observation to its nearest cluster centre. It is widely used for marketing segmentation, customer grouping, and exploratory analysis.