Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Model tematic explicabil bazat pe NMF× | Modelarea tematică× | |
|---|---|---|
| Domeniu | Învățare profundă | Învățare profundă |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 2001 (NMF); XAI integration ~2017–present | 1999–2003 |
| Autorul original≠ | Lee, D. D. & Seung, H. S. (NMF); XAI layer attributed to community practice post-2016 | Hofmann, T. (pLSA, 1999); Blei, D. M., Ng, A. Y., & Jordan, M. I. (LDA, 2003) |
| Tip≠ | Interpretable unsupervised topic model | Unsupervised generative probabilistic model |
| 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 ↗ | Blei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent Dirichlet Allocation. Journal of Machine Learning Research, 3, 993–1022. link ↗ |
| Denumiri alternative | XAI-NMF, interpretable NMF topic model, explainable NMF, transparent NMF topic modeling | Latent Semantic Analysis, probabilistic topic modeling, topic discovery, thematic modeling |
| Înrudite≠ | 6 | 5 |
| 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. | Topic Modeling is a family of unsupervised probabilistic techniques for discovering latent thematic structure in large text collections. By learning which words tend to co-occur, models such as Latent Dirichlet Allocation (LDA) automatically surface coherent topics — each represented as a distribution over vocabulary — without requiring labelled data. |
| ScholarGateSet de date ↗ |
|
|