Interpretable Topic Extraction and Word Embedding Learning Using Row-Stochastic DEDICOM
Résumé
The DEDICOM algorithm provides a uniquely interpretable matrix factorization method for symmetric and asymmetric square matrices. We employ a new row-stochastic variation of DEDICOM on the pointwise mutual information matrices of text corpora to identify latent topic clusters within the vocabulary and simultaneously learn interpretable word embeddings. We introduce a method to efficiently train a constrained DEDICOM algorithm and a qualitative evaluation of its topic modeling and word embedding performance.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
