双加权多视角子空间聚类算法  

Dual Weighted Multi-view Subspace Clustering

作　　者：曹容玮 祝继华[1] 郝问裕 张长青 张茁涵 李钟毓[1] CAO Rong-Wei;ZHU Ji-Hua;HAO Wen-Yu;ZHANG Chang-Qing;ZHANG Zhuo-Han;LI Zhong-Yu(School of Software Engineering,Xi’an Jiaotong University,Xi’an 710049,China;College of Intelligence and Computing,Tianjin University,Tianjin 300350,China)

机构地区：[1]西安交通大学软件学院,陕西西安710049 [2]天津大学智能与计算学部,天津300350

出　　处：《软件学报》2022年第2期585-597,共13页Journal of Software

基　　金：国家自然科学基金(61573273)。

摘　　要：多视角子空间聚类方法为高维多视角数据的聚类问题提供了大量的解决方案.但是现有的子空间方法仍不能很好地解决以下两个问题:(1)如何利用不同视角的差异性进行学习获得一个优质的共享系数矩阵;(2)如何增强共享系数矩阵的低秩性.针对以上问题,提出了一种有效的双加权多视角子空间聚类算法.该算法首先通过子空间自表达学习到每个视角的系数矩阵,然后采用自适应权重策略构建一个共享系数矩阵,最后利用加权核范数逼近系数矩阵的秩,使得系数矩阵的表示更加低秩,进而取得更好的聚类结果.采用增广拉格朗日乘子法来优化目标函数,并在6个广泛使用的数据集上进行实验,验证了该算法的优越性.In order to solve the problem of clustering multi-view data,many multi-view subspace clustering methods have been proposed and achieved great success.However,they cannot well fix the following two problems.1)How to leverage the difference between different views to learn a shared coefficient matrix with high quality.2)How to further enforce the low rank property of the common coefficient matrix.To handle the above problems,an effective method dubbed dual weighted multi-view subspace clustering is proposed.In detail,the coefficient matricesare first learned for each view by self-representation model,and then they are fusedinto a common representation with a self-weighted strategy,finally weighted nuclear norm instead of nuclear norm is employed to approximate the rank of the common coefficient matrix,so that the performance of clustering can be improved.An augmented Lagrange multiplier based optimal algorithm is imposed to solve the established objective function.Experiments conducted on six real world datasets validate the superiority of the proposed method.

关 键 词：多视角子空间聚类 系数矩阵 权重 加权核范数 低秩 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]