Fast Multi-View Clustering via Nonnegative and Orthogonal Factorization

被引:76
作者
Yang, Ben [1 ]
Zhang, Xuetao [1 ]
Nie, Feiping [2 ,3 ]
Wang, Fei [1 ]
Yu, Weizhong [1 ]
Wang, Rong [2 ,3 ]
机构
[1] Xi An Jiao Tong Univ, Natl Engn Lab Visual Informat Proc & Applicat, Xian 710049, Peoples R China
[2] Northwestern Polytech Univ, Sch Comp Sci, Xian 710072, Peoples R China
[3] Northwestern Polytech Univ, Ctr OPT IMagery Anal & Learning, Xian 710072, Peoples R China
基金
中国国家自然科学基金;
关键词
Multi-view clustering; anchors; bipartite graph; nonnegative and orthogonal factorization (NOF); SCALE; CLASSIFICATION; NORM;
D O I
10.1109/TIP.2020.3045631
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The rapid growth of the number of data brings great challenges to clustering, especially the introduction of multi-view data, which collected from multiple sources or represented by multiple features, makes these challenges more arduous. How to clustering large-scale data efficiently has become the hottest topic of current large-scale clustering tasks. Although several accelerated multi-view methods have been proposed to improve the efficiency of clustering large-scale data, they still cannot be applied to some scenarios that require high efficiency because of the high computational complexity. To cope with the issue of high computational complexity of existing multi-view methods when dealing with large-scale data, a fast multi-view clustering model via nonnegative and orthogonal factorization (FMCNOF) is proposed in this paper. Instead of constraining the factor matrices to be nonnegative as traditional nonnegative and orthogonal factorization (NOF), we constrain a factor matrix of this model to be cluster indicator matrix which can assign cluster labels to data directly without extra post-processing step to extract cluster structures from the factor matrix. Meanwhile, the F-norm instead of the L2-norm is utilized on the FMCNOF model, which makes the model very easy to optimize. Furthermore, an efficient optimization algorithm is proposed to solve the FMCNOF model. Different from the traditional NOF optimization algorithm requiring dense matrix multiplications, our algorithm can divide the optimization problem into three decoupled small size subproblems that can be solved by much less matrix multiplications. Combined with the FMCNOF model and the corresponding fast optimization method, the efficiency of the clustering process can be significantly improved, and the computational complexity is nearly O(n). Extensive experiments on various benchmark data sets validate our approach can greatly improve the efficiency when achieve acceptable performance.
引用
收藏
页码:2575 / 2586
页数:12
相关论文
共 50 条
  • [31] Efficient Orthogonal Multi-view Subspace Clustering
    Chen, Man-Sheng
    Wang, Chang-Dong
    Huang, Dong
    Lai, Jian-Huang
    Yu, Philip S.
    PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022, 2022, : 127 - 135
  • [32] Multi-view clustering via matrix factorization assisted k-means
    Zheng, Xiao
    Tang, Chang
    Liu, Xinwang
    Zhu, En
    NEUROCOMPUTING, 2023, 534 : 45 - 54
  • [33] Semi-Supervised Multi-view clustering based on orthonormality-constrained nonnegative matrix factorization
    Cai, Hao
    Liu, Bo
    Xiao, Yanshan
    Lin, Luyue
    INFORMATION SCIENCES, 2020, 536 : 171 - 184
  • [34] Multi-view clustering with filtered bipartite graph
    Ji, Jintian
    Peng, Hailei
    Feng, Songhe
    APPLIED INTELLIGENCE, 2025, 55 (07)
  • [35] Multi-view clustering by non-negative matrix factorization with co-orthogonal constraints
    Liang, Naiyao
    Yang, Zuyuan
    Li, Zhenni
    Sun, Weijun
    Xie, Shengli
    KNOWLEDGE-BASED SYSTEMS, 2020, 194
  • [36] Efficient Anchor Graph Factorization for Multi-View Clustering
    Li, Jing
    Wang, Qianqian
    Yang, Ming
    Gao, Quanxue
    Gao, Xinbo
    IEEE TRANSACTIONS ON MULTIMEDIA, 2024, 26 : 5834 - 5845
  • [37] Self-Weighted Multi-View Clustering with Deep Matrix Factorization
    Cui, Beilei
    Yu, Hong
    Zhang, Tiantian
    Li, Siwen
    ASIAN CONFERENCE ON MACHINE LEARNING, VOL 101, 2019, 101 : 567 - 582
  • [38] Multi-view clustering with orthogonal mapping and binary graph
    Zhao, Jianxi
    Kang, Fangyuan
    Zou, Qingrong
    Wang, Xiaonan
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 213
  • [39] Non-negative Orthogonal Matrix Factorization Based Multi-view Clustering Image Segmentation Algorithm
    Zhang R.
    Cao J.
    Hu J.
    Zhang R.
    Liu X.
    Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence, 2023, 36 (06): : 556 - 571
  • [40] Dual Consensus Anchor Learning for Fast Multi-View Clustering
    Qin, Yalan
    Qin, Chuan
    Zhang, Xinpeng
    Feng, Guorui
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2024, 33 : 5298 - 5311