Auto-weighted collective matrix factorization with graph dual regularization for multi-view clustering

被引:24
|
作者
Liu, Mingyang [1 ]
Yang, Zuyuan [1 ]
Li, Lingjiang [1 ,2 ]
Li, Zhenni [1 ,3 ]
Xie, Shengli [1 ,4 ]
机构
[1] Guangdong Univ Technol, Sch Automation, Guangdong Key Lab IoT Informat Technol, Guangzhou 510006, Peoples R China
[2] Ante Laser Co Ltd, Guangzhou 510663, Peoples R China
[3] Minist Educ, Key Lab iDetect & Mfg IoT, Guangzhou 510006, Peoples R China
[4] Guangdong Hong Kong Macao Joint Lab Smart Discrete, Hong Kong 510006, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Multi -view clustering; Nonnegative matrix factorization; Adaptive weight; Graph dual regularization;
D O I
10.1016/j.knosys.2022.110145
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi-view clustering (MVC) is an attractive clustering paradigm that can incorporate comprehensive information from multiple views. Among the MVC schemes, collective matrix factorization (CMF) has shown its great power in extracting shared information of multi-view data. Based on CMF, we propose a novel unified MVC framework, named Auto-weighted Collective Matrix Factorization with Graph Dual Regularization (ACMF-GDR). Specifically, we assign adaptive weights for each view and incorporate the smoothing cluster structure learning term to construct a unified auto-weighted CMF for MVC. Our ACMF-GDR model can obtain the cluster labels and common representations of the samples in a one-step manner. Furthermore, to make the common representations discriminative, graph dual regularization terms with orthogonality constraints are adopted on multiple views to preserve the geometrical structure of the decomposed factors simultaneously. Experimental results show the superior clustering performance of the proposed method. (c) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] Auto-Weighted Graph Regularization and Residual Compensation for Multi-view Subspace Clustering
    Wang, Qiaoping
    Chen, Xiaoyun
    Chen, Wenjian
    NEURAL PROCESSING LETTERS, 2022, 54 (05) : 3851 - 3871
  • [2] Auto-Weighted Graph Regularization and Residual Compensation for Multi-view Subspace Clustering
    Qiaoping Wang
    Xiaoyun Chen
    Wenjian Chen
    Neural Processing Letters, 2022, 54 : 3851 - 3871
  • [3] Dual auto-weighted multi-view clustering via autoencoder-like nonnegative matrix factorization
    Xiang, Si-Jia
    Li, Heng-Chao
    Yang, Jing-Hua
    Feng, Xin-Ru
    INFORMATION SCIENCES, 2024, 667
  • [4] Auto-weighted orthogonal and nonnegative graph reconstruction for multi-view clustering
    Zhao, Mingyu
    Yang, Weidong
    Nie, Feiping
    INFORMATION SCIENCES, 2023, 632 : 324 - 339
  • [5] Auto-weighted multi-view clustering via kernelized graph learning
    Huang, Shudong
    Kang, Zhao
    Tsang, Ivor W.
    Xu, Zenglin
    PATTERN RECOGNITION, 2019, 88 : 174 - 184
  • [6] Auto-weighted multi-view clustering via hierarchical bipartite graph
    Zhou, Jie
    Luo, Xinglong
    Nie, Feiping
    He, Xingshi
    NEUROCOMPUTING, 2024, 605
  • [7] Auto-weighted multi-view clustering with the use of an augmented view
    Cai, Bing
    Lu, Gui-Fu
    Wan, Jiashan
    Du, Yangfan
    SIGNAL PROCESSING, 2024, 215
  • [8] Auto-weighted multi-view clustering via spectral embedding
    Shi, Shaojun
    Nie, Feiping
    Wang, Rong
    Li, Xuelong
    NEUROCOMPUTING, 2020, 399 : 369 - 379
  • [9] Scalable Auto-weighted Discrete Multi-view Clustering
    Yang, Longqi
    Zhang, Liangliang
    Tang, Yuhua
    PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE 2021 (WWW 2021), 2021, : 3269 - 3278
  • [10] Self-paced and auto-weighted multi-view clustering
    Ren, Yazhou
    Huang, Shudong
    Zhao, Peng
    Han, Minghao
    Xu, Zenglin
    NEUROCOMPUTING, 2020, 383 : 248 - 256