Partition-level fusion induced multi-view Subspace Clustering with Tensorial Geman Rank.

IF 6 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Neural Networks Pub Date : 2024-11-15 DOI:10.1016/j.neunet.2024.106849
Jintian Ji, Songhe Feng
{"title":"Partition-level fusion induced multi-view Subspace Clustering with Tensorial Geman Rank.","authors":"Jintian Ji, Songhe Feng","doi":"10.1016/j.neunet.2024.106849","DOIUrl":null,"url":null,"abstract":"<p><p>The tensor-based multi-view clustering approach captures the high-order correlation among different views by learning a low-rank representation tensor, which has achieved favorable performance in multi-view clustering. However, the tensor rank approximation functions used by the extant algorithms are not tight enough to the true rank of the tensor, leading to the undesired low-rank structure. Besides, the fusion strategy at the affinity matrix level is less robust to noise, resulting in sub-optimal clustering results. To tackle these issues, we propose a Partition-Level Fusion Induced Multi-view Subspace Clustering with Tensorial Geman Rank (PFMSC-TGR). Firstly, a tighter surrogate of tensor rank is designed, named Tensorial Geman Rank (TGR). Under the constraint of TGR, all non-zero singular values are penalized with suitable strength, leading to a strongly discriminative representation tensor. Secondly, we fuse the information of all views at the partition level to obtain a consistent indicator matrix, which enhances the stability of the model against noisy information. Furthermore, we combine these two items in a unified framework and employ an efficient algorithm to optimize the objective function. We further mathematically prove that the sequences constructed by our proposed algorithm converge to the stationary KKT point. Extensive experiments are conducted on nine data sets with different types and sizes, and the results of comparison with the eleven state-of-the-art algorithms prove the superiority of our algorithm. Our code is publicly available at: https://github.com/jijintian/PFMSC-TGR.</p>","PeriodicalId":49763,"journal":{"name":"Neural Networks","volume":"182 ","pages":"106849"},"PeriodicalIF":6.0000,"publicationDate":"2024-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neural Networks","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1016/j.neunet.2024.106849","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The tensor-based multi-view clustering approach captures the high-order correlation among different views by learning a low-rank representation tensor, which has achieved favorable performance in multi-view clustering. However, the tensor rank approximation functions used by the extant algorithms are not tight enough to the true rank of the tensor, leading to the undesired low-rank structure. Besides, the fusion strategy at the affinity matrix level is less robust to noise, resulting in sub-optimal clustering results. To tackle these issues, we propose a Partition-Level Fusion Induced Multi-view Subspace Clustering with Tensorial Geman Rank (PFMSC-TGR). Firstly, a tighter surrogate of tensor rank is designed, named Tensorial Geman Rank (TGR). Under the constraint of TGR, all non-zero singular values are penalized with suitable strength, leading to a strongly discriminative representation tensor. Secondly, we fuse the information of all views at the partition level to obtain a consistent indicator matrix, which enhances the stability of the model against noisy information. Furthermore, we combine these two items in a unified framework and employ an efficient algorithm to optimize the objective function. We further mathematically prove that the sequences constructed by our proposed algorithm converge to the stationary KKT point. Extensive experiments are conducted on nine data sets with different types and sizes, and the results of comparison with the eleven state-of-the-art algorithms prove the superiority of our algorithm. Our code is publicly available at: https://github.com/jijintian/PFMSC-TGR.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
分区级融合诱导的多视角子空间聚类与张量格曼等级。
基于张量的多视图聚类方法通过学习低秩表示张量来捕捉不同视图之间的高阶相关性,在多视图聚类中取得了良好的性能。然而,现有算法所使用的张量秩近似函数与张量的真实秩不够紧密,导致了不期望的低秩结构。此外,亲和矩阵级的融合策略对噪声的鲁棒性较差,导致聚类结果不理想。为了解决这些问题,我们提出了分区级融合诱导多视角子空间聚类与张量格曼等级(PFMSC-TGR)。首先,我们设计了一种更严格的张量秩代用指标,命名为张量格曼秩(Tensorial Geman Rank,TGR)。在 TGR 的约束下,所有非零奇异值都会受到适当强度的惩罚,从而得到一个具有很强区分度的表示张量。其次,我们在分区层面上融合所有视图的信息,得到一个一致的指标矩阵,从而增强模型在噪声信息面前的稳定性。此外,我们将这两项内容结合到一个统一的框架中,并采用一种高效的算法来优化目标函数。我们进一步用数学方法证明,我们提出的算法所构建的序列会收敛到静态 KKT 点。我们在九个不同类型和规模的数据集上进行了广泛的实验,与十一种最先进算法的比较结果证明了我们算法的优越性。我们的代码可在以下网址公开获取:https://github.com/jijintian/PFMSC-TGR。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Neural Networks
Neural Networks 工程技术-计算机:人工智能
CiteScore
13.90
自引率
7.70%
发文量
425
审稿时长
67 days
期刊介绍: Neural Networks is a platform that aims to foster an international community of scholars and practitioners interested in neural networks, deep learning, and other approaches to artificial intelligence and machine learning. Our journal invites submissions covering various aspects of neural networks research, from computational neuroscience and cognitive modeling to mathematical analyses and engineering applications. By providing a forum for interdisciplinary discussions between biology and technology, we aim to encourage the development of biologically-inspired artificial intelligence.
期刊最新文献
Multi-source Selective Graph Domain Adaptation Network for cross-subject EEG emotion recognition. Spectral integrated neural networks (SINNs) for solving forward and inverse dynamic problems. Corrigendum to "Multi-view Graph Pooling with Coarsened Graph Disentanglement" [Neural Networks 174 (2024) 1-10/106221]. Multi-compartment neuron and population encoding powered spiking neural network for deep distributional reinforcement learning. Multiscroll hopfield neural network with extreme multistability and its application in video encryption for IIoT.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1