用多重伪标签增强相似性,无训练无标签实现对话搜索意图聚类
LUMI: Unsupervised Intent Clustering with Multiple Pseudo-Labels
- 为每条文本生成多个伪标签,通过共享标签增强语义相似性
- 在4个基准数据集上优于最新SOTA方法,无需预设聚类数
- 适合无标注、短文本的意图聚类场景,无需模型微调
本文提出一种直观、无需训练且无标签的对话搜索意图聚类方法LUMI。现有短文本聚类方法依赖大模型生成的单一伪标签来丰富表示或判断文本对相似性,存在两个局限:一是每条文本仅分配一个标签,优化表示时易不稳定;二是将相似性视为二元选择,忽略程度差异。LUMI通过共享伪标签放大文本间相似性:先为每条文本生成伪标签并构建伪标签集合,再计算伪标签嵌入均值并与文本嵌入融合;最后基于共享标签数量进行文本级聚合。在四个基准数据集上的评估表明,该方法性能优于近期SOTA,且无需在嵌入优化阶段估计聚类数量,验证了其在无监督短文本聚类中的有效性。
原文摘要 · Abstract (English)
In this paper, we propose an intuitive, training-free and label-free method for intent clustering in conversational search. Current approaches to short text clustering use LLM-generated pseudo-labels to enrich text representations or to identify similar text pairs for pooling. The limitations are: (1) each text is assigned only a single label, and refining representations toward a single label can be unstable; (2) text-level similarity is treated as a binary selection, which fails to account for continuous degrees of similarity. Our method LUMI is designed to amplify similarities between texts by using shared pseudo-labels. We first generate pseudo-labels for each text and collect them into a pseudo-label set. Next, we compute the mean of the pseudo-label embeddings and pool it with the text embedding. Finally, we perform text-level pooling: Each text representation is pooled with its similar pairs, where similarity is determined by the degree of shared labels. Our evaluation on four benchmark sets shows that our approach achieves competitive results, better than recent state-of-the-art baselines, while avoiding the need to estimate the number of clusters during embedding refinement, as is required by most methods. Our findings indicate that LUMI can effectively be applied in unsupervised short-text clustering scenarios.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。