Correntropy-Based Low-Rank Matrix Factorization With Constraint Graph Learning for Image Clustering

被引:4
作者
Zhou, Nan [1 ,2 ]
Choi, Kup-Sze [2 ]
Chen, Badong [4 ]
Du, Yuanhua [5 ]
Liu, Jun [3 ]
Xu, Yangyang [6 ]
机构
[1] Chengdu Univ, Chengdu 610106, Peoples R China
[2] Hong Kong Polytech Univ, Ctr Smart Hlth, Sch Nursing, Hong Kong, Peoples R China
[3] Chengdu Univ Informat Technol, Sch Automat, Chengdu 610255, Peoples R China
[4] Xi An Jiao Tong Univ, Inst Artificial Intelligence & Robot, Xian 710049, Peoples R China
[5] Chengdu Univ Informat Technol, Coll Appl Math, Chengdu 610225, Peoples R China
[6] Rensselaer Polytech Inst, Dept Math Sci, Troy, NY 12180 USA
关键词
Data models; Laplace equations; Convergence; Clustering algorithms; Adaptation models; Principal component analysis; Image reconstruction; Low-rank factorization; machine learning; maximum correntropy criterion (MCC); semisupervised learning (SSL); SPARSE; CLASSIFICATION; OPTIMIZATION; PROPAGATION; NETWORKS;
D O I
10.1109/TNNLS.2022.3166931
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This article proposes a novel low-rank matrix factorization model for semisupervised image clustering. In order to alleviate the negative effect of outliers, the maximum correntropy criterion (MCC) is incorporated as a metric to build the model. To utilize the label information to improve the clustering results, a constraint graph learning framework is proposed to adaptively learn the local structure of the data by considering the label information. Furthermore, an iterative algorithm based on Fenchel conjugate (FC) and block coordinate update (BCU) is proposed to solve the model. The convergence properties of the proposed algorithm are analyzed, which shows that the algorithm exhibits both objective sequential convergence and iterate sequential convergence. Experiments are conducted on six real-world image datasets, and the proposed algorithm is compared with eight state-of-the-art methods. The results show that the proposed method can achieve better performance in most situations in terms of clustering accuracy and mutual information.
引用
收藏
页码:10433 / 10446
页数:14
相关论文
共 53 条
[1]  
[Anonymous], 2016, ARXIV161000040
[2]  
[Anonymous], 2009, MATCHING THEORY
[3]  
[Anonymous], 2003, ANN INT ACM SIGIR C
[4]  
[Anonymous], 2015, P 9 INT C NONL AN CO
[5]   Locally Consistent Concept Factorization for Document Clustering [J].
Cai, Deng ;
He, Xiaofei ;
Han, Jiawei .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2011, 23 (06) :902-913
[6]   Graph Regularized Nonnegative Matrix Factorization for Data Representation [J].
Cai, Deng ;
He, Xiaofei ;
Han, Jiawei ;
Huang, Thomas S. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (08) :1548-1560
[7]  
Chapelle O, 2006, INTELL SYST REFERENC, V49, P215
[8]   Generalized Correntropy for Robust Adaptive Filtering [J].
Chen, Badong ;
Xing, Lei ;
Zhao, Haiquan ;
Zheng, Nanning ;
Principe, Jose C. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2016, 64 (13) :3376-3387
[9]   Steady-State Mean-Square Error Analysis for Adaptive Filtering under the Maximum Correntropy Criterion [J].
Chen, Badong ;
Xing, Lei ;
Liang, Junli ;
Zheng, Nanning ;
Principe, Jose C. .
IEEE SIGNAL PROCESSING LETTERS, 2014, 21 (07) :880-884
[10]   Sparse representation and learning in visual recognition: Theory and applications [J].
Cheng, Hong ;
Liu, Zicheng ;
Yang, Lu ;
Chen, Xuewen .
SIGNAL PROCESSING, 2013, 93 (06) :1408-1425