Ji Jintian, Feng Songhe
School of Computer Science and Technology, Beijing Jiaotong University, Beijing, 100044, China; Engineering Research Center of Integration and Application of Digital Learning Technology, Ministry of Education, Beijing, China.
Neural Netw. 2025 Feb;182:106849. doi: 10.1016/j.neunet.2024.106849. Epub 2024 Nov 15.
The tensor-based multi-view clustering approach captures the high-order correlation among different views by learning a low-rank representation tensor, which has achieved favorable performance in multi-view clustering. However, the tensor rank approximation functions used by the extant algorithms are not tight enough to the true rank of the tensor, leading to the undesired low-rank structure. Besides, the fusion strategy at the affinity matrix level is less robust to noise, resulting in sub-optimal clustering results. To tackle these issues, we propose a Partition-Level Fusion Induced Multi-view Subspace Clustering with Tensorial Geman Rank (PFMSC-TGR). Firstly, a tighter surrogate of tensor rank is designed, named Tensorial Geman Rank (TGR). Under the constraint of TGR, all non-zero singular values are penalized with suitable strength, leading to a strongly discriminative representation tensor. Secondly, we fuse the information of all views at the partition level to obtain a consistent indicator matrix, which enhances the stability of the model against noisy information. Furthermore, we combine these two items in a unified framework and employ an efficient algorithm to optimize the objective function. We further mathematically prove that the sequences constructed by our proposed algorithm converge to the stationary KKT point. Extensive experiments are conducted on nine data sets with different types and sizes, and the results of comparison with the eleven state-of-the-art algorithms prove the superiority of our algorithm. Our code is publicly available at: https://github.com/jijintian/PFMSC-TGR.
基于张量的多视图聚类方法通过学习低秩表示张量来捕捉不同视图之间的高阶相关性,该方法在多视图聚类中取得了良好的性能。然而,现有算法所使用的张量秩近似函数与张量的真实秩不够紧密,导致出现不理想的低秩结构。此外,亲和矩阵层面的融合策略对噪声的鲁棒性较差,从而导致聚类结果次优。为了解决这些问题,我们提出了一种基于分区级融合的多视图子空间聚类方法——带张量吉曼秩的分区级融合诱导多视图子空间聚类(PFMSC-TGR)。首先,设计了一种更紧密的张量秩替代物,称为张量吉曼秩(TGR)。在TGR的约束下,所有非零奇异值都以适当的强度进行惩罚,从而得到一个具有强判别力的表示张量。其次,我们在分区级别融合所有视图的信息以获得一个一致的指示矩阵,这增强了模型对噪声信息的稳定性。此外,我们将这两个部分结合在一个统一的框架中,并采用一种高效算法来优化目标函数。我们进一步从数学上证明了我们提出的算法所构造的序列收敛到平稳的KKT点。在九个不同类型和大小的数据集上进行了广泛的实验,与十一种最先进算法的比较结果证明了我们算法的优越性。我们的代码可在以下网址公开获取:https://github.com/jijintian/PFMSC-TGR。