• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

基于核熵的带约束图学习的低秩矩阵分解用于图像聚类

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

作者信息

Zhou Nan, Choi Kup-Sze, Chen Badong, Du Yuanhua, Liu Jun, Xu Yangyang

出版信息

IEEE Trans Neural Netw Learn Syst. 2023 Dec;34(12):10433-10446. doi: 10.1109/TNNLS.2022.3166931. Epub 2023 Nov 30.

DOI:10.1109/TNNLS.2022.3166931
PMID:35507622
Abstract

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.

摘要

本文提出了一种用于半监督图像聚类的新型低秩矩阵分解模型。为了减轻离群值的负面影响,引入最大相关熵准则(MCC)作为一种度量来构建模型。为了利用标签信息来改善聚类结果,提出了一种约束图学习框架,通过考虑标签信息来自适应地学习数据的局部结构。此外,还提出了一种基于Fenchel共轭(FC)和块坐标更新(BCU)的迭代算法来求解该模型。分析了所提算法的收敛性质,结果表明该算法具有目标序列收敛性和迭代序列收敛性。在六个真实世界图像数据集上进行了实验,并将所提算法与八种最新方法进行了比较。结果表明,所提方法在大多数情况下,在聚类精度和互信息方面都能取得更好的性能。

相似文献

1
Correntropy-Based Low-Rank Matrix Factorization With Constraint Graph Learning for Image Clustering.基于核熵的带约束图学习的低秩矩阵分解用于图像聚类
IEEE Trans Neural Netw Learn Syst. 2023 Dec;34(12):10433-10446. doi: 10.1109/TNNLS.2022.3166931. Epub 2023 Nov 30.
2
Maximum Correntropy Criterion-Based Robust Semisupervised Concept Factorization for Image Representation.基于最大互信息准则的鲁棒半监督概念分解用于图像表示
IEEE Trans Neural Netw Learn Syst. 2020 Oct;31(10):3877-3891. doi: 10.1109/TNNLS.2019.2947156. Epub 2019 Nov 8.
3
ECCA: Efficient Correntropy-Based Clustering Algorithm With Orthogonal Concept Factorization.ECCA:基于正交概念分解的高效核熵聚类算法
IEEE Trans Neural Netw Learn Syst. 2023 Oct;34(10):7377-7390. doi: 10.1109/TNNLS.2022.3142806. Epub 2023 Oct 5.
4
Efficient correntropy-based multi-view clustering with anchor graph embedding.基于有效相关熵的多视图聚类与锚图嵌入。
Neural Netw. 2022 Feb;146:290-302. doi: 10.1016/j.neunet.2021.11.027. Epub 2021 Dec 2.
5
Pairwise Constraint Propagation-Induced Symmetric Nonnegative Matrix Factorization.成对约束传播诱导的对称非负矩阵分解
IEEE Trans Neural Netw Learn Syst. 2018 Dec;29(12):6348-6361. doi: 10.1109/TNNLS.2018.2830761. Epub 2018 May 18.
6
Robust Structured Graph Clustering.稳健的结构化图聚类
IEEE Trans Neural Netw Learn Syst. 2020 Nov;31(11):4424-4436. doi: 10.1109/TNNLS.2019.2955209. Epub 2020 Oct 30.
7
Fast multi-view clustering via correntropy-based orthogonal concept factorization.基于相关熵的正交概念分解的快速多视图聚类。
Neural Netw. 2024 May;173:106170. doi: 10.1016/j.neunet.2024.106170. Epub 2024 Feb 9.
8
Nonnegative Matrix Factorization with Rank Regularization and Hard Constraint.具有秩正则化和硬约束的非负矩阵分解
Neural Comput. 2017 Sep;29(9):2553-2579. doi: 10.1162/neco_a_00995. Epub 2017 Aug 4.
9
Semisupervised Adaptive Symmetric Non-Negative Matrix Factorization.半监督自适应对称非负矩阵分解
IEEE Trans Cybern. 2021 May;51(5):2550-2562. doi: 10.1109/TCYB.2020.2969684. Epub 2021 Apr 15.
10
Unsupervised and Semisupervised Projection With Graph Optimization.基于图优化的无监督和半监督投影
IEEE Trans Neural Netw Learn Syst. 2021 Apr;32(4):1547-1559. doi: 10.1109/TNNLS.2020.2984958. Epub 2021 Apr 2.