Aug 2026· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· pp. 532-543· 0 citations· 8 references
TL;DR
A novel and efficient clustering algorithm based on collapsed Gibbs sampling is proposed, which automatically infers the number of clusters from the data and identifies representative words for each cluster, thereby enabling fully non-parametric and interpretable clustering.
Abstract
Short text clustering has become increasingly important with the popularity of social media. Existing methods fall into three paradigms: those based on topic models, deep representation learning, and large language models (LLMs). The first relies on the bag-of-words assumption, which ignores word order and semantic information. The second achieves strong performance but lacks interpretability. The third captures the most comprehensive semantic information but requires high-frequency, real-time API calls and incurs higher computational costs during model inference. In addition, the requirement to predefine the number of clusters remains a key issue. In this paper, we propose a Non-parametric Multi-View Model (NMVM) for short text clustering, which represents texts using two complementary views: bag-of-words and text embeddings. NMVM incorporates semantic information into a generative framework by integrating the Dirichlet process multinomial mixture model and the Dirichlet process gaussian mixture model. Notably, we propose and derive a novel and efficient clustering algorithm based on collapsed Gibbs sampling, which automatically infers the number of clusters from the data and identifies representative words for each cluster, thereby enabling fully non-parametric and interpretable clustering. Extensive experiments on six real-world datasets demonstrate the superiority of the proposed model over several strong baselines. Notably, our algorithm converges rapidly and demonstrates high efficiency. The source code is publicly available at~https://github.com/chehaoa/NMVM.
As digital textual data continues to grow exponentially, it becomes progressively harder to extract information from large collections of documents. Traditional full-text analysis methods often require substantial time and computational resources. This challenge is particularly relevant for massive corpora where import...
Fatima-Zahrae Sifi, Wafae Sabbar, Amal El Mzabi· Journal of Intelligent Decis...· 0 citations
TAHB (Text-Attributed Hypergraph Benchmark) is presented, the first public benchmark integrating hypergraph structures and raw textual attributes, and shows that LLM-enhanced textual semantics improve hypergraph learning performance, while structural and textual information jointly provide the best setting for LLM-base...
D. Y. Kang, Junghyun Kim, Ju-hyun Jeon et al.· 0 citations
This paper introduces the Structural Contextual Probabilistic Topic Model (SCPTM), an architecture that incorporates syntactic dependency relations into topic inference and concludes that syntactic encoding matters conditionally: it benefits action-oriented, argumentative texts, but introduces noise in informational or...
Standard multinomial models inadequately capture the sparsity, burstiness, and dependence present in highdimensional bag-of-words text. In this paper, we develop regression-based generative formulations of Smoothed Dirichlet (SD), Smoothed Generalized Dirichlet (SGD), and Smoothed Generalized Dirichlet Multinomial (SGD...
Sana Iftikhar, Fatma Najar, Nizar Bouguila· International Symposium on N...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.