Back to search

Clemson University

Analyzing Clustered Latent Dirichlet Allocation

Abstract

dc:description.abstract

Dynamic Topic Models (DTM) are a way to extract time-variant information from a collection of documents. The only available implementation of this is slow, taking days to process a corpus of 533,588 documents. In order to see how topics - both their key words and their proportional size in all documents - change over time, we analyze Clustered Latent Dirichlet Allocation (CLDA) as an alternative to DTM. This algorithm is based on existing parallel components, using Latent Dirichlet Allocation (LDA) to extract topics at local times, and k-means clustering to combine topics from dierent time periods. This method is two orders of magnitude faster than DTM, and allows for more freedom of experiment design. Results show that most topics generated by this algorithm are similar to those generated by DTM at both the local and global level using the Jaccard index and Sørensen-Dice coecient, and that this method's perplexity compares favorably to DTM. We also explore tradeos in CLDA method parameters.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Computer Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Gropp, Christopher
Contributors dc:contributor
  • Dr. Amy Apon, Committee Chair
  • Dr. Brian Malloy
  • Dr. Paul Wilson

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_theses/2471

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Gropp, Christopher. Analyzing Clustered Latent Dirichlet Allocation. Thesis thesis, https://open.clemson.edu/all_theses/2471