Incomplete Multi-view Clustering Research Articles

Data Completion-guided Unified Graph Learning for Incomplete Multi-View Clustering

Due to its heterogeneous property, multi-view data has been widely concerned over single-view data for performance improvement. Unfortunately, some instances may be with partially available information because of some uncontrollable factors, for which the incomplete multi-view clustering (IMVC) problem is raised. IMVC aims to partition unlabeled incomplete multi-view data into their clusters by exploiting the heterogeneity of multi-view data and overcoming the difficulty of data loss. However, most existing IMVC methods like BSV, MIC, OMVC, and IVC tend to conduct basic completion processing on the input data, without taking advantage of the correlation between samples and information redundancy. To overcome the above issue, we propose one novel IMVC method named Data Completion-guided Unified Graph Learning (DCUGL), which could complete the data of missing views and fuse multiple learned view-specific similarity matrices into one unified graph. Specifically, we first reduce the dimension of the input data to learn multiple view-specific similarity matrices. By stacking all view-specific similarity matrices, DCUGL constructs a third-order tensor with the low-rank constraint, such that sample correlation within and between views can be well explored. Finally, by dividing the original data into observed data and unobserved data, DCUGL can infer and complete the missing data according to the view-specific similarity matrices, and obtain a unified graph, which can be directly used for clustering. To solve the proposed model, we design an iterative algorithm, which is based on the alternating direction method of multipliers (ADMM) framework. The proposed model proves to be superior by benchmarking on six challenging datasets compared with state-of-the-art IMVC methods.

Deep embedding based tensor incomplete multi-view clustering

The majority of multi-view data are extracted from real life, which often lose information in some views. To solve this problem, existing incomplete multi-view clustering algorithms explore the valuable information from incomplete data while populating the missing information. Nevertheless, they suffer from the following two limitations: 1) The non-linear relationships of high-dimensional available data are not considered. 2) Although some methods utilize information from different views to fill in missing information, they still cannot precisely explore the missing information of each view. To this end, this article proposes a novel one-step incomplete multi-view framework, referred to as deep embedding based tensor incomplete multi-view clustering (DETIMC). Concretely, in this framework, the high-dimensional available data are projected into the low-dimensional embedding space by deep non-negative matrix factorization (NMF), which can obtain a clean space while capturing the complex non-linear relationship of available data. Moreover, a novel double-enhanced missing-view inferring strategy is developed, in which the weighted higher-order information of different views and the clustering structure information are simultaneously exploited. Comprehensive experiments on several benchmark datasets exhibit the superiority of DETIMC over conventional and state-of-the-art algorithms.

Low-rank representation induced missing-view recovery for incomplete multi-view clustering

In practical applications, multi-view data suffers from incompleteness, which refers to the absence of some samples in each view. Incomplete multi-view clustering is developed to capture the common cluster structure across incomplete views. However, some existing IMC methods ignore the missing samples or the latent relationship between the available and the unavailable samples. We propose a novel missing-view recovery strategy to overcome these two drawbacks. Considering that each missing sample and part of the observable samples belong to the same category, we recover each missing sample via the linear combination of observed samples within each view. Based on the semantic consistency, we extract a unified self-representation graph from complete views and impose a low-rank constraint on it. Furthermore, we learn a comprehensive representation from complete multi-view data and introduce the dynamic weights to consider the importance of various views. The experimental results on several datasets demonstrate that the proposed method outperforms the state-of-the-art IMC approaches.

Graph Regularized and Feature Aware Matrix Factorization for Robust Incomplete Multi-View Clustering

Graph Regularized and Feature Aware Matrix Factorization for Robust Incomplete Multi-View Clustering

An adaptive weighted self-representation method for incomplete multi-view clustering

An adaptive weighted self-representation method for incomplete multi-view clustering

Tensor schatten-p norm guided incomplete multi-view self-representation clustering

Incomplete multi-view clustering (IMC), which aims to handle incomplete data with missing views, has recently received more attention. According to the investigation of the existing IMC methods, they have at least one of the four limitations. First, some methods do not recover the missing view-specific information. Second, some approaches rely on fixed similarity graphs of incomplete views. Third, some methods need a separate spectral clustering step to produce the final cluster indicator. Last, most works utilize tensor nuclear norm to characterize the low-rank property of multi-view representation. These four limitations degrade the clustering performance. Hence, this paper proposes a tensor schatten-p norm guided incomplete multi-view self-representation clustering (TIMSRC) method to handle these four limitations simultaneously. TIMSRC models the missing instances as a data matrix for each view. And it integrates the missing samples inferring and complete self-representation graph learning into a unified framework. TIMSRC adopts a multi-view spectral clustering with adaptive weights to mine the semantic information while considering the contributions of multiple self-representing graphs. TIMSRC exploits the tensor schatten-p norm to enhance the low-rank property of a three-order tensor constructed with multiple self-representation graphs. We present an optimization algorithm to solve the objective function. The experiments demonstrate that TIMSRC outperforms the state-of-the-art IMC approaches.

