Mei Shikun, Wang Qianqian, Gao Quanxue, Yang Ming
School of Telecommunications Engineering, Xidian University, Shaanxi 710071, China.
School of Telecommunications Engineering, Xidian University, Shaanxi 710071, China.
Neural Netw. 2025 Apr;184:107111. doi: 10.1016/j.neunet.2024.107111. Epub 2025 Jan 3.
Multi-view clustering has garnered significant attention due to its capacity to utilize information from multiple perspectives. The concept of anchor graph-based techniques was introduced to manage large-scale data better. However, current methods rely on K-means or uniform sampling to select anchors in the original space. This results in a disjointed approach separating anchor selection and subsequent graph construction. Moreover, these methods typically require additional K-means or spectral clustering to derive labels, often leading to suboptimal outcomes. To address these challenges, we present a novel approach called Multi-view Clustering based on Feature Selection and Semi-Non-Negative Anchor Graph Factorization (MCFSAF). This method unifies feature selection, anchor and anchor graph learning, and semi-non-negative factorization of the anchor graph into a cohesive framework. Within this framework, the anchors and anchor graph are learned in the embedding space following feature selection, and the clustering indicator matrix is obtained via semi-non-negative factorization of the anchor graph in each view. By applying the minimization of the tensor Schatten p-norm, we can uncover complementary information across multiple views efficiently. This synergetic process of anchor selection, anchor graph learning, and indicator matrix updating can effectively enhance the clustering quality. Critically, the fused indicator matrix enables us to directly acquire clustering labels without requiring additional K-means, thereby significantly improving the stability of the clustering process. Our method is optimized via an alternating iterations algorithm. Comprehensive experimental evaluations underscore the superior performance of our approach.
多视图聚类因其能够从多个角度利用信息而备受关注。基于锚图的技术概念被引入以更好地管理大规模数据。然而,当前方法依赖K均值或均匀采样在原始空间中选择锚点。这导致了一种脱节的方法,将锚点选择与后续的图构建分开。此外,这些方法通常需要额外的K均值或谱聚类来导出标签,这往往导致次优结果。为了应对这些挑战,我们提出了一种名为基于特征选择和半非负锚图分解的多视图聚类(MCFSAF)的新方法。该方法将特征选择、锚点和锚图学习以及锚图的半非负分解统一到一个连贯的框架中。在这个框架内,在特征选择之后在嵌入空间中学习锚点和锚图,并通过在每个视图中对锚图进行半非负分解来获得聚类指示矩阵。通过应用张量Schatten p范数的最小化,我们可以有效地发现多个视图中的互补信息。这种锚点选择、锚图学习和指示矩阵更新的协同过程可以有效地提高聚类质量。至关重要的是,融合后的指示矩阵使我们能够直接获得聚类标签,而无需额外的K均值,从而显著提高聚类过程的稳定性。我们的方法通过交替迭代算法进行优化。全面的实验评估强调了我们方法的卓越性能。