多属性低维子空间聚类的自加权指数张量核范数最小化

IF 6.5 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Tong Wu, Gui-Fu Lu, Bing Hu
{"title":"多属性低维子空间聚类的自加权指数张量核范数最小化","authors":"Tong Wu,&nbsp;Gui-Fu Lu,&nbsp;Bing Hu","doi":"10.1016/j.neucom.2025.130394","DOIUrl":null,"url":null,"abstract":"<div><div>Subspace clustering (SC) is a commonly used clustering method for handling high-dimensional data. However, most existing SC algorithms ignore the multi-attribute information in the original data. In addition, they do not fully utilize the inherent low-dimensional consensus information implied in the original data, resulting in the loss of important data features during the dimensionality reduction process. To solve these issues, we propose the auto-weighted exponential tensor nuclear norm minimization for multi-attribute low-dimensional subspace clustering (MALDSC). Specifically, firstly, we design a triple matrix factorization method to find the inherent low-dimensional consensus information and obtain the corresponding multi-attribute features. Secondly, we utilize the self-expressive property of the multi-attribute features to obtain self-expressive matrices. Thirdly, to harness the complete structural information embedded within the self-expressive matrix, we tack them into a tensor, which is regulated by the auto-weighted exponential tensor nuclear norm (AWETNN), serving as a more effective substitute for the tensor rank. The AWETNN takes full account of the physical differences among singular values through a non-convex penalty function, thus more accurately representing the high-order correlation between multiple attributes. Finally, the augmented Lagrange multiplier method (ALM) is utilized to unify the above three steps into one framework. The experimental results obtained from multiple datasets demonstrate that the MALDSC algorithm outperforms the state-of-the-art algorithms in terms of performance. The code is publicly available at <span><span>https://github.com/TongWuahpu/MALDSC</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"640 ","pages":"Article 130394"},"PeriodicalIF":6.5000,"publicationDate":"2025-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Auto-weighted exponential tensor nuclear norm minimization for multi-attribute low-dimensional subspace clustering\",\"authors\":\"Tong Wu,&nbsp;Gui-Fu Lu,&nbsp;Bing Hu\",\"doi\":\"10.1016/j.neucom.2025.130394\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Subspace clustering (SC) is a commonly used clustering method for handling high-dimensional data. However, most existing SC algorithms ignore the multi-attribute information in the original data. In addition, they do not fully utilize the inherent low-dimensional consensus information implied in the original data, resulting in the loss of important data features during the dimensionality reduction process. To solve these issues, we propose the auto-weighted exponential tensor nuclear norm minimization for multi-attribute low-dimensional subspace clustering (MALDSC). Specifically, firstly, we design a triple matrix factorization method to find the inherent low-dimensional consensus information and obtain the corresponding multi-attribute features. Secondly, we utilize the self-expressive property of the multi-attribute features to obtain self-expressive matrices. Thirdly, to harness the complete structural information embedded within the self-expressive matrix, we tack them into a tensor, which is regulated by the auto-weighted exponential tensor nuclear norm (AWETNN), serving as a more effective substitute for the tensor rank. The AWETNN takes full account of the physical differences among singular values through a non-convex penalty function, thus more accurately representing the high-order correlation between multiple attributes. Finally, the augmented Lagrange multiplier method (ALM) is utilized to unify the above three steps into one framework. The experimental results obtained from multiple datasets demonstrate that the MALDSC algorithm outperforms the state-of-the-art algorithms in terms of performance. The code is publicly available at <span><span>https://github.com/TongWuahpu/MALDSC</span><svg><path></path></svg></span>.</div></div>\",\"PeriodicalId\":19268,\"journal\":{\"name\":\"Neurocomputing\",\"volume\":\"640 \",\"pages\":\"Article 130394\"},\"PeriodicalIF\":6.5000,\"publicationDate\":\"2025-05-07\",\"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/S0925231225010665\",\"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/S0925231225010665","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

子空间聚类(SC)是处理高维数据的常用聚类方法。然而,现有的SC算法大多忽略了原始数据中的多属性信息。此外,它们没有充分利用原始数据隐含的固有低维共识信息,导致在降维过程中丢失了重要的数据特征。为了解决这些问题,我们提出了多属性低维子空间聚类(MALDSC)的自加权指数张量核范数最小化方法。具体而言,我们首先设计了一种三矩阵分解方法来寻找固有的低维一致性信息,并获得相应的多属性特征;其次,利用多属性特征的自表达特性得到自表达矩阵;第三,为了利用嵌入在自表达矩阵中的完整结构信息,我们将它们附加到一个张量中,该张量由自加权指数张量核范数(AWETNN)调节,作为张量秩的更有效替代。AWETNN通过非凸惩罚函数充分考虑了奇异值之间的物理差异,从而更准确地表示了多个属性之间的高阶相关性。最后,利用增广拉格朗日乘数法(ALM)将上述三个步骤统一到一个框架中。从多个数据集获得的实验结果表明,MALDSC算法在性能方面优于最先进的算法。该代码可在https://github.com/TongWuahpu/MALDSC上公开获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Auto-weighted exponential tensor nuclear norm minimization for multi-attribute low-dimensional subspace clustering
Subspace clustering (SC) is a commonly used clustering method for handling high-dimensional data. However, most existing SC algorithms ignore the multi-attribute information in the original data. In addition, they do not fully utilize the inherent low-dimensional consensus information implied in the original data, resulting in the loss of important data features during the dimensionality reduction process. To solve these issues, we propose the auto-weighted exponential tensor nuclear norm minimization for multi-attribute low-dimensional subspace clustering (MALDSC). Specifically, firstly, we design a triple matrix factorization method to find the inherent low-dimensional consensus information and obtain the corresponding multi-attribute features. Secondly, we utilize the self-expressive property of the multi-attribute features to obtain self-expressive matrices. Thirdly, to harness the complete structural information embedded within the self-expressive matrix, we tack them into a tensor, which is regulated by the auto-weighted exponential tensor nuclear norm (AWETNN), serving as a more effective substitute for the tensor rank. The AWETNN takes full account of the physical differences among singular values through a non-convex penalty function, thus more accurately representing the high-order correlation between multiple attributes. Finally, the augmented Lagrange multiplier method (ALM) is utilized to unify the above three steps into one framework. The experimental results obtained from multiple datasets demonstrate that the MALDSC algorithm outperforms the state-of-the-art algorithms in terms of performance. The code is publicly available at https://github.com/TongWuahpu/MALDSC.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信