arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.17035cs.LG
收藏

鲁棒核稀疏子空间聚类

Robust Kernel Sparse Subspace Clustering

Ruđer Bošković Institute(鲁杰·博什科维奇研究所)

Ivica Kopriva

AI总结:

针对现有核子空间聚类无法处理非高斯稀疏损坏的问题,提出首个鲁棒核稀疏子空间聚类算法,经两个数据集和Wilcoxon检验验证,性能显著优于线性鲁棒基线,且原理可推广至其他子空间聚类算法。

摘要:

核方法被应用于模式识别中的诸多问题,包括子空间聚类(subspace clustering, SC)。通过这种方式,输入数据空间中的非线性问题在映射后的高维特征空间中变为线性问题。由此,借助核技巧的隐式映射,可实现计算上易处理的非线性算法。然而,线性算法的核化仅在相关优化问题中使用误差项的Froebenious范数平方时才可行。但这意味着误差服从正态分布,这不适用于非高斯误差,例如以ℓ₁范数建模的严重稀疏损坏。据我们所知,本文首次针对存在严重稀疏损坏的数据提出了鲁棒核稀疏子空间聚类(robust kernel sparse SC, RKSSC)算法。该方法的原理原则上可应用于其他子空间聚类算法,以实现对此类损坏的鲁棒性。我们在两个知名数据集上验证了所提方法,并以线性鲁棒SSC算法作为基线模型。根据Wilcoxon检验,RKSSC算法取得的聚类性能在统计上显著优于鲁棒SSC算法的对应性能。所提RKSSC算法的MATLAB代码已发布在https://github.com/ikopriva/RKSSC。

英文摘要:

Kernel methods are applied to many problems in pattern recognition, including subspace clustering (SC). That way, nonlinear problems in the input data space become linear in mapped high-dimensional feature space. Thereby, computationally tractable nonlinear algorithms are enabled through implicit mapping by the virtue of kernel trick. However, kernelization of linear algorithms is possible only if square of the Froebenious norm of the error term is used in related optimization problem. That, however, implies normal distribution of the error. That is not appropriate for non-Gaussian errors such as gross sparse corruptions that are modeled by -norm. Herein, to the best of our knowledge, we propose for the first time robust kernel sparse SC (RKSSC) algorithm for data with gross sparse corruptions. The concept, in principle, can be applied to other SC algorithms to achieve robustness to the presence of such type of corruption. We validated proposed approach on two well-known datasets with linear robust SSC algorithm as a baseline model. According to Wilcoxon test, clustering performance obtained by the RKSSC algorithm is statistically significantly better than corresponding performance obtained by the robust SSC algorithm. MATLAB code of proposed RKSSC algorithm is posted on https://github.com/ikopriva/RKSSC.

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

↑