Compară metode
Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.
| Modelare explicabilă a subiectelor× | Clasificare explicabilă bazată pe BERT× | |
|---|---|---|
| Domeniu | Învățare profundă | Învățare profundă |
| Familie | Machine learning | Machine learning |
| Anul apariției≠ | 2003–2020s | 2019–2020 |
| Autorul original≠ | Community practice (Blei et al. seminal; explainability extensions 2010s–present) | Devlin et al. (BERT); explainability methods by Lundberg & Lee (SHAP), Ribeiro et al. (LIME), Sundararajan et al. (Integrated Gradients) |
| Tip≠ | Unsupervised topic discovery + interpretability layer | Pre-trained transformer classifier with post-hoc or intrinsic explainability |
| Sursa seminală≠ | Blei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent Dirichlet Allocation. Journal of Machine Learning Research, 3, 993–1022. link ↗ | Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2019). BERT: Pre-training of deep bidirectional transformers for language understanding. Proceedings of NAACL-HLT 2019, pp. 4171–4186. DOI ↗ |
| Denumiri alternative | XTM, interpretable topic modeling, transparent topic modeling, explainable LDA | XAI-BERT, interpretable BERT classifier, BERT with post-hoc explanation, transparent BERT classification |
| Înrudite | 6 | 6 |
| Rezumat≠ | 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. | Explainable BERT-based Classification combines the predictive power of fine-tuned BERT transformers for text classification with post-hoc or intrinsic explainability techniques — such as SHAP, LIME, attention analysis, or integrated gradients — to reveal which words or tokens drove each prediction. The result is a classifier that is both accurate and interpretable enough for high-stakes or auditable NLP applications. |
| ScholarGateSet de date ↗ |
|
|