Intent Clustering with Shared Pseudo-Labels

I-Fan Lin, Faegheh Hasibi, Suzan Verberne
10/16/2025
cs.CLcs.IR

No confident code implementation found for this paper.

Abstract

In this paper, we propose an intuitive, training-free and label-free method for intent clustering that makes minimal assumptions using lightweight and open-source LLMs. Many current approaches rely on commercial LLMs, which are costly, and offer limited transparency. Additionally, their methods often explicitly depend on knowing the number of clusters in advance, which is often not the case in realistic settings. To address these challenges, instead of asking the LLM to match similar text directly, we first ask it to generate pseudo-labels for each text, and then perform multi-label classification in this pseudo-label set for each text. This approach is based on the hypothesis that texts belonging to the same cluster will share more labels, and will therefore be closer when encoded into embeddings. These pseudo-labels are more human-readable than direct similarity matches. Our evaluation on four benchmark sets shows that our approach achieves results comparable to and better than recent baselines, while remaining simple and computationally efficient. Our findings indicate that our method can be applied in low-resource scenarios and is stable across multiple models and datasets.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lin2025intent,
  title  = {Intent Clustering with Shared Pseudo-Labels},
  author = {I-Fan Lin and Faegheh Hasibi and Suzan Verberne},
  year   = {2025},
  eprint = {2510.14640},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.14640v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2510.14640.svg)](https://codeofpaper.com/paper/2510.14640)

Discussion