قارن الطرق

	نموذج موضوعات تحليل المصفوفة غير السالبة (NMF)	تصنيف قائم على BERT
المجال	التعلم العميق	التعلم العميق
العائلة	Machine learning	Machine learning
سنة النشأة	1999	2019
صاحب الطريقة	Lee, D. D. & Seung, H. S.	Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (Google AI Language)
النوع	Matrix factorization / unsupervised topic model	Pre-trained language model with fine-tuning
المصدر التأسيسي	Lee, D. D., & Seung, H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755), 788–791.	Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2019). BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. In Proceedings of NAACL-HLT 2019 (pp. 4171–4186). Association for Computational Linguistics.
الأسماء البديلة	NMF, Non-negative Matrix Factorization, NMF for Topic Modeling, NNMF Topic Model	BERT classifier, BERT fine-tuning for classification, BERT text classification, BERT-CLS
ذات صلة	4	4
الملخص	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.	BERT-based Classification fine-tunes Google's Bidirectional Encoder Representations from Transformers model on a labelled text dataset, replacing the generic pre-trained head with a task-specific classification layer. It exploits deep bidirectional context from hundreds of millions of pre-trained parameters to deliver state-of-the-art accuracy on short- and medium-length text classification tasks with relatively modest amounts of labelled data.