Self-Completed Bipartite Graph Learning for Fast Incomplete Multi-View Clustering

Self-Completed Bipartite Graph Learning for Fast Incomplete Multi-View Clustering

How to Construct Corresponding Anchors for Incomplete Multiview Clustering

How to Construct Corresponding Anchors for Incomplete Multiview Clustering

Sample-Level Cross-View Similarity Learning for Incomplete Multi-View Clustering

Incomplete multi-view clustering has attracted much attention due to its ability to handle partial multi-view data. Recently, similarity-based methods have been developed to explore the complete relationship among incomplete multi-view data. Although widely applied to partial scenarios, most of the existing approaches are still faced with two limitations. Firstly, fusing similarities constructed individually on each view fails to yield a complete unified similarity. Moreover, incomplete similarity generation may lead to anomalous similarity values with column sum constraints, affecting the final clustering results. To solve the above challenging issues, we propose a Sample-level Cross-view Similarity Learning (SCSL) method for Incomplete Multi-view Clustering. Specifically, we project all samples to the same dimension and simultaneously construct a complete similarity matrix across views based on the inter-view sample relationship and the intra-view sample relationship. In addition, a simultaneously learning consensus representation ensures the validity of the projection, which further enhances the quality of the similarity matrix through the graph Laplacian regularization. Experimental results on six benchmark datasets demonstrate the ability of SCSL in processing incomplete multi-view clustering tasks. Our code is publicly available at https://github.com/Tracesource/SCSL.

Adaptive Feature Imputation with Latent Graph for Deep Incomplete Multi-View Clustering

In recent years, incomplete multi-view clustering (IMVC), which studies the challenging multi-view clustering problem on missing views, has received growing research interests. Previous IMVC methods suffer from the following issues: (1) the inaccurate imputation for missing data, which leads to suboptimal clustering performance, and (2) most existing IMVC models merely consider the explicit presence of graph structure in data, ignoring the fact that latent graphs of different views also provide valuable information for the clustering task. To overcome such challenges, we present a novel method, termed Adaptive feature imputation with latent graph for incomplete multi-view clustering (AGDIMC). Specifically, it captures the embbedded features of each view by incorporating the view-specific deep encoders. Then, we construct partial latent graphs on complete data, which can consolidate the intrinsic relationships within each view while preserving the topological information. With the aim of estimating the missing sample based on the available information, we utilize an adaptive imputation layer to impute the embedded feature of missing data by using cross-view soft cluster assignments and global cluster centroids. As the imputation progresses, the portion of complete data increases, contributing to enhancing the discriminative information contained in global pseudo-labels. Meanwhile, to alleviate the negative impact caused by inferior impute samples and the discrepancy of cluster structures, we further design an adaptive imputation strategy based on the global pseudo-label and the local cluster assignment. Experimental results on multiple real-world datasets demonstrate the effectiveness of our method over existing approaches.

Incomplete Contrastive Multi-View Clustering with High-Confidence Guiding

Incomplete multi-view clustering becomes an important research problem, since multi-view data with missing values are ubiquitous in real-world applications. Although great efforts have been made for incomplete multi-view clustering, there are still some challenges: 1) most existing methods didn't make full use of multi-view information to deal with missing values; 2) most methods just employ the consistent information within multi-view data but ignore the complementary information; 3) For the existing incomplete multi-view clustering methods, incomplete multi-view representation learning and clustering are treated as independent processes, which leads to performance gap. In this work, we proposed a novel Incomplete Contrastive Multi-View Clustering method with high-confidence guiding (ICMVC). Firstly, we proposed a multi-view consistency relation transfer plus graph convolutional network to tackle missing values problem. Secondly, instance-level attention fusion and high-confidence guiding are proposed to exploit the complementary information while instance-level contrastive learning for latent representation is designed to employ the consistent information. Thirdly, an end-to-end framework is proposed to integrate multi-view missing values handling, multi-view representation learning and clustering assignment for joint optimization. Experiments compared with state-of-the-art approaches demonstrated the effectiveness and superiority of our method. Our code is publicly available at https://github.com/liunian-Jay/ICMVC. The version with supplementary material can be found at http://arxiv.org/abs/2312.08697.

DVSAI: Diverse View-Shared Anchors Based Incomplete Multi-View Clustering

