A Comparative Analysis of Topic Reduction Techniques for BERTopic

9Citations
Citations of this article
49Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

BERTopic is a state-of-the-art topic modeling framework that generates topics by clustering contextualized document embeddings. However, its default clustering algorithm, HDBSCAN, often generates an excessive number of topics, which hinders meaningful comparisons or applications in downstream tasks. While different topic reduction methods exist, literature lacks a comparison of these methods and their impact on the quality of the reduced topics. This study offers an in-depth exploration of 1) topic reduction methods for BERTopic, including existing approaches for direct or indirect reduction, and 2) novel techniques that leverage large language models (LLMs), either by using the LLM-generated topic labels to create topic embeddings or by directly prompting the model for identifying overlapping topics. A comparative study of these topic reduction methods is performed, evaluating their performance in terms of coherence and diversity across multiple social media and web datasets. Our findings indicate that indirect topic reduction (e.g., agglomerative clustering) yields more diverse topics, though sometimes at the cost of coherence, compared to direct topic reduction (increasing the minimum cluster size). LLM prompting outperforms agglomerative clustering in both coherence and diversity, though at a higher computational cost. Therefore, we recommend selecting a reduction method based on dataset characteristics, computational resources, and the desired balance between diversity and coherence.

Cite

CITATION STYLE

APA

Janssens, W., Bogaert, M., & Van Den Poel, D. (2025). A Comparative Analysis of Topic Reduction Techniques for BERTopic. IEEE Access, 13, 204087–204103. https://doi.org/10.1109/ACCESS.2025.3638956

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free