Deep Incomplete Multi-view Clustering with Cross-view Partial Sample and Prototype Alignment

Abstract

The success of existing multi-view clustering relies on the assumption of sample integrity across multiple views. However, in real-world scenarios, samples of multi-view are partially available due to data corruption or sensor failure, which leads to incomplete multi-view clustering study (IMVC). Although several attempts have been proposed to address IMVC, they suffer from the following drawbacks: i) Existing methods mainly adopt cross-view contrastive learning forcing the representations of each sample across views to be exactly the same, which might ignore view discrepancy and flexibility in representations; ii) Due to the absence of non-observed samples across multiple views, the obtained prototypes of clusters might be unaligned and biased, leading to incorrect fusion. To address the above issues, we propose a Cross-view Partial Sample and Prototype Alignment Network (CPSPAN) for Deep Incomplete Multi-view Clustering. Firstly, unlike existing contrastive-based methods, we adopt pair-observed data alignment as 'proxy supervised signals' to guide instance-to-instance correspondence construction among views. Then, regarding of the shifted prototypes in IMVC, we further propose a prototype alignment module to achieve incomplete distribution calibration across views. Extensive experimental results showcase the effectiveness of our proposed modules, attaining noteworthy performance improvements when compared to existing IMVC competitors on benchmark datasets.

Efficient Multi-View Graph Clustering with Local and Global Structure Preservation

“…Numerous methods have been proposed on the basis of this framework by imposing different constraints [14,22,27,41,73] or exploring various types of regularization terms [69,73,76]. Nie et al [40] generate the optimal Laplacian matrices by the linear combinations of Laplacian basis matrices constructed from multiview samples.…”

TMac: Temporal Multi-Modal Graph Learning for Acoustic Event Classification

“…By treating samples as nodes and relationships between samples as edges, GNNs can easily capture the underlying relationships and rules between samples through message propagation mechanisms, which are suitable to various types of graphs [9,26,38,41,43,44]. GNNs have gained significant popularity and are widely employed in various real-world applications, including recommendation [81], community discovery [25,50], fake news detection [29,85], multi-view clustering [24,74,78,92], bioinformatics [22], hyper-graph analysis [82], image processing [27,30], etc, because they can find the relationship between samples in changing and multivariate data [28,75,88].…”