ScholarGate
Assistent

Methoden vergelijken

Bekijk de geselecteerde methoden naast elkaar; rijen die verschillen zijn gemarkeerd.

Uitlegbare NMF-onderwerpmodel×Onderwerpmodellering×
VakgebiedDeep learningDeep learning
FamilieMachine learningMachine learning
Jaar van ontstaan2001 (NMF); XAI integration ~2017–present1999–2003
GrondleggerLee, D. D. & Seung, H. S. (NMF); XAI layer attributed to community practice post-2016Hofmann, T. (pLSA, 1999); Blei, D. M., Ng, A. Y., & Jordan, M. I. (LDA, 2003)
TypeInterpretable unsupervised topic modelUnsupervised generative probabilistic model
Oorspronkelijke bronLee, 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 ↗
AliassenXAI-NMF, interpretable NMF topic model, explainable NMF, transparent NMF topic modelingLatent Semantic Analysis, probabilistic topic modeling, topic discovery, thematic modeling
Verwant65
SamenvattingAn 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.
ScholarGateGegevensset
  1. v1
  2. 2 Bronnen
  3. PUBLISHED
  1. v1
  2. 2 Bronnen
  3. PUBLISHED

Naar zoeken Dia's downloaden

ScholarGateMethoden vergelijken: Explainable NMF Topic Model · Topic Modeling. Geraadpleegd op 2026-06-15 via https://scholargate.app/nl/compare