具有二部张量的不完全多视图聚类

IF 3.5 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Jiaquan Luo, Changming Zhu
{"title":"具有二部张量的不完全多视图聚类","authors":"Jiaquan Luo,&nbsp;Changming Zhu","doi":"10.1007/s10489-025-06814-6","DOIUrl":null,"url":null,"abstract":"<div><p>Incomplete Multi-view Clustering (IMC) serves as a pivotal approach in multi-view learning, as it effectively captures latent representations from incomplete multi-view data. This capability significantly enhances intelligent systems’ fault tolerance, reduces data acquisition costs, decreases dependency on data completeness in engineering applications, and improves overall robustness. However, existing incomplete multi-view clustering methods suffer from at least one of the following limitations: 1) they fail to fully explore the clustering structure of incomplete multi-view data; 2) they are sensitive to high missing ratios; 3) they treat different views equally, neglecting the inherent differences among views. This results in certain limitations for existing methods in practical applications, as they still rely on specific data completeness requirements. In this paper, we propose a novel tensor low-rank graph learning framework. First, we introduce a similarity matrix fitting module to construct independent low-dimensional representation matrices for different views under low-rank constraints and connectivity constraints. This method can effectively capture the clustering structure of the data. Furthermore, we introduce the tensor Schatten p-norm to reduce the sensitivity of the proposed method to high missing ratios. Then, we stack these low-dimensional representation matrices into a third-order tensor and leverage the advantages of rotation tensors in encoding higher-order correlations and complementary information between views to learn a low-dimensional consensus representation matrix for these low-dimensional representations. Additionally, we introduce an adaptive strategy to maximize the contribution of each view. Extensive experimental results indicate that IMCBT delivers superior performance in clustering tasks compared to various existing incomplete multi-view methods.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 13","pages":""},"PeriodicalIF":3.5000,"publicationDate":"2025-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Incomplete multiview clustering with bipartite tensors\",\"authors\":\"Jiaquan Luo,&nbsp;Changming Zhu\",\"doi\":\"10.1007/s10489-025-06814-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Incomplete Multi-view Clustering (IMC) serves as a pivotal approach in multi-view learning, as it effectively captures latent representations from incomplete multi-view data. This capability significantly enhances intelligent systems’ fault tolerance, reduces data acquisition costs, decreases dependency on data completeness in engineering applications, and improves overall robustness. However, existing incomplete multi-view clustering methods suffer from at least one of the following limitations: 1) they fail to fully explore the clustering structure of incomplete multi-view data; 2) they are sensitive to high missing ratios; 3) they treat different views equally, neglecting the inherent differences among views. This results in certain limitations for existing methods in practical applications, as they still rely on specific data completeness requirements. In this paper, we propose a novel tensor low-rank graph learning framework. First, we introduce a similarity matrix fitting module to construct independent low-dimensional representation matrices for different views under low-rank constraints and connectivity constraints. This method can effectively capture the clustering structure of the data. Furthermore, we introduce the tensor Schatten p-norm to reduce the sensitivity of the proposed method to high missing ratios. Then, we stack these low-dimensional representation matrices into a third-order tensor and leverage the advantages of rotation tensors in encoding higher-order correlations and complementary information between views to learn a low-dimensional consensus representation matrix for these low-dimensional representations. Additionally, we introduce an adaptive strategy to maximize the contribution of each view. Extensive experimental results indicate that IMCBT delivers superior performance in clustering tasks compared to various existing incomplete multi-view methods.</p></div>\",\"PeriodicalId\":8041,\"journal\":{\"name\":\"Applied Intelligence\",\"volume\":\"55 13\",\"pages\":\"\"},\"PeriodicalIF\":3.5000,\"publicationDate\":\"2025-08-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Intelligence\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10489-025-06814-6\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Intelligence","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10489-025-06814-6","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

不完全多视图聚类(IMC)是多视图学习中的一种关键方法,因为它可以有效地从不完全多视图数据中捕获潜在的表征。这种能力显著提高了智能系统的容错能力,降低了数据采集成本,降低了工程应用中对数据完整性的依赖,并提高了整体的鲁棒性。然而,现有的不完全多视图聚类方法至少存在以下一种局限性:1)不能充分探索不完全多视图数据的聚类结构;2)对高缺失率敏感;3)平等对待不同的观点,忽视了观点之间的内在差异。这给实际应用中的现有方法带来了一定的限制,因为它们仍然依赖于特定的数据完整性要求。本文提出了一种新的张量低秩图学习框架。首先,引入相似矩阵拟合模块,在低秩约束和连通性约束下构建不同视图的独立低维表示矩阵;该方法可以有效地捕获数据的聚类结构。此外,我们引入了张量Schatten p-范数,以降低所提出的方法对高缺失率的敏感性。然后,我们将这些低维表示矩阵堆叠成一个三阶张量,并利用旋转张量在编码视图之间的高阶相关性和互补信息方面的优势,学习这些低维表示的低维一致表示矩阵。此外,我们还引入了一种自适应策略来最大化每个视图的贡献。大量的实验结果表明,与现有的各种不完全多视图方法相比,IMCBT在聚类任务中具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Incomplete multiview clustering with bipartite tensors

Incomplete multiview clustering with bipartite tensors

Incomplete multiview clustering with bipartite tensors

Incomplete Multi-view Clustering (IMC) serves as a pivotal approach in multi-view learning, as it effectively captures latent representations from incomplete multi-view data. This capability significantly enhances intelligent systems’ fault tolerance, reduces data acquisition costs, decreases dependency on data completeness in engineering applications, and improves overall robustness. However, existing incomplete multi-view clustering methods suffer from at least one of the following limitations: 1) they fail to fully explore the clustering structure of incomplete multi-view data; 2) they are sensitive to high missing ratios; 3) they treat different views equally, neglecting the inherent differences among views. This results in certain limitations for existing methods in practical applications, as they still rely on specific data completeness requirements. In this paper, we propose a novel tensor low-rank graph learning framework. First, we introduce a similarity matrix fitting module to construct independent low-dimensional representation matrices for different views under low-rank constraints and connectivity constraints. This method can effectively capture the clustering structure of the data. Furthermore, we introduce the tensor Schatten p-norm to reduce the sensitivity of the proposed method to high missing ratios. Then, we stack these low-dimensional representation matrices into a third-order tensor and leverage the advantages of rotation tensors in encoding higher-order correlations and complementary information between views to learn a low-dimensional consensus representation matrix for these low-dimensional representations. Additionally, we introduce an adaptive strategy to maximize the contribution of each view. Extensive experimental results indicate that IMCBT delivers superior performance in clustering tasks compared to various existing incomplete multi-view methods.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Applied Intelligence
Applied Intelligence 工程技术-计算机:人工智能
CiteScore
6.60
自引率
20.80%
发文量
1361
审稿时长
5.9 months
期刊介绍: With a focus on research in artificial intelligence and neural networks, this journal addresses issues involving solutions of real-life manufacturing, defense, management, government and industrial problems which are too complex to be solved through conventional approaches and require the simulation of intelligent thought processes, heuristics, applications of knowledge, and distributed and parallel processing. The integration of these multiple approaches in solving complex problems is of particular importance. The journal presents new and original research and technological developments, addressing real and complex issues applicable to difficult problems. It provides a medium for exchanging scientific research and technological achievements accomplished by the international community.
×
引用
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学术官方微信