Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Model tematic explicabil bazat pe NMF× | Embeddings de propoziții× | |
|---|---|---|
| Domeniu | Învățare profundă | Învățare profundă |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 2001 (NMF); XAI integration ~2017–present | 2015–2019 |
| Autorul original≠ | Lee, D. D. & Seung, H. S. (NMF); XAI layer attributed to community practice post-2016 | Kiros et al. (Skip-Thought, 2015); Reimers & Gurevych (Sentence-BERT, 2019) |
| Tip≠ | Interpretable unsupervised topic model | Representation learning / embedding |
| Sursa seminală≠ | Lee, D. D., & Seung, H. S. (2001). Algorithms for non-negative matrix factorization. Advances in Neural Information Processing Systems, 13, 556–562. link ↗ | Reimers, N., & Gurevych, I. (2019). Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing (EMNLP), 3980–3990. DOI ↗ |
| Denumiri alternative | XAI-NMF, interpretable NMF topic model, explainable NMF, transparent NMF topic modeling | sentence vectors, sentence representations, SBERT, semantic sentence encoding |
| Înrudite≠ | 6 | 4 |
| Rezumat≠ | An Explainable NMF Topic Model combines Non-negative Matrix Factorization — a parts-based decomposition of a document-term matrix — with explicit interpretability techniques such as coherence metrics, word contribution scores, and SHAP-style attribution to make discovered topics transparent and auditable by human readers. | Sentence Embeddings convert a sentence or short text into a single fixed-length dense vector that captures its semantic meaning. These vectors allow downstream tasks — semantic similarity, clustering, retrieval, and classification — to operate on numerical representations instead of raw text, making them one of the most versatile building blocks in modern NLP pipelines. |
| ScholarGateSet de date ↗ |
|
|