A Nonconvex Low Rank and Sparse Constrained Multiview Subspace Clustering via $l_{\frac{1}{2}}$-Induced Tensor Nuclear Norm

IF 3 3区 计算机科学 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC IEEE Transactions on Signal and Information Processing over Networks Pub Date : 2023-08-17 DOI:10.1109/TSIPN.2023.3306098
Jobin Francis;Baburaj Madathil;Sudhish N. George;Sony George
{"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}
引用次数: 0

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 $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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于$l_{\frac{1}{2}}$诱导张量核范数的非凸低秩稀疏约束多视图子空间聚类
在多视图数据的聚类领域中,许多聚类方法为各个视图生成特定于视图的表示,并将它们结合起来进行最终分组。然而,在大多数情况下,这种方法无法有效地发现多视图数据中存在的潜在互补信息和高阶相关性。与现有的许多工作不同,本文基于自由子模块的自表达性,提出了一种基于非凸低秩张量近似的多视图数据聚类框架。所提出的方法不是为每个视图创建单独的表示,而是为所有子模块创建一个具有低张量秩和f对角结构的最优表示张量。$l_{\frac{1}{2}}$诱导的张量核范数(TNN)作为低张量秩约束引入,改善了表示张量的低秩性。此外,通过具有$l_{\frac{1}{2}}$正则化的相异矩阵,将结构约束集成到所提出的方法中。此外,所提出的相异性矩阵能够更有效地提取每个横向切片下的互补信息和高阶相关性。在几个具有挑战性的多视图数据集上,使用流行的评估措施评估了所提出方法的聚类效率。将所提出的方法的实验结果与最先进的单视图和多视图聚类方法进行了比较。对比结果表明,与现有的聚类方法相比,该方法的性能有所提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Signal and Information Processing over Networks
IEEE Transactions on Signal and Information Processing over Networks Computer Science-Computer Networks and Communications
CiteScore
5.80
自引率
12.50%
发文量
56
期刊介绍: 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.
期刊最新文献
Multi-Bit Distributed Detection of Sparse Stochastic Signals Over Error-Prone Reporting Channels Probability-Guaranteed Distributed Filtering for Nonlinear Systems on Basis of Nonuniform Samplings Subject to Envelope Constraints Variable Step-Size Diffusion Bias-Compensated APV Algorithm Over Networks Reinforcement Learning-Based Event-Triggered Constrained Containment Control for Perturbed Multiagent Systems Finite-Time Performance Mask Function-Based Distributed Privacy-Preserving Consensus: Case Study on Optimal Dispatch of Energy System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1