Wang Haiyan, Han Guoqiang, Zhang Bin, Tao Guihua, Cai Hongmin
IEEE Trans Image Process. 2021;30:8396-8409. doi: 10.1109/TIP.2021.3114995. Epub 2021 Oct 7.
Multi-view clustering aims to partition objects into potential categories by utilizing cross-view information. One of the core issues is to sufficiently leverage different views to learn a latent subspace, within which the clustering task is performed. Recently, it has been shown that representing the multi-view data by a tensor and then learning a latent self-expressive tensor is effective. However, early works mainly focus on learning essential tensor representation from multi-view data and the resulted affinity matrix is considered as a byproduct or is computed by a simple average in Euclidean space, thereby destroying the intrinsic clustering structure. To that end, here we proposed a novel multi-view clustering method to directly learn a well-structured affinity matrix driven by the clustering task on Grassmann manifold. Specifically, we firstly employed a tensor learning model to unify multiple feature spaces into a latent low-rank tensor space. Then each individual view was merged on Grassmann manifold to obtain both an integrative subspace and a consensus affinity matrix, driven by clustering task. The two parts are modeled by a unified objective function and optimized jointly to mine a decomposable affinity matrix. Extensive experiments on eight real-world datasets show that our method achieves superior performances over other popular methods.
多视图聚类旨在通过利用跨视图信息将对象划分为潜在类别。核心问题之一是充分利用不同视图来学习一个潜在子空间,并在该子空间内执行聚类任务。最近,研究表明通过张量表示多视图数据,然后学习潜在的自表达张量是有效的。然而,早期的工作主要集中在从多视图数据中学习基本的张量表示,并且得到的亲和矩阵被视为副产品,或者是通过欧几里得空间中的简单平均来计算,从而破坏了内在的聚类结构。为此,我们提出了一种新颖的多视图聚类方法,直接在格拉斯曼流形上学习由聚类任务驱动的结构良好的亲和矩阵。具体来说,我们首先使用张量学习模型将多个特征空间统一到一个潜在的低秩张量空间中。然后,在格拉斯曼流形上合并每个单独的视图,以获得一个综合子空间和一个由聚类任务驱动的共识亲和矩阵。这两部分由一个统一的目标函数建模并联合优化,以挖掘一个可分解的亲和矩阵。在八个真实世界数据集上进行的大量实验表明,我们的方法比其他流行方法具有更优的性能。