Tensor-based Graph Learning with Consistency and Specificity for Multi-view Clustering

ML GNN and MP GNNs Clustering Algorithm
2024年03月27日
在多视角聚类的背景下,图学习被认为是一种关键技术,通常涉及基于概率邻居构建自适应邻居图,然后学习一致图以进行聚类。然而,它们面临两个限制。首先,它们通常依赖于欧几里得距离来衡量相似性,但在实践中无法捕捉数据点之间的内在结构。其次,大多数方法仅关注一致图,忽略每个视图的独特信息。虽然一些基于图的研究也考虑使用特定信息,但所采用的建模方法未排除特定组件的噪声影响。因此,我们提出了一种新颖的基于张量的多视图图学习框架,同时考虑一致性和特异性,有效消除噪声的影响。具体而言,我们在斯蒂费尔流形上计算相似距离以保留数据的内在属性。通过假设每个视图的学习邻居图包含一致部分、特定部分和噪声部分,我们为无噪声图融合制定了一种新的基于张量的目标图学习范式。由于张量奇异值分解(t-SVD)揭示高阶相关性的优点,该模型能够完全理解目标图。此外,我们推导了一种算法来解决优化问题。在六个数据集上的实验证明了我们方法的优越性。我们已经在 https://github.com/lshi91/CSTGL-Code 上发布了源代码。
In the context of multi-view clustering, graph learning is recognized as a crucial technique, which generally involves constructing an adaptive neighbor graph based on probabilistic neighbors, and then learning a consensus graph to for clustering. However, they are confronted with two limitations. Firstly, they often rely on Euclidean distance to measure similarity when constructing the adaptive neighbor graph, which proves inadequate in capturing the intrinsic structure among data points in practice. Secondly, most of these methods focus solely on consensus graph, ignoring unique information from each view. Although a few graph-based studies have considered using specific information as well, the modelling approach employed does not exclude the noise impact from the specific component. To this end, we propose a novel tensor-based multi-view graph learning framework that simultaneously considers consistency and specificity, while effectively eliminating the influence of noise. Specifically, we calculate similarity distance on the Stiefel manifold to preserve the intrinsic properties of data. By making an assumption that the learned neighbor graph of each view comprises a consistent part, a specific part, and a noise part, we formulate a new tensor-based target graph learning paradigm for noise-free graph fusion. Owing to the benefits of tensor singular value decomposition (t-SVD) in uncovering high-order correlations, this model is capable of achieving a complete understanding of the target graph. Furthermore, we derive an algorithm to address the optimization problem. Experiments on six datasets have demonstrated the superiority of our method. We have released the source code on https://github.com/lshi91/CSTGL-Code.
许愿