基于增强低秩的多视图子空间聚类算法

张天啸; 张永; 刘文哲

doi:10.11959/j.issn.1000-0801.2026007

您当前的位置：

首页 >

文章列表页 >

基于增强低秩的多视图子空间聚类算法

研究与开发 | 更新时间：2026-04-08

- 基于增强低秩的多视图子空间聚类算法
- Multi-view subspace clustering algorithm based on low-rank enhancement
- 电信科学 2026年42卷第3期页码：81-96
- 作者机构：
  
  1.湖州师范学院信息工程学院，浙江湖州 313000
  2.辽宁师范大学计算机与人工智能学院，辽宁大连 116033
- 作者简介：
  
  [ "张天啸（1999- ），男，湖州师范学院信息工程学院硕士生，主要研究方向为多视图学习。" ]
  [ "张永（1975- ），男，博士，湖州师范学院信息工程学院教授，主要研究方向为深度学习、机器学习。" ]
  [ "刘文哲（1989- ），女，博士，湖州师范学院信息工程学院讲师，主要研究方向为多视图、多模态学习。" ]
- 基金信息：
  
  国家自然科学基金资助项目;The National Natural Science Foundation of China(61772252);辽宁省教育厅科学研究经费资助项目;The Scientific Research Foundation of the Education Department of Liaoning Province(LJKZ0965);浙江省教育厅一般科研项目(Y202456367;Y202456437);湖州市自然科学基金资助项目(2022GZ08;2023ZD2004;2024YZ39)
- DOI：10.11959/j.issn.1000-0801.2026007
  中图分类号： TP301.6
- 收稿：2025-05-09，
  
  修回：2025-06-10，
  
  录用：2025-06-24，
  
  纸质出版：2026-03-20
- 稿件说明：
移动端阅览
张天啸,张永,刘文哲.基于增强低秩的多视图子空间聚类算法[J].电信科学,2026,42(03):81-96.

Zhang Tianxiao,Zhang Yong,Liu Wenzhe.Multi-view subspace clustering algorithm based on low-rank enhancement[J].Telecommunications Science,2026,42(03):81-96.
张天啸,张永,刘文哲.基于增强低秩的多视图子空间聚类算法[J].电信科学,2026,42(03):81-96. DOI： 10.11959/j.issn.1000-0801.2026007.

Zhang Tianxiao,Zhang Yong,Liu Wenzhe.Multi-view subspace clustering algorithm based on low-rank enhancement[J].Telecommunications Science,2026,42(03):81-96. DOI： 10.11959/j.issn.1000-0801.2026007.

摘要

多视图子空间聚类（multi-view subspace clustering

MVSC）因其能够有效融合多源异构数据而被广泛应用，但其仍面临两大挑战：噪声对亲和矩阵鲁棒性的影响以及捕获视图间一致性信息能力不足。为此，提出了一种融合双重去噪与成对相似性思想的MVSC算法。首先，该算法在数据处理初期采用双重去噪策略，通过低通滤波器实现平滑去噪，继而构建多步矩阵分解框架以实现低秩化去噪；其次，引入成对相似性思想，通过构建视图间一致性约束来有效挖掘视图间的一致性信息；最后，采用基于增广拉格朗日乘子法（augmented lagrange method，ALM）求解目标函数。该算法在7个不同领域数据集上均表现出显著优势，与其他算法相比，该算法在准确度、归一化互信息和F-score指标上分别平均提升了17.79%、20.72%和16.37%。其中CESC数据集的准确度达到了0.862 9，较高效、有效的一步式多视图聚类（efficient and effective one-step multiview clustering，EEOMVC）方法提升了16.13%，充分体现了该算法在多视图数据融合方面的优越性能。

Abstract

Multi-view subspace clustering (MVSC) is widely recognized for its effectiveness in integrating multi-source heterogeneous data

yet two critical challenges are identified: insufficient robustness of affinity matrices against noise and limited capability in capturing cross-view consistent information. To address these issues

a multi-view subspace clustering algorithm was proposed by integrating dual denoising mechanisms with pairwise similarity principles. Firstly

a dual denoising strategy was designed during the initial data processing stage

where smooth denoising was achieved through low-pass filters

followed by low-rank denoising via a multi-step matrix decomposition framework. Subsequently

