ScholarGate
Assistent

Methoden vergleichen

Prüfen Sie die ausgewählten Methoden nebeneinander; abweichende Zeilen sind hervorgehoben.

Mehrsprachige Themenmodellierung×NMF-Themenmodell×
FachgebietDeep LearningDeep Learning
FamilieMachine learningMachine learning
Entstehungsjahr20091999
UrheberMimno, D., Wallach, H. M., et al.Lee, D. D. & Seung, H. S.
TypProbabilistic topic model (multilingual extension)Matrix factorization / unsupervised topic model
Wegweisende QuelleMimno, D., Wallach, H. M., Naradowsky, J., Smith, D. A., & McCallum, A. (2009). Polylingual topic models. In Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 880–889. ACL. link ↗Lee, D. D., & Seung, H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755), 788–791. DOI ↗
Aliasnamencross-lingual topic model, polylingual LDA, multilingual LDA, MLTMNMF, Non-negative Matrix Factorization, NMF for Topic Modeling, NNMF Topic Model
Verwandt54
ZusammenfassungMultilingual topic modeling extends probabilistic topic models such as LDA to corpora spanning two or more languages, inferring shared latent topics across language boundaries. By tying topic distributions across languages, it enables cross-lingual document analysis, comparable topic discovery, and information retrieval without requiring full parallel corpora.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.
ScholarGateDatensatz
  1. v1
  2. 2 Quellen
  3. PUBLISHED
  1. v1
  2. 2 Quellen
  3. PUBLISHED

Zur Suche Folien herunterladen

ScholarGateMethoden vergleichen: Multilingual topic modeling · NMF Topic Model. Abgerufen am 2026-06-17 von https://scholargate.app/de/compare