多视图聚类的融合自适应张量对数行列式和局部平滑正则化

IF 6.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Fei Wang, Gui-Fu Lu
{"title":"多视图聚类的融合自适应张量对数行列式和局部平滑正则化","authors":"Fei Wang,&nbsp;Gui-Fu Lu","doi":"10.1016/j.neucom.2025.131564","DOIUrl":null,"url":null,"abstract":"<div><div>The prevailing techniques for multi-view subspace clustering (MVC) methods often depend on the assumption of low-rankness, which asserts that data can be effectively represented in a low-dimensional subspace. While these approaches capture the structure of the data globally and remove noise and redundancy, they all neglect local smoothness prior, which has been extensively used to reduce noise in the image field. Besides, existing techniques often depend on the tensor nuclear norm (TNN)to approximate the intrinsically non-convex tensor rank function. However, the TNN approach equates all singular values, which gives rise to excessive penalization of the principal rank components and ultimately leads to sub-optimal tensor representations. In response to these challenges, we introduce an innovative method called fused adaptive tensor Log-determinant and local smoothness regularizer (FATLLSR) for multi-view clustering. Specifically, we initially derive the self-expressive matrix for each view and subsequently integrate these matrices into a tensor. Then in order to simultaneously explore low-rankness and local smoothness prior, FATLLSR is designed and is used to constrain the obtained tensor. By using FATLLSR, we can not only relax tensor multi-rank constraint better than TNN but also utilize the local smoothness information hidden in multi-view data, making our method more robust to noise and redundancy. These techniques are integrated to constitute a unified model that is effectively handled using the augmented Lagrange multiplier (ALM). As demonstrated by its performance on different datasets, FATLLSR achieves outstanding clustering performance compared to the most advanced methods. The code is publicly available at <span><span>https://github.com/wangfii/FATLLSR</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"658 ","pages":"Article 131564"},"PeriodicalIF":6.5000,"publicationDate":"2025-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fused adaptive tensor log-determinant and local smoothness regularizer for multi-view clustering\",\"authors\":\"Fei Wang,&nbsp;Gui-Fu Lu\",\"doi\":\"10.1016/j.neucom.2025.131564\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The prevailing techniques for multi-view subspace clustering (MVC) methods often depend on the assumption of low-rankness, which asserts that data can be effectively represented in a low-dimensional subspace. While these approaches capture the structure of the data globally and remove noise and redundancy, they all neglect local smoothness prior, which has been extensively used to reduce noise in the image field. Besides, existing techniques often depend on the tensor nuclear norm (TNN)to approximate the intrinsically non-convex tensor rank function. However, the TNN approach equates all singular values, which gives rise to excessive penalization of the principal rank components and ultimately leads to sub-optimal tensor representations. In response to these challenges, we introduce an innovative method called fused adaptive tensor Log-determinant and local smoothness regularizer (FATLLSR) for multi-view clustering. Specifically, we initially derive the self-expressive matrix for each view and subsequently integrate these matrices into a tensor. Then in order to simultaneously explore low-rankness and local smoothness prior, FATLLSR is designed and is used to constrain the obtained tensor. By using FATLLSR, we can not only relax tensor multi-rank constraint better than TNN but also utilize the local smoothness information hidden in multi-view data, making our method more robust to noise and redundancy. These techniques are integrated to constitute a unified model that is effectively handled using the augmented Lagrange multiplier (ALM). As demonstrated by its performance on different datasets, FATLLSR achieves outstanding clustering performance compared to the most advanced methods. The code is publicly available at <span><span>https://github.com/wangfii/FATLLSR</span><svg><path></path></svg></span>.</div></div>\",\"PeriodicalId\":19268,\"journal\":{\"name\":\"Neurocomputing\",\"volume\":\"658 \",\"pages\":\"Article 131564\"},\"PeriodicalIF\":6.5000,\"publicationDate\":\"2025-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Neurocomputing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0925231225022362\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neurocomputing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925231225022362","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

多视图子空间聚类(MVC)方法的主流技术通常依赖于低秩假设,即数据可以在低维子空间中有效地表示。虽然这些方法可以全局捕获数据结构并去除噪声和冗余,但它们都忽略了局部平滑先验,而局部平滑先验已被广泛用于图像领域的降噪。此外,现有的技术往往依赖于张量核范数(TNN)来近似本质非凸张量秩函数。然而,TNN方法等于所有奇异值,这会导致对主秩分量的过度惩罚,最终导致次优张量表示。为了应对这些挑战,我们引入了一种称为融合自适应张量对数行定式和局部平滑正则化(FATLLSR)的多视图聚类方法。具体来说,我们首先推导出每个视图的自表达矩阵,然后将这些矩阵集成到一个张量中。然后,为了同时探索低秩和局部平滑先验,设计了FATLLSR,并使用它对得到的张量进行约束。FATLLSR不仅可以比TNN更好地放松张量多秩约束,而且可以利用隐藏在多视图数据中的局部平滑信息,使我们的方法对噪声和冗余具有更强的鲁棒性。这些技术被整合成一个统一的模型,使用增广拉格朗日乘子(ALM)有效地处理。FATLLSR在不同数据集上的性能证明,与最先进的方法相比,它实现了出色的聚类性能。该代码可在https://github.com/wangfii/FATLLSR上公开获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fused adaptive tensor log-determinant and local smoothness regularizer for multi-view clustering
The prevailing techniques for multi-view subspace clustering (MVC) methods often depend on the assumption of low-rankness, which asserts that data can be effectively represented in a low-dimensional subspace. While these approaches capture the structure of the data globally and remove noise and redundancy, they all neglect local smoothness prior, which has been extensively used to reduce noise in the image field. Besides, existing techniques often depend on the tensor nuclear norm (TNN)to approximate the intrinsically non-convex tensor rank function. However, the TNN approach equates all singular values, which gives rise to excessive penalization of the principal rank components and ultimately leads to sub-optimal tensor representations. In response to these challenges, we introduce an innovative method called fused adaptive tensor Log-determinant and local smoothness regularizer (FATLLSR) for multi-view clustering. Specifically, we initially derive the self-expressive matrix for each view and subsequently integrate these matrices into a tensor. Then in order to simultaneously explore low-rankness and local smoothness prior, FATLLSR is designed and is used to constrain the obtained tensor. By using FATLLSR, we can not only relax tensor multi-rank constraint better than TNN but also utilize the local smoothness information hidden in multi-view data, making our method more robust to noise and redundancy. These techniques are integrated to constitute a unified model that is effectively handled using the augmented Lagrange multiplier (ALM). As demonstrated by its performance on different datasets, FATLLSR achieves outstanding clustering performance compared to the most advanced methods. The code is publicly available at https://github.com/wangfii/FATLLSR.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Neurocomputing
Neurocomputing 工程技术-计算机:人工智能
CiteScore
13.10
自引率
10.00%
发文量
1382
审稿时长
70 days
期刊介绍: Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信