BriefGPT.xyz
Jun, 2023
具有最优性保证的对抗鲁棒聚类
Adversarially robust clustering with optimality guarantees
HTML
PDF
Soham Jana, Kun Yang, Sanjeev Kulkarni
TL;DR
本文提供了一种新的算法,针对子高斯混合数据,能够在存在异常值的情况下,获得最佳错误率的相对较强聚类结果。
Abstract
We consider the problem of
clustering
data points coming from
sub-gaussian mixtures
. Existing methods that provably achieve the optimal
mislabeli
→