Li Zheng, Guanghui Yan, Chunyang Tang, Tianfeng Yan
{"title":"Tensorized graph-guided view recovery for incomplete multi-view clustering","authors":"Li Zheng, Guanghui Yan, Chunyang Tang, Tianfeng Yan","doi":"10.1007/s10489-025-06515-0","DOIUrl":null,"url":null,"abstract":"<div><p>Multi-view clustering (MVC) methods have demonstrated remarkable success when all samples are available across multiple views by leveraging consistency and complementary information. However, real-world multi-view data often suffers from incompleteness, where some samples are missing in one or more views. This incompleteness makes MVC challenging, as it becomes difficult to uncover consistency and complementary relationships among the view data. As a result, Incomplete Multi-View Clustering (IMVC) has emerged to address the limitations posed by missing data. An intuitive approach to tackle this issue is view recovery-effectively leveraging consistency information from multiple views to impute missing data. However, the quality of view recovery heavily depends on the learned consistency information, making it crucial to learn high-quality consistency representations. To address this challenge, we propose a novel approach called Tensorized Graph-Guided View Recovery (TGGVR), which integrates view recovery and tensorized graph learning within a unified framework. The tensorized graph learning estimate a similarity graph for each view by exploiting consistency and complementary information through tensorized learning. In addition, high-quality neighborhood structures are exploited to obtain a more accurate consensus graph. This high-quality consensus graph then guides the more accurate recovery of missing data, establishing a cyclical procedure in which tensorized graph learning and data imputation mutually reinforce each other. Experimental results demonstrate that our proposed method outperforms several state-of-the-art approaches in tackling the challenging task of IMVC. Notably, our method significantly outperforms representative competing methods by more than 5% and 10% on the BBC and Caltech datasets, respectively.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 7","pages":""},"PeriodicalIF":3.4000,"publicationDate":"2025-04-08","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-06515-0","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Multi-view clustering (MVC) methods have demonstrated remarkable success when all samples are available across multiple views by leveraging consistency and complementary information. However, real-world multi-view data often suffers from incompleteness, where some samples are missing in one or more views. This incompleteness makes MVC challenging, as it becomes difficult to uncover consistency and complementary relationships among the view data. As a result, Incomplete Multi-View Clustering (IMVC) has emerged to address the limitations posed by missing data. An intuitive approach to tackle this issue is view recovery-effectively leveraging consistency information from multiple views to impute missing data. However, the quality of view recovery heavily depends on the learned consistency information, making it crucial to learn high-quality consistency representations. To address this challenge, we propose a novel approach called Tensorized Graph-Guided View Recovery (TGGVR), which integrates view recovery and tensorized graph learning within a unified framework. The tensorized graph learning estimate a similarity graph for each view by exploiting consistency and complementary information through tensorized learning. In addition, high-quality neighborhood structures are exploited to obtain a more accurate consensus graph. This high-quality consensus graph then guides the more accurate recovery of missing data, establishing a cyclical procedure in which tensorized graph learning and data imputation mutually reinforce each other. Experimental results demonstrate that our proposed method outperforms several state-of-the-art approaches in tackling the challenging task of IMVC. Notably, our method significantly outperforms representative competing methods by more than 5% and 10% on the BBC and Caltech datasets, respectively.
期刊介绍:
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.