পদ্ধতির তুলনা করুন

	দুর্বলভাবে তত্ত্বাবধানে থাকা বিষয় মডেলিং	NMF টপিক মডেল
ক্ষেত্র	গভীর শিখন	গভীর শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	2012–2017	1999
প্রবর্তক	Jagarlamudi, Daume & Udupa; Gallagher et al. (CorEx)	Lee, D. D. & Seung, H. S.
ধরন	Weakly supervised probabilistic topic model	Matrix factorization / unsupervised topic model
মৌলিক উৎস	Jagarlamudi, J., Daume III, H., & Udupa, R. (2012). Incorporating Lexical Priors into Topic Models. Proceedings of EACL 2012, 204–213.	Lee, D. D., & Seung, H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755), 788–791.
অপর নাম	guided topic modeling, seed-guided topic model, constrained topic modeling, seeded LDA	NMF, Non-negative Matrix Factorization, NMF for Topic Modeling, NNMF Topic Model
সম্পর্কিত	5	4
সারসংক্ষেপ	Weakly supervised topic modeling incorporates lightweight domain knowledge — typically seed words or soft constraints — into a probabilistic topic model to steer discovered topics toward researcher-meaningful themes. It sits between fully unsupervised LDA and supervised classifiers, requiring far less annotation than the latter while producing more interpretable and domain-aligned topics than the former.	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.