LGAIJun 4, 2023

Fast Continual Multi-View Clustering with Incomplete Views

arXiv:2306.02389v174 citationsh-index: 51
Originality Incremental advance
AI Analysis

This addresses a challenging scenario in multi-view clustering for applications with streaming or privacy-sensitive data, but it is incremental as it builds on existing methods to handle incompleteness.

The paper tackles the incomplete continual data problem in multi-view clustering, where views arrive over time with missing data and cannot be stored, by proposing FCMVC-IV, which updates a consensus matrix with incoming views and handles incomplete samples using indicator and rotation matrices, achieving superior performance in experiments.

Multi-view clustering (MVC) has gained broad attention owing to its capacity to exploit consistent and complementary information across views. This paper focuses on a challenging issue in MVC called the incomplete continual data problem (ICDP). In specific, most existing algorithms assume that views are available in advance and overlook the scenarios where data observations of views are accumulated over time. Due to privacy considerations or memory limitations, previous views cannot be stored in these situations. Some works are proposed to handle it, but all fail to address incomplete views. Such an incomplete continual data problem (ICDP) in MVC is tough to solve since incomplete information with continual data increases the difficulty of extracting consistent and complementary knowledge among views. We propose Fast Continual Multi-View Clustering with Incomplete Views (FCMVC-IV) to address it. Specifically, it maintains a consensus coefficient matrix and updates knowledge with the incoming incomplete view rather than storing and recomputing all the data matrices. Considering that the views are incomplete, the newly collected view might contain samples that have yet to appear; two indicator matrices and a rotation matrix are developed to match matrices with different dimensions. Besides, we design a three-step iterative algorithm to solve the resultant problem in linear complexity with proven convergence. Comprehensive experiments on various datasets show the superiority of FCMVC-IV.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes