Learning Topic Hierarchies by Tree-Directed Latent Variable Models
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929474781577216 |
|---|---|
| author | Chakraborty, Sunrit Lei, Rayleigh Nguyen, XuanLong |
| author_facet | Chakraborty, Sunrit Lei, Rayleigh Nguyen, XuanLong |
| contents | We study a parametric family of latent variable models, namely topic models, equipped with a hierarchical structure among the topic variables. Such models may be viewed as a finite mixture of the latent Dirichlet allocation (LDA) induced distributions, but the LDA components are constrained by a latent hierarchy, specifically a rooted and directed tree structure, which enables the learning of interpretable and latent topic hierarchies of interest. A mathematical framework is developed in order to establish identifiability of the latent topic hierarchy under suitable regularity conditions, and to derive bounds for posterior contraction rates of the model and its parameters. We demonstrate the usefulness of such models and validate its theoretical properties through a careful simulation study and a real data example using the New York Times articles. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_14327 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Learning Topic Hierarchies by Tree-Directed Latent Variable Models Chakraborty, Sunrit Lei, Rayleigh Nguyen, XuanLong Statistics Theory We study a parametric family of latent variable models, namely topic models, equipped with a hierarchical structure among the topic variables. Such models may be viewed as a finite mixture of the latent Dirichlet allocation (LDA) induced distributions, but the LDA components are constrained by a latent hierarchy, specifically a rooted and directed tree structure, which enables the learning of interpretable and latent topic hierarchies of interest. A mathematical framework is developed in order to establish identifiability of the latent topic hierarchy under suitable regularity conditions, and to derive bounds for posterior contraction rates of the model and its parameters. We demonstrate the usefulness of such models and validate its theoretical properties through a careful simulation study and a real data example using the New York Times articles. |
| title | Learning Topic Hierarchies by Tree-Directed Latent Variable Models |
| topic | Statistics Theory |
| url | https://arxiv.org/abs/2408.14327 |