Jobin Francis;Baburaj Madathil;Sudhish N. George;Sony George
{"title":"基于$l_{\\frac{1}{2}}$诱导张量核范数的非凸低秩稀疏约束多视图子空间聚类","authors":"Jobin Francis;Baburaj Madathil;Sudhish N. George;Sony George","doi":"10.1109/TSIPN.2023.3306098","DOIUrl":null,"url":null,"abstract":"In the realm of clustering of multi-view data, many of the clustering methods, generate view-specific representations for individual views and conjoin them for final grouping. However, in most of the cases,such methods fail to effectively discover the underlying complementary information and higher order correlations present in a multi-view data. Unlike many of the existing works, this paper proposes a nonconvex low rank tensor approximation based clustering framework for multi-view data, relying on the self-expressiveness property of free submodules. Instead of creating individual representation for each view, the proposed method creates a single optimal representation tensor for all the submodules, with a low tensor rank and an f-diagonal structure. The \n<inline-formula><tex-math>$l_{\\frac{1}{2}}$</tex-math></inline-formula>\n-induced Tensor Nuclear Norm (TNN) incorporated as a low tensor rank constraint, improves the low rankness of the representation tensor. In addition, a structural constraint is integrated into the proposed method by means of a dissimilarity matrix with \n<inline-formula><tex-math>$l_{\\frac{1}{2}}$</tex-math></inline-formula>\n regularization. Furthermore, the proposed dissimilarity matrix is capable of extracting complementary information and higher order correlations underneath each lateral slice more effectively. The clustering efficiency of the proposed method was evaluated using popular evaluation measures on several challenging multi-view datasets. Experimental results of the proposed method were compared to state-of-the-art single-view and multi-view clustering methods. The compared results demonstrate the improved performance of the proposed method over the existing clustering methods.","PeriodicalId":56268,"journal":{"name":"IEEE Transactions on Signal and Information Processing over Networks","volume":"9 ","pages":"612-625"},"PeriodicalIF":3.0000,"publicationDate":"2023-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Nonconvex Low Rank and Sparse Constrained Multiview Subspace Clustering via $l_{\\\\frac{1}{2}}$-Induced Tensor Nuclear Norm\",\"authors\":\"Jobin Francis;Baburaj Madathil;Sudhish N. George;Sony George\",\"doi\":\"10.1109/TSIPN.2023.3306098\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the realm of clustering of multi-view data, many of the clustering methods, generate view-specific representations for individual views and conjoin them for final grouping. However, in most of the cases,such methods fail to effectively discover the underlying complementary information and higher order correlations present in a multi-view data. Unlike many of the existing works, this paper proposes a nonconvex low rank tensor approximation based clustering framework for multi-view data, relying on the self-expressiveness property of free submodules. Instead of creating individual representation for each view, the proposed method creates a single optimal representation tensor for all the submodules, with a low tensor rank and an f-diagonal structure. The \\n<inline-formula><tex-math>$l_{\\\\frac{1}{2}}$</tex-math></inline-formula>\\n-induced Tensor Nuclear Norm (TNN) incorporated as a low tensor rank constraint, improves the low rankness of the representation tensor. In addition, a structural constraint is integrated into the proposed method by means of a dissimilarity matrix with \\n<inline-formula><tex-math>$l_{\\\\frac{1}{2}}$</tex-math></inline-formula>\\n regularization. Furthermore, the proposed dissimilarity matrix is capable of extracting complementary information and higher order correlations underneath each lateral slice more effectively. The clustering efficiency of the proposed method was evaluated using popular evaluation measures on several challenging multi-view datasets. Experimental results of the proposed method were compared to state-of-the-art single-view and multi-view clustering methods. The compared results demonstrate the improved performance of the proposed method over the existing clustering methods.\",\"PeriodicalId\":56268,\"journal\":{\"name\":\"IEEE Transactions on Signal and Information Processing over Networks\",\"volume\":\"9 \",\"pages\":\"612-625\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2023-08-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Signal and Information Processing over Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10223426/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Signal and Information Processing over Networks","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10223426/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
A Nonconvex Low Rank and Sparse Constrained Multiview Subspace Clustering via $l_{\frac{1}{2}}$-Induced Tensor Nuclear Norm
In the realm of clustering of multi-view data, many of the clustering methods, generate view-specific representations for individual views and conjoin them for final grouping. However, in most of the cases,such methods fail to effectively discover the underlying complementary information and higher order correlations present in a multi-view data. Unlike many of the existing works, this paper proposes a nonconvex low rank tensor approximation based clustering framework for multi-view data, relying on the self-expressiveness property of free submodules. Instead of creating individual representation for each view, the proposed method creates a single optimal representation tensor for all the submodules, with a low tensor rank and an f-diagonal structure. The
$l_{\frac{1}{2}}$
-induced Tensor Nuclear Norm (TNN) incorporated as a low tensor rank constraint, improves the low rankness of the representation tensor. In addition, a structural constraint is integrated into the proposed method by means of a dissimilarity matrix with
$l_{\frac{1}{2}}$
regularization. Furthermore, the proposed dissimilarity matrix is capable of extracting complementary information and higher order correlations underneath each lateral slice more effectively. The clustering efficiency of the proposed method was evaluated using popular evaluation measures on several challenging multi-view datasets. Experimental results of the proposed method were compared to state-of-the-art single-view and multi-view clustering methods. The compared results demonstrate the improved performance of the proposed method over the existing clustering methods.
期刊介绍:
The IEEE Transactions on Signal and Information Processing over Networks publishes high-quality papers that extend the classical notions of processing of signals defined over vector spaces (e.g. time and space) to processing of signals and information (data) defined over networks, potentially dynamically varying. In signal processing over networks, the topology of the network may define structural relationships in the data, or may constrain processing of the data. Topics include distributed algorithms for filtering, detection, estimation, adaptation and learning, model selection, data fusion, and diffusion or evolution of information over such networks, and applications of distributed signal processing.