In numerous real-world applications, it is quite common that sample information is partially available for some views due to machine breakdown or sensor failure, causing the problem of incomplete multi-view clustering (IMVC). While several IMVC approaches using view-shared anchors have successfully achieved pleasing performance improvement, (1) they generally construct anchors with only one dimension, which could deteriorate the multi-view diversity, bringing about serious information loss; (2) the constructed anchors are typically with a single size, which could not sufficiently characterize the distribution of the whole samples, leading to limited clustering performance. For generating view-shared anchors with multi-dimension and multi-size for IMVC, we design a novel framework called Diverse View-Shared Anchors based Incomplete multi-view clustering (DVSAI). Concretely, we associate each partial view with several potential spaces. In each space, we enable anchors to communicate among views and generate the view-shared anchors with space-specific dimension and size. Consequently, spaces with various scales make the generated view-shared anchors enjoy diverse dimensions and sizes. Subsequently, we devise an integration scheme with linear computational and memory expenditures to integrate the outputted multi-scale unified anchor graphs such that running spectral algorithm generates the spectral embedding. Afterwards, we theoretically demonstrate that DVSAI owns linear time and space costs, thus well-suited for tackling large-size datasets. Finally, comprehensive experiments confirm the effectiveness and advantages of DVSAI.

Deep Variational Incomplete Multi-View Clustering: Exploring Shared Clustering Structures

Incomplete multi-view clustering (IMVC) aims to reveal shared clustering structures within multi-view data, where only partial views of the samples are available. Existing IMVC methods primarily suffer from two issues: 1) Imputation-based methods inevitably introduce inaccurate imputations, which in turn degrade clustering performance; 2) Imputation-free methods are susceptible to unbalanced information among views and fail to fully exploit shared information. To address these issues, we propose a novel method based on variational autoencoders. Specifically, we adopt multiple view-specific encoders to extract information from each view and utilize the Product-of-Experts approach to efficiently aggregate information to obtain the common representation. To enhance the shared information in the common representation, we introduce a coherence objective to mitigate the influence of information imbalance. By incorporating the Mixture-of-Gaussians prior information into the latent representation, our proposed method is able to learn the common representation with clustering-friendly structures. Extensive experiments on four datasets show that our method achieves competitive clustering performance compared with state-of-the-art methods.

Incomplete Multiview Clustering via Semidiscrete Optimal Transport for Multimedia Data Mining in IoT

With the wide deployment of the Internet of Things (IoT), large volumes of incomplete multiview data that violates data integrity is generated by various applications, which inevitably produces negative impacts on the quality of service of IoT systems. Incomplete multiview clustering (IMC), as an essential technique of data processing, has the potential for mining patterns of incomplete IoT data. However, previous methods utilize notion-strong distances that can only measure differences between distributions at the overlap of data manifolds in fusing complementary information of data for pattern mining. They may suffer from biased estimation and information loss in capturing intrinsic structures of incomplete multiview data. To address these challenges, a semidiscrete multiview optimal transport (SD-MOT) is defined for IMC, which utilizes distances with weak notions to capture intrinsic structures of incomplete multiview data. Specifically, IMC is recast as an equivalent optimal transport between continuous incomplete multiview data and discrete clustering centroids, to avoid the strict assumption on overlap between manifolds in pattern mining. Then, SD-MOT is instantiated as a deep incomplete contrastive clustering network to remedy biased estimation and information loss on intrinsic structures of incomplete multiview data. Afterwards, a variational solution to SD-MOT is derived to effectively train the network parameters for pattern mining. Finally, extensive experiments on four representative incomplete multiview datasets verify the superiority of SD-MOT in comparison with nine baseline methods.

Augmented Sparse Representation for Incomplete Multiview Clustering.

Incomplete multiview data are collected from multiple sources or characterized by multiple modalities, where the features of some samples or some views may be missing. Incomplete multiview clustering (IMVC) aims to partition the data into different groups by taking full advantage of the complementary information from multiple incomplete views. Most existing methods based on matrix factorization or subspace learning attempt to recover the missing views or perform imputation of the missing features to improve clustering performance. However, this problem is intractable due to a lack of prior knowledge, e.g., label information or data distribution, especially when the missing views or features are completely damaged. In this article, we proposed an augmented sparse representation (ASR) method for IMVC. We first introduce a discriminative sparse representation learning (DSRL) model, which learns the sparse representations of multiple views as applied to measure the similarity of the existing features. The DSRL model explores complementary and consistent information by integrating the sparse regularization item and a consensus regularization item, respectively. Simultaneously, it learns a discriminative dictionary from the original samples. The sparsity constrained optimization problem in the DSRL model can be efficiently solved by the alternating direction method of multipliers (ADMM). Then, we present a similarity fusion scheme, namely, a sparsity augmented fusion of sparse representations, to obtain a sparsity augmented similarity matrix across different views for spectral clustering. Experimental results on several datasets demonstrate the effectiveness of the proposed ASR method for IMVC.