pairwise similarity principles were introduced

and inter-view consistency constraints were systematically constructed to effectively explore shared information across views. Finally

an optimization framework was developed using the augmented Lagrangian method (ALM) . The proposed algorithm demonstrates significant advantages across seven datasets from different domains. Compared with other algorithms

it achieves average improvements of 17.79% in accuracy

20.72% in normalized mutual information

and 16.37% in F-score metrics. Particularly on the CESC dataset

the algorithm attains an ACC score of 0.862 9

representing a 16.13% improvement over the efficient and effective one-step multiview clustering (EEOMVC)

which fully demonstrates its superior performance in multi-view data fusion.

关键词

Keywords

references

Zhao J , Xie X J , Xu X , et al . Multi-view learning overview: Recent progress and new challenges [J ] . Information Fusion , 2017 , 38 : 43 - 54 .

Bickel S , Scheffer T . Multi-view clustering [C ] // Proceedings of the Fourth IEEE International Conference on Data Mining (ICDM'04) . Piscataway : IEEE Press , 2004 : 19 - 26 .

Yang Y , Wang H . Multi-view clustering: a survey [J ] . Big Data Mining and Analytics , 2018 , 1 ( 2 ): 83 - 107 .

Wang Y D , Pei X B , Zhan H X . Fine-grained graph learning for multi-view subspace clustering [J ] . IEEE Transactions on Emerging Topics in Computational Intelligence , 2024 , 8 ( 4 ): 2804 - 2815 .

Hu B , Wu T , Han L X , et al . Multi-view clustering via view-specific consensus kernelized graph learning [J ] . Neurocomputing , 2025 , 633 : 129766 .

Tang C , Zhu X Z , Liu X W , et al . Learning a joint affinity graph for multiview subspace clustering [J ] . IEEE Transactions on Multimedia , 2019 , 21 ( 7 ): 1724 - 1736 .

Chen Y Y , Wang S Q , Zhao Y P , et al . Double discrete cosine transform-oriented multi-view subspace clustering [J ] . IEEE Transactions on Image Processing , 2024 , 33 : 2491 - 2501 .

Wang H , Yang Y , Liu B . GMC: graph-based multi-view clustering [J ] . IEEE Transactions on Knowledge and Data Engineering , 2020 , 32 ( 6 ): 1116 - 1129 .

Tang C , Liu X W , Zhu X Z , et al . CGD: multi-view clustering via cross-view graph diffusion [J ] . Proceedings of the AAAI Conference on Artificial Intelligence , 2020 , 34 ( 4 ): 5924 - 5931 .

Tsai J T , Lin Y , Liao H M . Per-cluster ensemble kernel learning for multi-modal image clustering with group-dependent feature selection [J ] . IEEE Transactions on Multimedia , 2014 , 16 ( 8 ): 2229 - 2241 .

Chen Y Y , Xiao X L , Zhou Y C . Jointly learning kernel representation tensor and affinity matrix for multi-view clustering [J ] . IEEE Transactions on Multimedia , 2020 , 22 ( 8 ): 1985 - 1997 .

Elhamifar E , Vidal R . Sparse subspace clustering [C ] // Proceedings of the 2009 IEEE Conference on Computer Vision and Pattern Recognition . Piscataway : IEEE Press , 2009 : 2790 - 2797 .

Elhamifar E , Vidal R . Sparse subspace clustering: algorithm, theory, and applications [J ] . IEEE Transactions on Pattern Analysis and Machine Intelligence , 2013 , 35 ( 11 ): 2765 - 2781 .

Liu G C , Lin Z C , Yan S C , et al . Robust recovery of subspace structures by low-rank representation [J ] . IEEE Transactions on Pattern Analysis and Machine Intelligence , 2013 , 35 ( 1 ): 171 - 184 .

Liu G C , Lin Z C , Yu Y . Robust subspace segmentation by low-rank representation [C ] // Proceedings of the 27th International Conference On Machine Learning (ICML-10) . New York : ACM Press , 2010 : 663 - 670 .

Wang Y , Lin X M , Wu L , et al . Robust subspace clustering for multi-view data by exploiting correlation consensus [J ] . IEEE Transactions on Image Processing , 2015 , 24 ( 11 ): 3939 - 3949 .

