arrow
Return

A Method for Consensus Anchor Graph Learning for Incomplete Multi-View Clustering

delete2026-02-02
delete0
delete
OA
AI
S
Seungmin Lee
Y
Yejin Kan
D
Dongyeon Kim
M
Minseop Kim
G
Gangman Yi
DOI:10.1109/ACCESS.2026.3659917delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Multi-view clustering (MVC) is a prevalent method for integrating heterogeneous domain-specific information from diverse views. However, most MVC methods assume that all views have complete observed data, which is often unfeasible in practical applications due to missing or corrupted data. To address this limitation, incomplete multi-view clustering (IMC) was developed to handle partially observed data. Recently, anchor graph-based IMC has been proposed, as conventional IMC methods typically involve quadratic or higher complexity, which substantially restricts their scalability to large and complex datasets. Although these methods enhance efficiency by approximating sample–anchor relationships, their performance still degrades under conditions of high missing rates. Therefore, we propose a scalable anchor graph-based IMC algorithm specifically designed for large-scale datasets. Our method enhances clustering performance in severely incomplete data by combining two strategies. First, a bipartite anchor learning strategy minimizes computational cost to nearly linear time while preserving inter-view structure. Second, a consensus graph learning term integrates view-specific discriminability with cross-view consistency. Dynamic anchor updates enable the framework to effectively adapt to varying dataset scales and missing patterns. The framework’s effectiveness was confirmed via experiments on 16 datasets across multiple domains, where we evaluated its clustering accuracy and execution time. The proposed method’s validity is verified by its ability to outperform representative IMC baselines and scales to large datasets. Its reliability is also maintained even with high incompleteness levels, highlighting its practicality for large-scale, real-world applications. Source code and implementation details are available at: https://datalab.dongguk.edu/IMC
Keywords:
Incomplete multi-view clustering
bipartite graph learning
anchor graph
consensus learning
graph learning

Journal

IEEE Access cover
IEEE Access
IF:
3.6
Papers:
9.8W
Citations:
29.4W

Organization

D
dongguk university
Scholars:
1.2K
Papers: 567
Citations: 0
Cited Papers

Cited Papers

Graph Learning for Multiview Clustering
err2018-10-01
err393
PREAI
errZhan, Kun; Zhang, Changqing; Guan, Junpeng; Wang, Junsheng
errShare
errSave
errShare
errSave
K-mer natural vector and its application to the phylogenetic analysis of genetic sequences
errGene
IF0
err2014-08-01
err0
errOAAI
errJia Wen; Raymond H.F. Chan; Shek-Chung Yau; Rong L. He; Stephen S.T. Yau
errShare
errSave
Tensor Completion-Based Incomplete Multiview Clustering
err2022-12-01
err48
PREAI
errXia, Wei; Gao, Quanxue; Wang, Qianqian; Gao, Xinbo
errShare
errSave
errShare
errSave
Tensor-based consensus learning for incomplete multi-view clustering
err2023-12-01
err14
PREAI
errMu, Jinshuai; Song, Peng; Yu, Yanwei; Zheng, Wenming
errShare
errSave
researcher View more