Incomplete Multiview Nonnegative Representation Learning With Graph Completion and Adaptive Neighbors.

Despite incomplete multiview clustering (IMC) being widely studied in the past decade, it is still difficult to model the correlation among multiple views due to the absence of partial views. Most existing works for IMC only mine the correlation among multiple views from available views and ignore the importance of missing views. To address this issue, we propose a novel Incomplete Multiview Nonnegative representation learning model with Graph completion and Adaptive neighbors (IMNGA), which performs common graph learning, missing graph completion, and consensus nonnegative representation learning simultaneously. In IMNGA, the common graph on all views and the incomplete graph of each view are used to reconstruct the completed graph of the corresponding view, where the common graph satisfies the neighbor constraints of incomplete multiview data and consensus representation. IMNGA gets consensus representation by factorizing completed and incomplete graphs, where consensus representation satisfies the common graph constraint. IMNGA shows its effectiveness by outperforming other state-of-the-art methods.

View-specific anchors coupled tensorial bipartite graph learning for incomplete multi-view clustering

The incomplete multi-view clustering (IMVC) aims to explore the consensus and complementary information embedded in incomplete multi-view data, so as to accurately aggregate all samples into different clusters. Existing IMVC methods still have the following issues that need to be further solved: how to efficiently (1) alleviate the computational complexity; (2) capture the complementary information from views; (3) uncover the high-order correlations underlying incomplete multi-view data. To address these problems, a new method, called view-specific anchors coupled tensorial bipartite graph learning for incomplete multi-view clustering (VA-TBGIMC), is proposed in this paper. Specifically, view-specific anchors are learned from non-missing samples to represent the distribution of all samples including missing ones. With the help of high-quality anchors, the bipartite graph between all samples and anchors is constructed, which can preserve the complementary information. Meanwhile, these bipartite graphs are stacked into a tensor which is imposed with a low-rank constraint to adequately capture the inter-view and inter-sample correlations from incomplete multi-view data. Further, the augmented graph of bipartite graph is constrained by Laplacian rank to learn a consensus cluster indicator. A large number of experiments validate the superiority and efficiency of the proposed method in terms of clustering performance and time consumption.

Incomplete multi-view clustering via local and global bagging of anchor graphs

Anchor graphs are powerful tools for large-scale applications, but their quality depends on the selection of representative anchors, which is a difficult endeavor. Another challenge is to cluster data with incomplete multi-view features, which have missing values in some views. This paper proposes a novel method for incomplete multi-view clustering based on local and global bagging of anchor graphs. Our method does not require a specific anchor selection scheme but leverages bagging techniques to reduce the variance and discover the intrinsic anchor graph. Specifically, we first construct bagged partial anchor graphs for each incomplete view by randomly sampled anchors. Then, we integrate the bagged partial anchor graphs from multiple views into a unified and complete anchor graph. Finally, we apply global bagging to the unified anchor graph to further boost performance. Our method can generate robust anchor graphs for incomplete multi-view clustering scenarios, as evidenced by extensive experiments.

Refining Graph Structure for Incomplete Multi-View Clustering.

As a challenging problem, incomplete multi-view clustering (MVC) has drawn much attention in recent years. Most of the existing methods contain the feature recovering step inevitably to obtain the clustering result of incomplete multi-view datasets. The extra target of recovering the missing feature in the original data space or common subspace is difficult for unsupervised clustering tasks and could accumulate mistakes during the optimization. Moreover, the biased error is not taken into consideration in the previous graph-based methods. The biased error represents the unexpected change of incomplete graph structure, such as the increase in the intra-class relation density and the missing local graph structure of boundary instances. It would mislead those graph-based methods and degrade their final performance. In order to overcome these drawbacks, we propose a new graph-based method named Graph Structure Refining for Incomplete MVC (GSRIMC). GSRIMC avoids recovering feature steps and just fully explores the existing subgraphs of each view to produce superior clustering results. To handle the biased error, the biased error separation is the core step of GSRIMC. In detail, GSRIMC first extracts basic information from the precomputed subgraph of each view and then separates refined graph structure from biased error with the help of tensor nuclear norm. Besides, cross-view graph learning is proposed to capture the missing local graph structure and complete the refined graph structure based on the complementary principle. Extensive experiments show that our method achieves better performance than other state-of-the-art baselines.

Incomplete multi-view clustering via self-attention networks and feature reconstruction

Incomplete multi-view clustering via self-attention networks and feature reconstruction