.png){kind=icon}
Return
Large language models for efficient topic modeling
.png){kind=icon}
PRE
AI
DOI：10.1007/s00521-025-11593-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The utilization of large language models (LLMs) in research is becoming increasingly prevalent, as they offer advanced capabilities in processing and generating human-like text. However, this advancement comes with a significant trade-off in terms of time and computational costs. In this paper, we demonstrate that analyzing large text datasets with the use of LLMs can be performed efficiently in terms of both time and energy. For this purpose, we utilize the Llama pre-trained model. In more detail, we study the topic modeling task where the goal is to discover and identify topics in large text corpora. The basis of our approach is a hierarchical divisive clustering technique that clusters the data based on their semantic similarity, after employing a Sentence-BERT encoder, pre-trained on a variety of data across different tasks. Then, using an LLM, we identify topics for representative samples from each cluster. Additionally, we introduce a new evaluation method that leverages the capabilities of LLMs to assess the alignment between discovered topics and ground truth labels, providing a robust validation metric. Our findings indicate that it is possible to effectively reduce the computational cost of the topic modeling process compared to the direct application of LLMs and BERTopic, while simultaneously enhancing inference time and overall efficiency, thereby surpassing the current state-of-the-art capabilities of BERTopic.
Keywords:
Large language models
Hierarchical divisive clustering
Llama 3.1
BERTopic
Journal
IF:
4.5
Papers:
954
Citations:
3.2W
Organization
Cited Papers
A short text topic modeling method based on integrating Gaussian and Logistic coding networks with pre-trained word embeddings.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
ShareSave
ShareSaveShareSaveShareSave
ShareSaveShareSave
View more