Ji Jintian, Feng Songhe, Huang Jie, Wei Taotao, Feng Xiang, Lv Peiwu, Li Bing
School of Computer Science and Technology, Beijing Jiaotong University, Beijing, 100044, China; Key Laboratory of Big Data & Artificial Intelligence in Transportation, Ministry of Education, Beijing Jiaotong University, Beijing, 100044, China.
Jiangsu Railway Group Co., Ltd., Nanjing, 210012, China; Jiangsu Province Engineering Research Center of Intelligent and Green Railway, Nanjing, 210012, China.
Neural Netw. 2025 Oct;190:107652. doi: 10.1016/j.neunet.2025.107652. Epub 2025 Jun 3.
Tensor-based Incomplete Multi-view Clustering (TIMC) methods have received widespread attention due to the powerful data recovery capability of capturing cross-view high-order correlation. Although such methods have achieved remarkable progress, they still suffer from the following problems: (1) The extremely high computational complexity makes it hard for tensor-based methods to handle large-scale multi-view data. (2) Geometric structure constraints in the sample space often lead to high computational complexity and redundancy of structural information. (3) The commonly used Tensor Nuclear Norm (TNN) over-penalizes the primary rank components, leading to a sub-optimal representation tensor. Being aware of these, we propose Incomplete Multi-View Clustering with Efficient Anchor Tensor Recovery Framework (EATER). Specifically, it learns a group of anchors to construct a low-rank anchor tensor to recover the missing data with the high-order correlation among views and the geometric structure in the learned representation tensor is enhanced by an Anchor Laplacian Regularization (ALR). Moreover, instead of employing TNN, we adopt a tighter Non-convex Tensor Rank (NTR) to capture the multi-view high-order correlation effectively. An efficient iterative optimization algorithm is designed to solve the EATER, which is time-economical and enjoys favorable convergence. Extensive experimental results on various datasets demonstrate the superiority of the proposed algorithm as compared to state-of-the-art methods.
基于张量的不完全多视图聚类(TIMC)方法因具有强大的捕获跨视图高阶相关性的数据恢复能力而受到广泛关注。尽管此类方法已取得显著进展,但它们仍存在以下问题:(1)极高的计算复杂度使得基于张量的方法难以处理大规模多视图数据。(2)样本空间中的几何结构约束常常导致计算复杂度高和结构信息冗余。(3)常用的张量核范数(TNN)对主要秩分量惩罚过度,导致表示张量次优。意识到这些问题,我们提出了具有高效锚张量恢复框架(EATER)的不完全多视图聚类方法。具体而言,它学习一组锚点以构建低秩锚张量,利用视图间的高阶相关性恢复缺失数据,并且通过锚拉普拉斯正则化(ALR)增强学习到的表示张量中的几何结构。此外,我们采用更严格的非凸张量秩(NTR)来有效捕获多视图高阶相关性,而不是使用TNN。设计了一种高效的迭代优化算法来求解EATER,该算法节省时间且具有良好的收敛性。在各种数据集上的大量实验结果表明,与现有方法相比,所提出的算法具有优越性。