विधियों की तुलना करें

	स्व-पर्यवेक्षित एलडीए विषय मॉडल	एनएमएफ विषय मॉडल
क्षेत्र	गहन अधिगम	गहन अधिगम
परिवार	Machine learning	Machine learning
उद्भव वर्ष	2003 (LDA); self-supervised variants from 2020	1999
प्रवर्तक	Blei, D. M., Ng, A. Y., Jordan, M. I. (LDA); self-supervised extension by multiple authors (2020s)	Lee, D. D. & Seung, H. S.
प्रकार	Probabilistic generative model with self-supervised pretraining	Matrix factorization / unsupervised topic model
मौलिक स्रोत	Blei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent Dirichlet Allocation. Journal of Machine Learning Research, 3, 993–1022.	Lee, D. D., & Seung, H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755), 788–791.
उपनाम	SSL-LDA, self-supervised topic modeling, self-supervised LDA, contrastive LDA	NMF, Non-negative Matrix Factorization, NMF for Topic Modeling, NNMF Topic Model
संबंधित	6	4
सारांश	Self-supervised LDA combines the probabilistic generative framework of Latent Dirichlet Allocation with self-supervised pretraining signals — such as masked-word prediction or contrastive document objectives — to guide topic discovery without requiring hand-labeled training data. The result is topic representations that are simultaneously grounded in distributional statistics and enriched by language structure learned from raw text.	Non-negative Matrix Factorization (NMF) is an unsupervised matrix decomposition method that discovers latent topics in a text corpus by factoring a document-term matrix into two non-negative matrices — one encoding topic-word weights, the other document-topic weights. The non-negativity constraint yields parts-based, additive representations that tend to produce clean, interpretable topics.