Autoencoder Based Nonnegative Matrix Factorization with Collaborative Consensus for Incomplete Multiview Clustering
Shalini, Vandana Saini, Tarun Yadav, Krishna Kumar Sharma
University of Kota
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
Aim of multiview clustering (MVC) is to partition the data into clusters by exploiting complementary information from multiple views. Conventional MVC approaches generally assume that all views are fully observed; however, this assumption is often not true in real-world scenarios where data incompleteness is inevitable. The performance of conventional MVC models degrades by such missing views. This limitation of MVC methods has motivated the development of incomplete multiview clustering (IMVC) methods. Existing IMVC methods are although promising still face challenges like robust latent representation, cross-view consensus and structure preservation under high missing ratios. To overcome this limitation, a novel Autoencoder based Nonnegative Matrix Factorization with Collaborative Consensus for incomplete multiview clustering (IMVC-AENMF) framework is proposed. The proposed method integrates three key components: First, an autoencoder-like factorization strategy that imposes encoder–decoder consistency to enhance the stability of latent representations. Second, a collaborative consensus learning mechanism that aligns view-specific latent spaces with a shared consensus representation, enabling effective cross-view knowledge transfer despite incompleteness. Third, a graph Laplacian regularization term that preserves the intrinsic manifold structure and ensures cluster smoothness. The unified objective function is inherently nonconvex, and an efficient alternating optimization algorithm with multiplicative update rules is derived to guarantee convergence to a local optimum. Extensive experiments on five commonly used datasets and one real-world financial dataset demonstrate that our framework not only achieves superior clustering performance compared to state-of-the-art incomplete MVC methods but also exhibits strong robustness against varying missing rates, thereby providing a powerful solution for practical multiview learning applications.
逐年被引趋势
暂无年度引用数据
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AIAdvanced Clustering Algorithms Research
Face and Expression Recognition · Data Mining and Machine Learning Applications