基于正交基的多视图迁移谱聚类  

Orthogonal Basis-Based Multiview Transfer Spectral Clustering

作　　者：王丽娟[1] 张霖 尹明[2] 郝志峰[3] 蔡瑞初[1] 温雯[1] WANG Lijuan;ZHANG Lin;YIN Ming;HAO Zhifeng;CAI Ruichu;WEN Wen(School of Computing,Guangdong University of Technology,Guangzhou 510006,China;School of Automation,Guangdong University of Technology,Guangzhou 510006,China;Shantou University,Shantou,Guangdong 515063,China)

机构地区：[1]广东工业大学计算机学院,广州510006 [2]广东工业大学自动化学院,广州510006 [3]汕头大学,广东汕头515063

出　　处：《计算机工程》2022年第10期37-44,54,共9页Computer Engineering

基　　金：国家自然科学基金(61876042,61876043,61976052);广东省基础与应用基础研究基金(2020A1515011493);广州市科技计划(201902010058)。

摘　　要：挖掘多视图一致性是提升多视图聚类性能的关键,为更好地从多视图数据中学习一致性表示,提出一种新的多视图聚类算法OMTSC。OMTSC算法同时学习每个视图的聚类分配矩阵和特征嵌入,并将聚类分配矩阵分解为共享正交基矩阵和聚类编码矩阵。正交基矩阵可捕获并储存多视图一致性信息形成潜在聚类中心,经过加权融合的多视图聚类编码矩阵可更好地平衡不同视图的质量差异。引入基于二部图的协同聚类,实现正交基、聚类编码和特征嵌入3个矩阵的知识相互迁移,以提升多视图数据一致性和多样性,并利用特征嵌入的多样性最大化多视图一致性学习最优的潜在聚类中心,从而提高多视图聚类的性能。此外,基于群稀疏约束的特征嵌入可有效消除多视图数据中的噪声,提升算法的鲁棒性。在WikipediaArticles、COIL20和ORL数据集上的实验结果表明,与SC-Best、Co-Reg等先进的多视图聚类算法相比,OMTSC算法在ACC、NMI、ARI 3个评价指标上整体取得最优值,其中在COIL20和ORL数据集中的NMI评价指标均高于0.9。The consistency of multiview data is important for multiview clustering.To achieve multiview data with better consistency,this paper proposes a new multiview clustering algorithm,OMTSC.The OMTSC algorithm simultaneously learns the cluster assignment matrix and feature embedding of each view.Each cluster assignment matrix can be decomposed into shared orthogonal basis-cluster coding matrices.An orthogonal basis matrix can capture and store consistent multiview data and form latent cluster centers.A weighted multiview cluster coding matrix can balance the quality differences of different views effectively.Meanwhile,bipartite graph co-clustering is introduced to realize knowledge transfer,which involves clustering coding,feature embedding,and the orthogonal basis.This improves the multiview data consistency and diversity learning,as well as allows the OMTSC algorithm to leverage the diversity of feature embedding for maximizing multiview consistency and learning the optimal latent cluster centers,thus further improving the performance of multiview clustering.In addition,feature embedding based on group sparse constraints is robust to noise in view data.Experimental results on WikipediaArticles,COIL20,and ORL datasets show that the OMTSC algorithm is superior to SC-Best,Co-Reg,and advanced multiview clustering algorithms,and that it yields the highest score in all three evaluation indexes,i.e.,the ACC,NMI,and ARI on COIL20 and ORL datasets,the NMI evaluation index for the OMTSC algorithm exceeds 0.9.

关 键 词：多视图 正交基聚类 迁移学习 谱聚类 协同正则化 

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