arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.18435cs.LG
收藏

CAKE:通过K分区集合进行赋值的置信度

CAKE: Confidence in Assignments via K-partition Ensembles

Department of Informatics, Athens University of Economics and Business(经济与商业大学信息学院);Archimedes Research Unit, Athena Research Center(阿提卡研究中心阿基米德研究单位)

Aggelos Semoglou, John Pavlopoulos

AI总结:

CAKE通过K分区集合评估每个点的置信度,结合赋值稳定性与局部几何拟合一致性,提供0-1范围内的可解释评分,提升聚类结果的可靠性。

摘要:

聚类广泛用于无监督结构发现,但其对每个个体赋值的可靠性了解有限。诊断如收敛行为或目标值可能反映全局质量,但无法指示特定实例是否被自信赋值,尤其对初始化敏感的算法如k-means。这种赋值层面的不稳定性可能影响准确性和鲁棒性。集合方法通过聚合多个运行提高全局一致性,但通常缺乏量化点wise置信度的工具,无法结合跨运行一致性和学习到的聚类结构的几何支持。本文介绍CAKE(通过K分区集合进行赋值的置信度),一个框架,通过在聚类集合上计算的两个互补统计量评估每个点:赋值稳定性与局部几何拟合的一致性。这些被结合成一个单一的可解释评分,在[0,1]范围内。理论分析显示,CAKE在噪声下仍有效,并能区分稳定和不稳定点。在合成和现实数据集上的实验表明,CAKE能有效突出模糊点和稳定核心成员,提供可用于下游聚类工作流程中的实例置信度排名。

英文摘要:

Clustering is widely used for unsupervised structure discovery, yet it offers limited insight into how reliable each individual assignment is. Diagnostics, such as convergence behavior or objective values, may reflect global quality, but they do not indicate whether particular instances are assigned confidently, especially for initialization-sensitive algorithms like k-means. This assignment-level instability can undermine both accuracy and robustness. Ensemble approaches improve global consistency by aggregating multiple runs, but they typically lack tools for quantifying pointwise confidence in a way that combines cross-run agreement with geometric support from the learned cluster structure. This work introduces CAKE (Confidence in Assignments via K-partition Ensembles), a framework that evaluates each point using two complementary statistics computed over a clustering ensemble: assignment stability and consistency of local geometric fit. These are combined into a single, interpretable score in [0,1]. The theoretical analysis shows that CAKE remains effective under noise and separates stable from unstable points. Experiments on synthetic and real-world datasets indicate that CAKE effectively highlights ambiguous points and stable core members, providing a confidence ranking over instances that can be used for selection or prioritization in downstream clustering workflows.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