ScholarGate
Assistent

Sammenlign metoder

Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.

Forklarbar emnemodellering×Setningsembddinger×
FagfeltDyp læringDyp læring
FamilieMachine learningMachine learning
Opprinnelsesår2003–2020s2015–2019
OpphavspersonCommunity practice (Blei et al. seminal; explainability extensions 2010s–present)Kiros et al. (Skip-Thought, 2015); Reimers & Gurevych (Sentence-BERT, 2019)
TypeUnsupervised topic discovery + interpretability layerRepresentation learning / embedding
Opprinnelig kildeBlei, D. M., Ng, A. Y., & Jordan, M. I. (2003). Latent Dirichlet Allocation. Journal of Machine Learning Research, 3, 993–1022. link ↗Reimers, N., & Gurevych, I. (2019). Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks. Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing (EMNLP), 3980–3990. DOI ↗
AliasXTM, interpretable topic modeling, transparent topic modeling, explainable LDAsentence vectors, sentence representations, SBERT, semantic sentence encoding
Relaterte64
SammendragExplainable 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.Sentence Embeddings convert a sentence or short text into a single fixed-length dense vector that captures its semantic meaning. These vectors allow downstream tasks — semantic similarity, clustering, retrieval, and classification — to operate on numerical representations instead of raw text, making them one of the most versatile building blocks in modern NLP pipelines.
ScholarGateDatasett
  1. v1
  2. 2 Kilder
  3. PUBLISHED
  1. v1
  2. 2 Kilder
  3. PUBLISHED

Gå til søk Last ned lysbilder

ScholarGateSammenlign metoder: Explainable Topic Modeling · Sentence Embeddings. Hentet 2026-06-17 fra https://scholargate.app/no/compare