Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Förklaringsbar LDA-ämnesskapare× | Textklassificering× | |
|---|---|---|
| Ämnesområde≠ | Djupinlärning | Textutvinning |
| Familj≠ | Machine learning | Process / pipeline |
| Ursprungsår≠ | 2003 (LDA); 2018–present (explainability extensions) | — |
| Upphovsperson≠ | Blei, D. M., Ng, A. Y., & Jordan, M. I. (LDA seminal); explainability extensions by multiple authors | — |
| Typ≠ | Probabilistic generative topic model with interpretability enhancements | Supervised NLP classification task |
| Ursprungskälla≠ | Blei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent Dirichlet Allocation. Journal of Machine Learning Research, 3, 993–1022. link ↗ | Joachims, T. (1998). Text Categorization with Support Vector Machines: Learning with Many Relevant Features. ECML 1998. Lecture Notes in Computer Science, vol 1398. Springer. DOI ↗ |
| Alias | Explainable LDA, Interpretable LDA, XAI-LDA, Transparent Topic Model | text categorization, document classification, topic classification, metin sınıflandırma |
| Närliggande | 4 | 4 |
| Sammanfattning≠ | Explainable LDA combines Latent Dirichlet Allocation — the canonical probabilistic topic model introduced by Blei, Ng, and Jordan in 2003 — with post-hoc and intrinsic interpretability tools that make each discovered topic auditable, labeled, and trustworthy for human reviewers. It is widely used in NLP, social science text analysis, and computational humanities where transparency is required alongside discovery. | Text classification, also called text categorization, is a supervised natural-language-processing task that automatically assigns documents to predefined categories. Building on the support-vector-machine approach to text categorization established by Joachims (1998) and consolidated in the text-mining literature by Aggarwal and Zhai (2012), it powers tasks such as spam detection and topic classification by learning from labelled examples. |
| ScholarGateDatamängd ↗ |
|
|