• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

基于特征选择和半非负锚图分解的多视图聚类

Multi-view clustering based on feature selection and semi-non-negative anchor graph factorization.

作者信息

Mei Shikun, Wang Qianqian, Gao Quanxue, Yang Ming

机构信息

School of Telecommunications Engineering, Xidian University, Shaanxi 710071, China.

School of Telecommunications Engineering, Xidian University, Shaanxi 710071, China.

出版信息

Neural Netw. 2025 Apr;184:107111. doi: 10.1016/j.neunet.2024.107111. Epub 2025 Jan 3.

DOI:10.1016/j.neunet.2024.107111
PMID:39778292
Abstract

Multi-view clustering has garnered significant attention due to its capacity to utilize information from multiple perspectives. The concept of anchor graph-based techniques was introduced to manage large-scale data better. However, current methods rely on K-means or uniform sampling to select anchors in the original space. This results in a disjointed approach separating anchor selection and subsequent graph construction. Moreover, these methods typically require additional K-means or spectral clustering to derive labels, often leading to suboptimal outcomes. To address these challenges, we present a novel approach called Multi-view Clustering based on Feature Selection and Semi-Non-Negative Anchor Graph Factorization (MCFSAF). This method unifies feature selection, anchor and anchor graph learning, and semi-non-negative factorization of the anchor graph into a cohesive framework. Within this framework, the anchors and anchor graph are learned in the embedding space following feature selection, and the clustering indicator matrix is obtained via semi-non-negative factorization of the anchor graph in each view. By applying the minimization of the tensor Schatten p-norm, we can uncover complementary information across multiple views efficiently. This synergetic process of anchor selection, anchor graph learning, and indicator matrix updating can effectively enhance the clustering quality. Critically, the fused indicator matrix enables us to directly acquire clustering labels without requiring additional K-means, thereby significantly improving the stability of the clustering process. Our method is optimized via an alternating iterations algorithm. Comprehensive experimental evaluations underscore the superior performance of our approach.

摘要

多视图聚类因其能够从多个角度利用信息而备受关注。基于锚图的技术概念被引入以更好地管理大规模数据。然而,当前方法依赖K均值或均匀采样在原始空间中选择锚点。这导致了一种脱节的方法,将锚点选择与后续的图构建分开。此外,这些方法通常需要额外的K均值或谱聚类来导出标签,这往往导致次优结果。为了应对这些挑战,我们提出了一种名为基于特征选择和半非负锚图分解的多视图聚类(MCFSAF)的新方法。该方法将特征选择、锚点和锚图学习以及锚图的半非负分解统一到一个连贯的框架中。在这个框架内,在特征选择之后在嵌入空间中学习锚点和锚图,并通过在每个视图中对锚图进行半非负分解来获得聚类指示矩阵。通过应用张量Schatten p范数的最小化,我们可以有效地发现多个视图中的互补信息。这种锚点选择、锚图学习和指示矩阵更新的协同过程可以有效地提高聚类质量。至关重要的是,融合后的指示矩阵使我们能够直接获得聚类标签,而无需额外的K均值,从而显著提高聚类过程的稳定性。我们的方法通过交替迭代算法进行优化。全面的实验评估强调了我们方法的卓越性能。

相似文献

1
Multi-view clustering based on feature selection and semi-non-negative anchor graph factorization.基于特征选择和半非负锚图分解的多视图聚类
Neural Netw. 2025 Apr;184:107111. doi: 10.1016/j.neunet.2024.107111. Epub 2025 Jan 3.
2
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.
3
Fast multiple graphs learning for multi-view clustering.用于多视图聚类的快速多图学习
Neural Netw. 2022 Nov;155:348-359. doi: 10.1016/j.neunet.2022.08.027. Epub 2022 Sep 2.
4
Semi-Supervised Multi-View Clustering with Weighted Anchor Graph Embedding.基于加权锚图嵌入的半监督多视图聚类。
Comput Intell Neurosci. 2021 Jul 26;2021:4296247. doi: 10.1155/2021/4296247. eCollection 2021.
5
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.
6
Learning the consensus and complementary information for large-scale multi-view clustering.学习大规模多视图聚类的共识和互补信息。
Neural Netw. 2024 Apr;172:106103. doi: 10.1016/j.neunet.2024.106103. Epub 2024 Jan 5.
7
Tensorized Bipartite Graph Learning for Multi-View Clustering.用于多视图聚类的张量化二分图学习
IEEE Trans Pattern Anal Mach Intell. 2023 Apr;45(4):5187-5202. doi: 10.1109/TPAMI.2022.3187976. Epub 2023 Mar 7.
8
Dual Consensus Anchor Learning for Fast Multi-View Clustering.用于快速多视图聚类的双共识锚点学习
IEEE Trans Image Process. 2024;33:5298-5311. doi: 10.1109/TIP.2024.3459651. Epub 2024 Sep 27.
9
Towards a unified framework for graph-based multi-view clustering.面向基于图的多视图聚类的统一框架。
Neural Netw. 2024 May;173:106197. doi: 10.1016/j.neunet.2024.106197. Epub 2024 Feb 23.
10
Multi-view projected clustering with graph learning.基于图学习的多视图投影聚类。
Neural Netw. 2020 Jun;126:335-346. doi: 10.1016/j.neunet.2020.03.020. Epub 2020 Apr 1.