School of Computer Science and Technology, Zhejiang Normal University, Jinhua 321004, China.
AI Research Institute of Beijing Geekplus Technology Co. Ltd., Beijing 100101, China.
Comput Intell Neurosci. 2023 Mar 17;2023:6654304. doi: 10.1155/2023/6654304. eCollection 2023.
Multikernel clustering achieves clustering of linearly inseparable data by applying a kernel method to samples in multiple views. A localized SimpleMKKM (LI-SimpleMKKM) algorithm has recently been proposed to perform min-max optimization in multikernel clustering where each instance is only required to be aligned with a certain proportion of the relatively close samples. The method has improved the reliability of clustering by focusing on the more closely paired samples and dropping the more distant ones. Although LI-SimpleMKKM achieves remarkable success in a wide range of applications, the method keeps the sum of the kernel weights unchanged. Thus, it restricts kernel weights and does not consider the correlation between the kernel matrices, especially between paired instances. To overcome such limitations, we propose adding a matrix-induced regularization to localized SimpleMKKM (LI-SimpleMKKM-MR). Our approach addresses the kernel weight restrictions with the regularization term and enhances the complementarity between base kernels. Thus, it does not limit kernel weights and fully considers the correlation between paired instances. Extensive experiments on several publicly available multikernel datasets show that our method performs better than its counterparts.
多核聚类通过在多个视图中对样本应用核方法来实现线性不可分离数据的聚类。最近提出了一种局部 SimpleMKKM(LI-SimpleMKKM)算法,用于在多核聚类中执行极大极小优化,其中每个实例仅需要与一定比例的相对接近的样本对齐。该方法通过关注更接近的配对样本并丢弃更远的样本,提高了聚类的可靠性。虽然 LI-SimpleMKKM 在广泛的应用中取得了显著的成功,但该方法保持核权重的总和不变。因此,它限制了核权重,并且不考虑核矩阵之间的相关性,特别是配对实例之间的相关性。为了克服这些限制,我们提出在局部 SimpleMKKM(LI-SimpleMKKM-MR)中添加矩阵诱导正则化。我们的方法通过正则化项解决了核权重限制问题,并增强了基础核之间的互补性。因此,它不限制核权重,并充分考虑了配对实例之间的相关性。在几个公开的多核数据集上进行的广泛实验表明,我们的方法优于其对应方法。