방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 설명 가능한 LDA 토픽 모델× | 텍스트 분류× | |
|---|---|---|
| 분야≠ | 딥러닝 | 텍스트 마이닝 |
| 계열≠ | Machine learning | Process / pipeline |
| 기원 연도≠ | 2003 (LDA); 2018–present (explainability extensions) | — |
| 창시자≠ | Blei, D. M., Ng, A. Y., & Jordan, M. I. (LDA seminal); explainability extensions by multiple authors | — |
| 유형≠ | Probabilistic generative topic model with interpretability enhancements | Supervised NLP classification task |
| 원전≠ | 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 ↗ |
| 별칭 | Explainable LDA, Interpretable LDA, XAI-LDA, Transparent Topic Model | text categorization, document classification, topic classification, metin sınıflandırma |
| 관련 | 4 | 4 |
| 요약≠ | 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. |
| ScholarGate데이터셋 ↗ |
|
|