Compară metode

	Model de subiecte NMF adaptiv la domeniu	Model de Topic NMF
Domeniu	Învățare profundă	Învățare profundă
Familie	Machine learning	Machine learning
Anul apariției	1999 (NMF); domain adaptation variants ~2010s	1999
Autorul original	Lee, D. D. & Seung, H. S. (NMF base); domain adaptation extensions by the NLP community	Lee, D. D. & Seung, H. S.
Tip	Unsupervised topic model with domain adaptation	Matrix factorization / unsupervised topic model
Sursa seminală	Lee, D. D., & Seung, H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755), 788–791.	Lee, D. D., & Seung, H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755), 788–791.
Denumiri alternative	DA-NMF, cross-domain NMF, domain-adaptive topic modeling with NMF, transfer NMF topic model	NMF, Non-negative Matrix Factorization, NMF for Topic Modeling, NNMF Topic Model
Înrudite	4	4
Rezumat	Domain-adaptive NMF Topic Modeling applies Non-negative Matrix Factorization to discover latent topics across text from multiple domains, using regularization or shared basis constraints to transfer topic knowledge from a resource-rich source domain to a target domain with limited labeled data. It combines interpretable parts-based decomposition with domain-adaptation objectives to produce topics that are both domain-specific and cross-domain consistent.	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.