论文标题

寻求统一和不一致:一种共同平滑的多视图子空间聚类的方法

Seeking Commonness and Inconsistencies: A Jointly Smoothed Approach to Multi-view Subspace Clustering

论文作者

Cai, Xiaosha, Huang, Dong, Zhang, Guang-Yu, Wang, Chang-Dong

论文摘要

多视图子空间聚类旨在从多种视图中发现隐藏的子空间结构以进行稳健的聚类,并在近年来引起了很大的关注。尽管取得了重大进展,但以前的大多数多视图子空间聚类算法仍然面临两个局限性。首先,他们通常专注于多种视图的一致性(或统一),但通常缺乏捕获子空间表示中跨视图不一致的能力。其次,其中许多忽略了多种视图的本地结构,并且不能共同利用多个局部结构来增强子空间表示学习。为了解决这两个局限性,在本文中,我们提出了一种共同平滑的多视图子空间聚类(JSMC)方法。具体而言,我们同时将跨视图的共同点和不一致纳入子空间表示学习中。提出了视图传感分组效应,以共同利用多种视图的局部结构,以使视图 - 共鸣表示代表规范,这进一步与通过核标准的低级别约束相关联,以增强其群集结构。因此,跨视图的共同点和不一致,视图共表组效应和低级别表示被无缝地纳入统一的目标函数中,在此函数上,进行了交替的优化算法,以实现可靠的子空间表示聚类。各种现实世界多视图数据集的实验结果证实了我们方法的优势。可用代码:https://github.com/huangdonghere/jsmc。

Multi-view subspace clustering aims to discover the hidden subspace structures from multiple views for robust clustering, and has been attracting considerable attention in recent years. Despite significant progress, most of the previous multi-view subspace clustering algorithms are still faced with two limitations. First, they usually focus on the consistency (or commonness) of multiple views, yet often lack the ability to capture the cross-view inconsistencies in subspace representations. Second, many of them overlook the local structures of multiple views and cannot jointly leverage multiple local structures to enhance the subspace representation learning. To address these two limitations, in this paper, we propose a jointly smoothed multi-view subspace clustering (JSMC) approach. Specifically, we simultaneously incorporate the cross-view commonness and inconsistencies into the subspace representation learning. The view-consensus grouping effect is presented to jointly exploit the local structures of multiple views to regularize the view-commonness representation, which is further associated with the low-rank constraint via the nuclear norm to strengthen its cluster structure. Thus the cross-view commonness and inconsistencies, the view-consensus grouping effect, and the low-rank representation are seamlessly incorporated into a unified objective function, upon which an alternating optimization algorithm is performed to achieve a robust subspace representation for clustering. Experimental results on a variety of real-world multi-view datasets confirm the superiority of our approach. Code available: https://github.com/huangdonghere/JSMC.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源