Võrdle meetodeid

	Poolitatud mittetäielikult jälgitud NMF-teemamudel	Poolitatud Transformer
Valdkond	Süvaõpe	Süvaõpe
Perekond	Machine learning	Machine learning
Tekkeaasta	2001 (NMF); semi-supervised variants from ~2010s	2018–2019
Looja	Lee & Seung (NMF); semi-supervised extensions by Jagarlamudi et al. and others	Devlin, J. et al. (BERT); broader SSL-Transformer paradigm community
Tüüp	Matrix factorization with supervision	Semi-supervised deep learning
Algallikas	Lee, D. D., & Seung, H. S. (2001). Algorithms for non-negative matrix factorization. Advances in Neural Information Processing Systems, 13, 556–562.	Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2019). BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. Proceedings of NAACL-HLT 2019, 4171–4186.
Rööpnimetused	SS-NMF, guided NMF, constrained NMF topic model, seed-guided NMF	semi-supervised transformer model, SSL transformer, transformer with self-supervised pre-training, semi-supervised attention model
Seotud	6	5
Kokkuvõte	Semi-supervised Non-negative Matrix Factorization (NMF) Topic Model extends unsupervised NMF by incorporating user-provided seed words or label constraints to steer discovered topics toward domain-relevant themes. It factorizes a document-term matrix into interpretable non-negative components while respecting lexical priors, yielding coherent, application-aligned topics even from modest corpora.	Semi-supervised learning with Transformer architectures leverages large quantities of unlabeled data alongside a small labeled set to train powerful sequence models. The dominant pattern — exemplified by BERT — first pre-trains the Transformer on unlabeled data using self-supervised objectives such as masked token prediction, then fine-tunes it on the labeled task. This two-stage approach dramatically reduces the labeled data needed to achieve strong performance.