Gao H C , Nie F P , Li X L , et al . Multi-view subspace clustering [C ] // Proceedings of the 2015 IEEE International Conference on Computer Vision (ICCV) . Piscataway : IEEE Press , 2015 : 4238 - 4246 .

Cao X C , Zhang C Q , Fu H Z , et al . Diversity-induced multi-view subspace clustering [C ] // Proceedings of the 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) . Piscataway : IEEE Press , 2015 : 586 - 594 .

Yin Q Y , Wu S , He R , et al . Multi-view clustering via pairwise sparse subspace representation [J ] . Neurocomputing , 2015 , 156 : 12 - 21 .

Kang Z , Zhou W T , Zhao Z T , et al . Large-scale multi-view subspace clustering in linear time [J ] . Proceedings of the AAAI Conference on Artificial Intelligence , 2020 , 34 ( 4 ): 4412 - 4419 .

Sun M J , Zhang P , Wang S W , et al . Scalable multi-view subspace clustering with unified anchors [C ] // Proceedings of the 29th ACM International Conference on Multimedia . New York : ACM Press , 2021 : 3528 - 3536 .

Kan Y Z , Lu G F , Yao L , et al . Multi-view clustering using a flexible and optimal multi-graph fusion method [J ] . Engineering Applications of Artificial Intelligence , 2024 , 128 : 107452 .

Cai R G , Chen H M , Mi Y , et al . Multi-view clustering via double spaces structure learning and adaptive multiple projection regression learning [J ] . Information Sciences , 2025 , 688 : 121396 .

Candès E J , Li X D , Ma Y , et al . Robust principal component analysis? [J ] . Journal of the ACM , 2011 , 58 ( 3 ): 1 - 37 .

Yang J F , Yin W T , Zhang Y , et al . A fast algorithm for edge-preserving variational multichannel image restoration [J ] . SIAM Journal on Imaging Sciences , 2009 , 2 ( 2 ): 569 - 592 .

Jameson A . Solution of the equation AX + XB = C by inversion of an M × M or N × N matrix [J ] . SIAM Journal on Applied Mathematics , 1968 , 16 ( 5 ): 1020 - 1023 .

Zhang Z . A flexible new technique for camera calibration [J ] . IEEE Transactions on Pattern Analysis and Machine Intelligence , 2000 , 22 ( 11 ): 1330 - 1334 .

Cai J F , Candès E J , Shen Z W . A singular value thresholding algorithm for matrix completion [J ] . SIAM Journal on Optimization , 2010 , 20 ( 4 ): 1956 - 1982 .

Zhan K , Nie F P , Wang J , et al . Multiview consensus graph clustering [J ] . IEEE Transactions on Image Processing , 2019 , 28 ( 3 ): 1261 - 1270 .

Yin H W , Wang G X , Hu W J , et al . Fine-grained multi-view clustering with robust multi-prototypes representation [J ] . Applied Intelligence , 2023 , 53 ( 7 ): 8402 - 8420 .

Zou X , Tang C , Zheng X , et al . Inclusivity induced adaptive graph learning for multi-view clustering [J ] . Knowledge-Based Systems , 2023 , 267 : 110424 .

Wang J , Tang C , Wan Z G , et al . Efficient and effective one-step multiview clustering [J ] . IEEE Transactions on Neural Networks and Learning Systems , 2024 , 35 ( 9 ): 12224 - 12235 .

Wang D , Han S W , Wang Q , et al . Pseudo-label guided collective matrix factorization for multiview clustering [J ] . IEEE Transactions on Cybernetics , 2022 , 52 ( 9 ): 8681 - 8691 .

Cai B , Lu G F , Ji G Y , et al . Complete multi-view subspace clustering via auto-weighted combination of visible and latent views [J ] . Information Sciences , 2024 , 665 : 120381 .

You X J , Li H R , You J L , et al . Consider high-order consistency for multi-view clustering [J ] . Neural Computing and Applications , 2024 , 36 ( 2 ): 717 - 729 .

Du Y F , Lu G F . Joint local smoothness and low-rank tensor representation for robust multi-view clustering [J ] . Pattern Recognition , 2025 , 157 : 110944 .

浏览量

102

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

暂无数据