{"title":"多属性低维子空间聚类的自加权指数张量核范数最小化","authors":"Tong Wu, Gui-Fu Lu, 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, Gui-Fu Lu, 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}
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 publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.