{"title":"分区级融合诱导的多视角子空间聚类与张量格曼等级。","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":"{\"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}","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}
Partition-level fusion induced multi-view Subspace Clustering with Tensorial Geman Rank.
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.
期刊介绍:
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.