方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 可解释主题建模× | NMF 主题模型× | |
|---|---|---|
| 领域 | 深度学习 | 深度学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 2003–2020s | 1999 |
| 提出者≠ | Community practice (Blei et al. seminal; explainability extensions 2010s–present) | Lee, D. D. & Seung, H. S. |
| 类型≠ | Unsupervised topic discovery + interpretability layer | Matrix factorization / unsupervised topic model |
| 开创性文献≠ | Blei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent Dirichlet Allocation. Journal of Machine Learning Research, 3, 993–1022. link ↗ | Lee, D. D., & Seung, H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755), 788–791. DOI ↗ |
| 别名 | XTM, interpretable topic modeling, transparent topic modeling, explainable LDA | NMF, Non-negative Matrix Factorization, NMF for Topic Modeling, NNMF Topic Model |
| 相关≠ | 6 | 4 |
| 摘要≠ | Explainable Topic Modeling combines unsupervised topic discovery — such as LDA, NMF, or neural variants like BERTopic — with interpretability tools (top-word lists, coherence scores, SHAP, attention weights) that make the learned topics transparent, auditable, and communicable to domain experts and stakeholders beyond the modeling team. | 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. |
| ScholarGate数据集 ↗ |
|
|