Graph refinement and consistency self-supervision for tensorized incomplete multi-view clustering

In practical multi-view applications, some data in each view are missing. Although recent incomplete multi-view clustering (IMC) approaches have achieved encouraging performance, two challenges remain. They utilize the tensor nuclear norm to explore the high-order correlations among view-specific similarity graphs. Moreover, they only infer the missing views but do not recover the consensus cluster structure across complete views. To address these issues, we propose a new method called graph Refinement and consistency Self-Supervision for Tensorized Incomplete Multi-view Clustering (RS-TIMC). Specifically, RS-TIMC introduces graph decomposition to remove the diverse similarities from the view-specific graphs and utilizes the tensor Schatten-p norm to model the consistent parts. Additionally, by extracting features from the original observable data and inferring the missing instances, RS-TIMC enables the cluster structure of each complete view to be adjusted. Finally, RS-TIMC utilizes consistent similarity graphs to recover the shared local geometric structure across all complete views. Experimental evaluations on several datasets indicate that our method outperforms the start-of-the-art approaches. • Improving two defects of the tensorized IMC method based on missing-view recovery. • Enhancing multi-view high-order consistency by refining view-specific similarity. • Recovering complete multi-view data with flexible cluster structures. • Ensuring the recovered multiple views share the same underlying cluster structure.

Authors

Institutions

Publication Details

Journal
Information Fusion
Published
2024-09-20
DOI
https://doi.org/10.1016/j.inffus.2024.102709
Citations
4
Primary Topic
Advanced Clustering Algorithms Research
Type
article
Field-Weighted Citation Impact
1.39

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Graph refinement and consistency self-supervision for tensorized incomplete multi-view clustering

Xiao‐Yuan Jing, Deyu Zeng, Tengyu Zhang, Wei Liu
4 citations
Information Fusion
Advanced Clustering Algorithms Research
1.39
article

Graph refinement and consistency self-supervision for tensorized incomplete multi-view clustering

Xiao‐Yuan Jing, Deyu Zeng, Tengyu Zhang, Wei Liu
article en
4 citations

Abstract

In practical multi-view applications, some data in each view are missing. Although recent incomplete multi-view clustering (IMC) approaches have achieved encouraging performance, two challenges remain. They utilize the tensor nuclear norm to explore the high-order correlations among view-specific similarity graphs. Moreover, they only infer the missing views but do not recover the consensus cluster structure across complete views. To address these issues, we propose a new method called graph Refinement and consistency Self-Supervision for Tensorized Incomplete Multi-view Clustering (RS-TIMC). Specifically, RS-TIMC introduces graph decomposition to remove the diverse similarities from the view-specific graphs and utilizes the tensor Schatten-p norm to model the consistent parts. Additionally, by extracting features from the original observable data and inferring the missing instances, RS-TIMC enables the cluster structure of each complete view to be adjusted. Finally, RS-TIMC utilizes consistent similarity graphs to recover the shared local geometric structure across all complete views. Experimental evaluations on several datasets indicate that our method outperforms the start-of-the-art approaches. • Improving two defects of the tensorized IMC method based on missing-view recovery. • Enhancing multi-view high-order consistency by refining view-specific similarity. • Recovering complete multi-view data with flexible cluster structures. • Ensuring the recovered multiple views share the same underlying cluster structure.

Information FusionVol. 114
Shenzhen University (CN), Wuhan University (CN), Guangdong University of Petrochemical Technology (CN), Xi'an Jiaotong University (CN)
National Natural Science Foundation of China
Reduced inequalities
Openalex Percentile: Top 16%
Advanced Clustering Algorithms Research
1.39
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.