Metraipolis › archive › dc_aa7698c907ce
TopicMerge: A Divide and Conquer Approach to Topic Modeling — arXiv:2610.19323
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.19323
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T14:23:19.309Z
- SHA-256 of the archived text
21b8dd10aa1f13f9d13ad0ec0f2270d46f516815ece4944e170afc242a71054f- Stable URL of this page
https://metraipolis.com/documento/dc_aa7698c907ce
How to cite
TopicMerge: A Divide and Conquer Approach to Topic Modeling — arXiv:2610.19323 — arXiv (en), https://arxiv.org/abs/2610.19323 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_aa7698c907ce (Metraipolis archive dc_aa7698c907ce, sha256 21b8dd10aa1f13f9d13ad0ec0f2270d46f516815ece4944e170afc242a71054f)
BibTeX
@misc{dcaa7698c907ce,
title = {TopicMerge: A Divide and Conquer Approach to Topic Modeling — arXiv:2610.19323},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.19323},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_aa7698c907ce; sha256 21b8dd10aa1f13f9d13ad0ec0f2270d46f516815ece4944e170afc242a71054f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.19323. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Recent advancements in topic modeling have split into two main paths: efficient embedding-based methods that offer scalability but are often outperformed on standard clustering metrics, and Large Language Model (LLM) approaches that achieve state-of-the-art clustering performance but at the cost of prohibitive computational expense and poor scalability. This paper introduces TopicMerge, a novel multi-stage pipeline that bridges these approaches to achieve both state-of-the-art clustering performance and computational efficiency. TopicMerge first employs an efficient clustering pipeline to deliberately over-segment a document corpus into a large set of fine-grained, semantically pure micro-clusters, which are then given initial semantic labels. It then introduces a novel, iterative merging algorithm where an LLM, guided by local neighborhood context, arbitrates on consolidating candidate pairs. These approved merges are then selectively executed and semantically relabeled by the LLM, hierarchically building broader, more coherent topics. Extensive experiments on the Bills and Wiki datasets show that TopicMerge achieves state-of-the-art clustering performance while reducing required LLM calls by over 92% compared to document-level methods, offering a practical and scalable solution. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Computation and Language (cs.CL) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2610.19323 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T13:53:35.846Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).