Robust Tensor Recovery for Incomplete Multi-View Clustering

被引:4
|
作者
Shen, Qiangqiang [1 ]
Xu, Tingting [2 ]
Liang, Yongsheng [1 ]
Chen, Yongyong [2 ,3 ]
He, Zhenyu [2 ]
机构
[1] Harbin Inst Technol Shenzhen, Sch Elect & Informat Engn, Shenzhen 518055, Peoples R China
[2] Harbin Inst Technol Shenzhen, Sch Comp Sci & Technol, Shenzhen 518055, Peoples R China
[3] Harbin Inst Technol Shenzhen, Guangdong Prov Key Lab Novel Secur Intelligence Te, Shenzhen 518055, Peoples R China
基金
中国国家自然科学基金;
关键词
Tensors; Clustering methods; Noise reduction; Transforms; Kernel; Robustness; Security; Denoising; incomplete multi-view clustering; low-rank tensor recovery; tensor completion; REPRESENTATION; GRAPH;
D O I
10.1109/TMM.2023.3321499
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Incomplete multi-view clustering is gaining increased attention owing to its great success in mining underlying information from the missing views. However, the existing approaches still encounter two issues: 1) They generally do not give sufficient consideration to the robustness of incomplete multi-view data with noise; 2) They only exploit the low-rank structures in the intra-view graphs, while the low-rank priors embedded in inter-view graphs are ignored. To this end, we propose a Robust Tensor Recovery for Incomplete Multi-view Clustering (RIMC) method, which transforms the view-missing problem into the tensor graph recovery problem by manipulating the comprehensive low-rank priors. Specifically, RIMC first employs a marginalized denoising operation to construct robust graphs and further builds a tensor graph by stacking these robust graphs. Then, we develop a novel tensor completion to recover the tensor graph by performing comprehensive low-rank priors: low-rank structures in the inter-view graphs (i.e., horizontal and lateral slices); low-rank structures in the intra-view graphs (i.e., frontal slices). Meanwhile, we integrate the tensor completion and spectral clustering to learn a unified indicator matrix. Extensive experiments show the promising performance of our method.
引用
收藏
页码:3856 / 3870
页数:15
相关论文
共 50 条
  • [21] Low-Rank Kernel Tensor Learning for Incomplete Multi-View Clustering
    Wu, Tingting
    Feng, Songhe
    Yuan, Jiazheng
    THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 14, 2024, : 15952 - 15960
  • [22] Incomplete Multi-View Clustering With Complete View Guidance
    Chen, Zhikui
    Li, Yue
    Lou, Kai
    Zhao, Liang
    IEEE SIGNAL PROCESSING LETTERS, 2023, 30 : 1247 - 1251
  • [23] Doubly Aligned Incomplete Multi-view Clustering
    Hu, Menglei
    Chen, Songcan
    PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 2262 - 2268
  • [24] Robust Mixed-order Graph Learning for incomplete multi-view clustering
    Guo, Wei
    Che, Hangjun
    Leung, Man-Fai
    Jin, Long
    Wen, Shiping
    INFORMATION FUSION, 2025, 115
  • [25] Incomplete multi-view clustering with cosine similarity
    Yin, Jun
    Sun, Shiliang
    PATTERN RECOGNITION, 2022, 123
  • [26] Incomplete Multi-View Clustering With Reconstructed Views
    Yin, Jun
    Sun, Shiliang
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (03) : 2671 - 2682
  • [27] Late Fusion Incomplete Multi-View Clustering
    Liu, Xinwang
    Zhu, Xinzhong
    Li, Miaomiao
    Wang, Lei
    Tang, Chang
    Yin, Jianping
    Shen, Dinggang
    Wang, Huaimin
    Gao, Wen
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2019, 41 (10) : 2410 - 2423
  • [28] Multi-View Spectral Clustering With Incomplete Graphs
    Zhuge, Wenzhang
    Luo, Tingjin
    Tao, Hong
    Hou, Chenping
    Yi, Dongyun
    IEEE ACCESS, 2020, 8 : 99820 - 99831
  • [29] Localized Sparse Incomplete Multi-View Clustering
    Liu, Chengliang
    Wu, Zhihao
    Wen, Jie
    Xu, Yong
    Huang, Chao
    IEEE TRANSACTIONS ON MULTIMEDIA, 2023, 25 : 5539 - 5551
  • [30] Online Binary Incomplete Multi-view Clustering
    Yang, Longqi
    Zhang, Liangliang
    Tang, Yuhua
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2020, PT I, 2021, 12457 : 75 - 90