ScholarGate
Pembantu

Bandingkan kaedah

Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.

Pemodelan Topik Multimodus×Model Topikal NMF×
BidangPembelajaran MendalamPembelajaran Mendalam
KeluargaMachine learningMachine learning
Tahun asal2003–present1999
PengasasBlei, D. M. & Jordan, M. I. (foundational corr-LDA); extended by many authorsLee, D. D. & Seung, H. S.
JenisGenerative probabilistic topic modelMatrix factorization / unsupervised topic model
Sumber perintisBlei, D. M., & Jordan, M. I. (2003). Modeling annotated data. Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 127–134. DOI ↗Lee, D. D., & Seung, H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755), 788–791. DOI ↗
AliasMultimodal LDA, multi-modal topic model, cross-modal topic modeling, MM-TMNMF, Non-negative Matrix Factorization, NMF for Topic Modeling, NNMF Topic Model
Berkaitan64
RingkasanMultimodal topic modeling discovers latent thematic structure shared across multiple data modalities — for example, co-occurring words and images — by learning a joint probabilistic representation that aligns topics across modalities. It extends classical text-only approaches such as LDA to settings where each document or observation consists of heterogeneous data types.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.
ScholarGateSet data
  1. v1
  2. 2 Sumber
  3. PUBLISHED
  1. v1
  2. 2 Sumber
  3. PUBLISHED

Pergi ke carian Muat turun slaid

ScholarGateBandingkan kaedah: Multimodal Topic Modeling · NMF Topic Model. Dicapai 2026-06-17 daripada https://scholargate.app/ms/compare