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 条
[31]   Correntropy based graph regularized concept factorization for clustering [J].
Peng, Siyuan ;
Ser, Wee ;
Chen, Badong ;
Sun, Lei ;
Lin, Zhiping .
NEUROCOMPUTING, 2018, 316 :34-48
[32]   Coordinate friendly structures, algorithms and applications [J].
Peng, Zhimin ;
Wu, Tianyu ;
Xu, Yangyang ;
Yan, Ming ;
Yin, Wotao .
ANNALS OF MATHEMATICAL SCIENCES AND APPLICATIONS, 2016, 1 (01) :57-119
[33]  
Principe JC, 2010, INFORM SCI STAT, P1, DOI 10.1007/978-1-4419-1570-2
[34]  
Sain S. R, 1995, NATURE STAT LEARNING
[35]  
Shi H.-J., 2016, ARXIV161000040
[36]   Semi-Supervised Clustering with Neural Networks [J].
Shukla, Ankita ;
Cheema, Gullal S. ;
Anand, Saket .
2020 IEEE SIXTH INTERNATIONAL CONFERENCE ON MULTIMEDIA BIG DATA (BIGMM 2020), 2020, :152-161
[37]   Semi-Supervised Nonnegative Matrix Factorization via Constraint Propagation [J].
Wang, Di ;
Gao, Xinbo ;
Wang, Xiumei .
IEEE TRANSACTIONS ON CYBERNETICS, 2016, 46 (01) :233-244
[38]   Non-negative matrix factorization by maximizing correntropy for cancer clustering [J].
Wang, Jim Jing-Yan ;
Wang, Xiaolei ;
Gao, Xin .
BMC BIOINFORMATICS, 2013, 14
[39]   Scalable Semi-Supervised Learning by Efficient Anchor Graph Regularization [J].
Wang, Meng ;
Fu, Weijie ;
Hao, Shijie ;
Tao, Dacheng ;
Wu, Xindong .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2016, 28 (07) :1864-1877
[40]   Graph Embedding Multi-Kernel Metric Learning for Image Set Classification With Grassmannian Manifold-Valued Features [J].
Wang, Rui ;
Wu, Xiao-Jun ;
Kittler, Josef .
IEEE TRANSACTIONS ON MULTIMEDIA, 2021, 23 :228-242