With the wide-application of Internet of Things, many collected data are naturally represented with multiple feature views. For instance, an image can be encoded by its color, texture, shape and spatial descriptors. These feature views embody the consistent and complementary information of the same image, which spur extensive research of learning on multi-view data [35, 49]. Fusing these feature views can not only form a comprehensive description of the data, but also benefit the learning tasks on them, such as classification , clustering  and metric learning . This work focuses on multi-view clustering (MVC), which aims to excavate complementary and consensus information across multiple views to identify the essential grouping structure with no requirement of labels from these data.
Various attempts have been made to find essential grouping structures of multi-view data. Some algorithms force the clustering results of different views being consistent with each other via correlation maximization , co-regularization , fusing multiple similarity matrices of individual views , or exploring common and diverse information among views . Other approaches assume the clusters of a clustering are embedded in different subspaces and try to explore these subspaces and find clusters therein [32, 29]
. More recently, deep learning techniques also have been proposed to extract the high-order correlation and dependency between multi-view data for effective clustering[26, 53]. Besides, some other efforts study how to work on multi-view data with missing views, i.e., some objects are not available for all the views [24, 46].
These mentioned MVC algorithms account for the multiplicity of multi-view data, but focus on generating a single clustering result only. In practice, such multiplicity can also support to group the data in multiple different but meaningful clusterings [9, 51]. For example, a bunch of facial images represented with heterogeneous views can be separately grouped from the perspective of identity, sex and of emotions. All these groupings are different but yet meaningful. These reasonable groupings of the data are potentially useful for some purposes, regardless of whether or not it is optimal according to a specific clustering criterion . Alike traditional clustering that focuses on the quality, multiple clusterings additionally pursue the diversity among alternative clusterings. However, it is a knotty task to balance the diversity and quality of these clusterings . Previous works tried to obtain multiple clusterings in independent (or orthogonal) subspaces [6, 30, 41], by eliminating redundancy between the clusterings that are generated successively [2, 48], by executing clustering assignment again for the generated base clusterings, or by simultaneously gaining multiple clusterings and controlling the redundancy. However, they were designed for single-view data only.
A few efforts have been made toward exploring multiple clusterings on multi-view data. Multi-view multiple clusterings (MVMC)  mines the individual and shared information of multi-view data by utilizing self-representation learning , and then decomposes the combinations of the individuality feature matrices and commonality feature matrix by semi-nonnegative matrix factorization  to obtain multiple clusterings. DMClusts is another multi-view multiple clusterings algorithm based on deep matrix factorization. It decomposes the multi-view data matrices layer-by-layer to obtain multiple common subspaces and generate corresponding clusterings therein. These two efforts still ideally assume all the data views are complete. However, this assumption is often violated in practice for some inevitable reasons [24, 36], such as the temporary failure of sensors or the human caused errors. As a result, the collected multi-view data are often incomplete. A simple strategy is to remove the samples with missing feature views, but this strategy obviously may throw away too much information, especially when with a high missing rate. Incomplete multi-view clustering (IMC) solutions have been proposed to address this practical issue. Some of them resort to matrix factorization to extract the shared subspace [24, 47], fill the missing information 
, or use Generate Adversarial Network (GAN) to replenish the missing data [39, 46]. However, none of existing IMC methods can generate multiple clusterings with both high quality and diversity.
To address the drawbacks mentioned above, we propose a deep incomplete multi-view multiple clusterings framework (DiMVMC, as illustrated in Figure 1). DiMVMC adopts decoder networks to generate clusterings from representational subspaces and to complete the missing features of instances. The input for the -th decoder network is the -th shared subspace which is randomly initialized at first, while the output is the reconstruction of multi-view data. By alternatively optimizing the decoder deep networks and , DiMVMC can achieve the completeness and individually shared subspaces simultaneously. Moreover, these decoder networks are not isolated, but additionally controlled by a redundancy term based on Hilbert Schmidt Independence Criterion (HSIC) , which further enforces the diversity among subspaces and thus reduces the redundancy between clusterings. The main contributions of our work are summarized as follows:
We study how to generate multiple clusterings on multi-view data with missing samples, which is an important and practical topic, but more challenging and mostly overlooked by previous solutions. To our knowledge, DiMVMC is the first deep approach to generate multiple clusterings.
DiMVMC discards the ad-hoc encoder part of autoencoder and works in a unsupervised way, as such DiMVMC has a lower network complexity and can more flexibly deal with data incompleteness in different views. In addition, it uses a redundancy quantification term to reduce the overlap among decoder networks for producing less overlapped representational subspaces, and finally generates diverse clusterings in these subspaces.
Ii Related Works
Our work has close connections with two lines of related works, incomplete multi-view clustering and multiple clusterings.
Ii-a Incomplete Multi-view Clustering
Various multi-view clustering solutions have been introduced, most of which focus on extracting the consistent/complementary information from different views to induce a consolidated clustering [5, 19, 40], while others additionally mine the individual information to achieve a more robust clustering . These methods all build on the assumption that all the data views are complete. While in practice, it is more often that some samples are absent in some views. To handle such more challenging incomplete multi-view clustering (IMC), Li et al.  presented the first solution (named PVC) based on NMF (Nonnegative Matrix Factorization) , which learned common representations for complete instances and private latent representations for incomplete instances with the same basis matrices. Next, PVC used the common and private representations to seek a clustering. Zhao et al.  further integrated PVC and manifold learning to learn the global structure of multi-view data. Nevertheless, these NMF-based methods can only deal with two-view data, limiting their application scope. Weighted NMF-based approaches [14, 34] were also proposed to deal with more than two views by filling the missing data and assigning them with lower weights. Wen et al.  added an error matrix to compensate the missing data, and combined the original incomplete data matrix with the error matrix to form a completed data matrix for clustering. All these solutions in essence build on NMF, which performs shallow projection that cannot well mine the complex relationships between low-level features of multi-view data.
To mine nonlinear structures and complex correlations among multi-view data, Wang et al.  proposed the consistent GAN for the two-view IMC problem, which used one view to generate the missing data of the other view, and then performed clustering on the generated complete data. Xu et al.  sought the common latent space of multi-view data and performed missing data inference via combining GAN with autoencoder. Ngiam et al.  extracted shared representations by training a two-view deep autoencoder to best reconstruct the two-view inputs. Zhang et al.  combined auto-encoder with Bayesian framework to fully exploit partial multi-view data to produce a structured representation for classification. These shallow/deep multi-view clustering solutions still focus on producing a single clustering. Given the multiplicity of multi-view data, it is more desirable to find different clustering results from the same data and each clustering gives an independent grouping of the data.
Ii-B Multiple Clusterings
Multiple clusterings focus on how to generate different clusterings with both high quality and diversity from the same data . It is less well studied than single/multi-view clustering and ensemble clustering [16, 55], due to its requirement on generating multiple groups of results, and the difficulties on guaranteeing the good quality and diversity at the same time. Bae et al. 
proposed a multiple clusterings solution based on hierarchical clustering (COALA). The main idea of COALA is that instances with higher intra-class similarity still gather in one cluster, while those with lower intra-class similarity are considered to be placed into different clusters for another clustering. Jainet al. presented Dec-kmeans , which obtained diverse clusterings simultaneously by finding multiple groups of mutually orthogonal cluster centroids. Unlike COALA and Dec-kmeans that directly control the diversity between clustering results, other solutions control the diversity between clustering subspaces and then generate different clusterings in these subspaces. Cui et al.  greedily found orthogonal projection matrices to get different feature representations of the original data and then found clusterings in these orthogonal subspaces. Mautz et al. 
also tried to explore multiple mutually orthogonal subspaces, along with the optimization of k-means objective function, to find non-redundant clusterings. However, the orthogonal constraint is too strict to generate more than two clusterings. Wanget al.  generated multiple independent subspaces with semantic interpretation via independent subspace analysis, and then performed kernel-based clustering in these subspaces to explore diverse clusterings. Yang and Zhang  explicitly defined a regularization term to quantify and minimize the redundancy between the already generated clusterings and the to-be-generated one, and then plugged this regularization into the matrix factorization based clustering  to find another clustering. Wang et al.  and Yao et al. directly minimized the redundancy between all the to-be-generated clusterings to simultaneously find alternative clusterings. Besides, Caruana et al.  firstly generated a number of useful high-quality clusterings, and then grouped these clusterings at the meta-level, and thus allowed the user to select a few high-quality and non-redundant clusterings for examination. However, these multiple clusterings methods are still restricted to single-view data.
Given the multiplicity of multi-view data, it is desirable but more difficult to generate multiple clusterings from the same multi-view data. Two approaches have been proposed for attacking this challenging task. MVMC  first extends multi-view self-representation learning  to explore the individuality information encoding matrices and the commonality information matrix shared across views, and then combines each individuality similarity matrix and the commonality similarity to generate a distinct clustering by matrix factorization. However, given the cubic time complexity of the self-representation learning, MVMC can hardly be applicable on datasets with a large number of samples. To alleviate this drawback, DMClusts extends the deep matrix factorization [37, 53] to collaboratively factorize the multi-view data matrices into multiple representational subspaces layer-by-layer, and seeks a different clustering of high quality per layer. In addition, it introduces a new balanced redundancy quantification term to guarantee the diversity among these clusterings, and thus reduces the overlap between the produced clusterings.
The above-mentioned single/multi-view multiple clusterings solutions assume all instances are complete across views, and project data into linear and shallow subspaces. Therefore, they cannot capture the complex correlations between views and nonlinear clusters in subspaces when data are incomplete. To address these issues, we introduce DiMVMC to mine multiple clusterings from multi-view data with missing instances. DiMVMC can capture the complex correlations among views and complete data by multiple decoder networks, and thus generate multiple nonlinear clusterings with quality and diversity.
Iii The Proposed Method
It was empirically demonstrated that different data views are complementary to each other, and they carry distinct information for generating diverse clusterings with quality [51, 43]. However, multi-view multiple clusterings is still challenging due to the difficulty in modeling the unknown and complex correlation among different views. Moreover, data with missing views and the required diversity between clusterings further upgrade the difficulty to address the incomplete multi-view multiple clusterings problem. Autoencoder is typically used to reconstruct the data with missing/noisy features [12, 46, 52]. The encoder takes input the incomplete data and learns a compact representation, from which the decoder recovers the missing values. To avoid the ad-hoc design of encoder for the incomplete cases in different views, we skip the encoder and take the shared subspace representation as the input for the -th decoder network, from which the observed data are reconstructed and the missing data are completed, as shown in Fig. 1. In addition, we quantify and minimize the redundancy among these subspaces for generating diverse clusterings therein. The following subsections elaborate on the above procedure.
Iii-a Generating Multiple Representation Subspaces
Suppose a multi-view dataset with views has instances. We use (
) to denote the feature vector for the-th view of the -th instance, where is the feature dimension of the -th view. An indicator matrix for all instances is defined as:
where each column of is the status (present/absent) of instances for corresponding views. The relation holds, such that each instance is present in at least one view.
The aim of incomplete multi-view multiple clusterings is to integrate all the incomplete views to generate multiple clusterings. Inspired by cross partial multi-view networks for classification and by multi-view subspace learning [52, 45], we project instances with arbitrary view-missing patterns into the shared representational subspaces in a flexible way, where the subspaces include the information for observed views. That is, each view can be reconstructed by the obtained shared representation. Based on the reconstruction point of view 
, we use the joint distribution to concrete the above idea as follows:
where is the multi-view shared representation of the -th instance, and , By maximizing , the common subspaces can be obtained. However, just alike typical subspace learning methods [38, 8], (2) also optimizes one subspace and a single clustering result therein. Because of the multiplexes, multi-view data has a mix of diverse distributions. Therefore, multiple different subspaces and clusterings can co-exist. To gain multiple () clusterings, we extend (2) as:
where is the shared representation of the -th instance in the -th shared subspace. Based on different views in , we model the likelihood with respect to given the observation as:
where represents the reconstruction loss. Here, we adopt the -norm for this reconstruction part. is the mapping function from the common subspace to the -th view and are decoder network parameters of .
Without loss of generality, suppose the data are independent and identically distributed, we can induce the log-likelihood function as follows:
Since maximizing the likelihood is equivalent to minimizing the loss , by considering the missing case, we can obtain the following objective function for the decoder network:
Optimizing the above equation can generate shared representations , each of which will be used to generate a clustering result. Unlike traditional autoencoder based solutions [46, 52], DiMVMC skips the encoder networks, but takes the shared subspace representation as the input for the -th decoder to complete multi-view data, as done by in (6). As such, DiMVMC does not need to specifically consider diverse missing cases of multi-view data, while still makes full use of observed data.
Iii-B Reducing Redundancy between Subspaces
By minimizing (6), we can generate multiple common subspaces from incomplete multi-view data. For multiple clusterings, besides the quality of different clusterings, the diversity between clusterings is also important . The diversity is usually approximately obtained by minimizing the redundancy between these subspaces. Orthogonality is the most common approach that forces two subspaces being orthogonal with each other. Orthogonality based methods may still generate multiple clusterings with high redundancy, since these orthogonal subspaces can still produce clusters with the same structure . Furthermore, orthogonality does not specify which properties of the reference clustering should or should not be retained. Kullback Leibler (KL) divergence was also adopted to find diverse clusterings 
, but KL divergence is not symmetric and not applicable for high-dimensional data, due to its high time and space complexity.
Hilbert-Schmidt Independence Criterion (HSIC)  measures the squared norm of the cross-covariance operator over and
in the Hilbert kernel space to estimate the dependency. It is empirically given by:
where and are Gram matrices, defined as an inner product between vectors in a specific kernel space. , if , otherwise. In this paper, we adopt the inner product kernel to specify . A lower HSIC value means two subspaces are less correlated. This empirical estimation is simpler than any other kernel dependence test, and requires no user-defined regularisation. In addition, it has a solid theoretical foundation, a fast learning rate with guaranteed exponential convergence, and the capability in measuring both linear and nonlinear dependence between variables. For these merits, we adopt HSIC to quantify the overlap between generated subspaces .
Iii-C Unified Model
), we define the loss function of DiMVMC as:
where ( is the average of , ) is the normalization factor, is the hyper-parameter to balance the sought of subspaces and diversity between them. DiMVMC can generate multiple common subspaces and complete missing data simultaneously via minimizing (8). Since the optimal solution cannot be analytically given, we employ an optimization strategy that alternatively updates or in an iterative way, while fixing the others. More specifically, and are randomly initialized at first. The detailed optimization process is given in Algorithm 1. Once the optimization is done, -means is implemented on each obtained subspace , and thus clusterings with quality and diversity can be accordingly generated.
In the subspace clustering, it is desired that the subspace representation is sparse but captures the group-level semantic information. There are different ways to bring in sparsity. For example, we can add a drop-out layer for the deep learning approach. Here, to make an intuitive implementation, we add a sparsity-induced regularization into the above loss function and define a so-called Sparse DiMVMC:
where is the norm of the matrix. When , (9) goes back to the plain DiMVMC.
Iv Experimental Results and Analysis
Iv-a Experimental Setup
In this section, we evaluate the performance of our proposed DiMVMC on four benchmark multi-view datasets, as described in Table I. Caltech20  is a subset of Caltech-101 of 6 categories, which contains 2,386 instances and 20 clusters. We utilize 254D CENHIST vector, 512D GIST vector and 928D LBP vector as three views. Handwritten  is comprised of 2,000 data points from 0 to 9 digit classes, with 200 data points for each class. There are six public features available. We utilize 240D pixel averages feature, 216D profile correlations feature and 76D LBP feature as three views. Reuters  is a textual data set consisting of 111,740 documents in five different languages (English, French, German, Spanish and Italian) of 6 classes. We randomly sample 12000 documents from this collection in a balanced manner. We further do dimensionality reduction on the 12000 samples following the methodology of  and represent each view by 256 numeric features. Mirflickr includes 25,000 samples collected from Flicker with an image view and a textual view. Here, we remove textual tags that appear less than 20 times, and then remove samples without textual tags or semantic labels, finally we get 16,738 samples for experiments .
|Caltech20||2386, 3||20||[254, 512, 928]|
|Handwritten||2000, 3||10||[240, 216, 76]|
|Reuters||12000, 5||6||[256, 256, 256, 256, 256]|
|Mirflickr||16738, 2||24||[150, 500]|
We compare DiMVMC against with six representative and recent multiple clusterings algorithms, including Dec-kmeans , Nr-kmeans , OSC , MNMF , MVMC  and DMClusts . Dec-kmeans is a representative multiple clusterings solution based on orthogonalizing the clustering centroids. Nr-kmeans , OSC  and MNMF  attempt different techniques to seek subspaces and multiple clusterings therein. For this reason, they have close connections with our approach and are used for experimental comparison. MVMC  and DMClusts  are the only two multi-view multiple clusterings algorithms at present.
None of these compared multiple clusterings algorithms can directly handle missing data, we fill the missing features (instances) with average values for each view at first, and then apply these solutions. For those single-view algorithms, following the solution in [51, 43], we concatenate the feature vectors of multi-view data and then apply them on the concatenated vectors to generate different clusterings. Note, we do not take the deep/incomplete multi-view clustering solutions for experiments, since they can only output a single clustering. In the following experiments, the input parameters of the comparing methods are fixed (or optimized) as the authors suggested in their papers or generously shared codes.
DiMVMC selected the input parameters from the following ranges: , , and . The alternate clusterings are generated by applying -means algorithm on each shared subspace . The number of clusters for alternate clusterings was fixed to of each dataset, as listed in Table I. In this paper, DiMVMC simply adopts two layers’ network structure for each mapping to reconstruct the -th view from the -th shared subspace . The demo code of DiMVMC is available at http://mlda.swu.edu.cn/codes.php?name=DiMVMC.
Following the evaluation protocol used by the baseline methods [48, 42, 51], we measure the quality of multiple clusterings via the average SC (Silhouette Coefficient) or DI (Dunn Index), and the diversity via the NMI (Normalized Mutual Information) or JC (Jaccard Coefficient). SC and DI quantify the compactness and separation of clusters within a clustering, while NMI and JC quantify the similarity of clusters of two clusterings and . We want to remark that unlike traditional clustering problem, a lower value of NMI and JC means the two alternative cluterings are less overlapped, so a smaller value of them is more preferred.
Iv-B Discovering Multiple Clusterings
) indicates the preferred direction for the corresponding evaluation metric.indicates whether our DiMVMC is statistically (according to pairwise -test at 95% significance level) superior/inferior to the other method.
For the first experiment, we assume the four multi-view datasets are complete without any missing data. We report the average results of ten independent runs and standard deviations of each method on generating two alternative clusterings in TableII.
From Table II, we has the following important observations:
(i) Multi-view vs. Single-view: DiMVMC, DMClusts and MVMC can be directly applied on multi-view data, and their generated two clusterings often have a lower redundancy than those generated by other compared methods. That is because these methods lack a redundancy control term or their redundancy strategies are difficult to be optimized. Our following experiment will further analyze the importance of redundancy control. DiMVMC frequently obtains a better quality than compared methods that can only work on the concatenated single view, which suggests that concatenating the feature vectors overrides the intrinsic nature of multi-view data, which helps to generate multiple clusterings with quality. These comparisons prove the effectiveness of our proposed approach in fusing multiple data views to generate multiple clusterings with diversity and quality.
(ii) Shallow methods vs. DiMVMC: To our knowledge, DiMVMC is the first deep approach to generate multiple clusterings, and it often performs better on quality metrics (SC and DI), owing to the high-level expression ability of decoder networks. Even though, DiMVMC sporadically has a lower value on SC than some of compared methods. That is due to the widely-recognized dilemma of obtaining alternative clusterings with both high diversity and quality. DiMVMC has a larger diversity. That is explainable, since it can explore diverse nonlinear representation subspaces by decoder networks, while these shallow methods can only obtain low-level feature subspaces. Therefore, DiMVMC has a better tradeoff between quality and diversity than these compared methods. Although DiMVMC, DMClusts and MVMC can generate diverse clusterings from the same multi-view data, DiMVMC manifests a better performance than the latter two. That is because DiMVMC can mine the complex correlations between views and features via decoder networks, whereas these compared methods cannot.
In summary, even with complete data across views, DiMVMC outperforms compared methods across different multi-view datasets in terms of quality and diversity.
Iv-C Impact of Missing Data
To study the performance of DiMVMC with missing data views, we define the missing rate as . The instances are randomly selected as missing ones, and the missing views are randomly erased by guaranteeing at least one of them is observed. In this paper, the missing rate is varied from 0 to 50% with an interval as 10%.
Figure 2 shows the impact of missing rate of data on the clustering performance of DiMVMC and of compared methods. With the increase of missing rate, the performance of multiple clusterings methods does degrade. Nr-kmeans  and OSC  are always in a high position in terms of SC at the beginning. This indicates that they can obtain multiple clusterings of high quality under a small rate of missing instances. However, their SC values drop faster than others with the further increase of missing rate, since they do not take into account the missing instances/features. Furthermore, their diversity (1-NMI) is also at a low-level, suggesting their orthogonal subspaces still have a relatively high redundancy.
The performance curves of multi-view methods (MVMC, DMClusts and DiMVMC) drop more slowly than the single-view methods as the increase of missing rate. That is because the correlation between views helps to reduce the impact of missing data, and concatenating features cannot well capture this complementary information. In addition, although the SC curve of DiMVMC is not always in a relatively high level, it always holds better diversity than compared methods. In addition, it holds more stable quality (SC) and diversity (1-NMI) curves than compared methods. This observation again echoes the dilemma of balancing the quality and diversity of multiple clusterings.
Finally, DiMVMC can generate clusterings of diversity controlled by the HSIC term. It is the first multiple clusterings algorithm that considers the missing data views, it can reconstruct the incomplete multi-view dataset to complete the missing data views. As such, DiMVMC is more robust to missing data. By contrast, the simple data complement strategies used by compared methods are not so robust. As a result, the performance of the compared methods is not as stable as DiMVMC is.
Figure 2 proves that DiMVMC has a better tradeoff between the quality and diversity of multiple clusterings, and is more competent in dealing with incomplete data than compared methods. That can be attributed to the adopted decoder networks and diversity control term, which can more well capture the correlations among different views and handle diverse missing patterns, and enforce the diversity among subspaces.
Iv-D Parameter Analysis
Parameter balances the generation of multiple subspaces and the diversity control among these subspaces. We study the impact of by griding it from to and plot the variation of quality (SC) and diversity (1-NMI, the larger the better) of DiMVMC on Caltech20 dataset in Figure 2(a). We see that: (i) diversity (1-NMI) steadily increases at first and then gradually increases; (ii) the quality (SC) gradually decreases and then keeps relatively stable as further increases. Overall, SC keeps relatively stable as varies, but always below the starting point (, no diversity control). This pattern is explainable, since the promotion of diversity between clusterings is often associated with the scarification of quality. We can conclude that indeed helps to boost the diversity between clusterings.
We vary (number of alternative clusterings) from 2 to 6 on Caltech20 dataset to explore the variation of average quality (SC) and diversity (1-NMI) of multiple clusterings generated by DiMVMC. In Figure 2(b), with the increase of , the average quality (SC) fluctuates in a small range while the diversity (1-NMI) decreases slowly. Overall, DiMVMC can obtain alternative clusterings of quality and diversity.
Based on the base DiMVMC, we lead an norm for each common subspace , extend DiMVMC to a sparse DiMVMC. We apply DiMVMC and sparse DiMVMC (with ) on Caltech20 dataset, and report the results in Figure 3(a). Although the SC values of these two models are both around 0.007, sparse DiMVMC has an average NMI (the lower the better) as 0.022, which is nearly 12% lower than DiMVMC (average NMI 0.025) . This comparison shows that sparsity helps to generate less correlated subspaces (fewer redundant features), and to better control the diversity of alternative clusterings.
Iv-E Convergence and Complexity Analysis
From Figure 3(b)
, we can find that DiMVMC and Sparse DiMVMC often converge within 15 epochs, while DiMVMC() without diversity control converges in 30 epochs. This trend not only proves the efficiency of our proposed alternative optimization strategy, but also shows that our diversity control term and the added norm do not increase the complexity.
The memory complexity of DiMVMC can be analyzed by two parts. For simplicity, suppose is the number of layers, is the dimension for any , and is the average dimension of views. DiMVMC takes to save the data elements, and to store the network parameters . So the memory complexity of DiMVMC for generating clusterings on views is . Since most multi-view data are typical sparse, the actual space complexity is much smaller.
The time complexity of DiMVMC can be also analyzed by two sub-problems. DiMVMC takes to update , and to update . So the time complexity of DiMVMC for generating clusterings on views is , where is the number of iterations. On the other hand, the time complexity of MVMC  is , and that of DMClusts  is . Thus, the time complexity of DiMVMC is quadratic to , due to the use of HSIC term. MVMC is quadratic to and DMClusts is linear to . Note, both the memory complexity and time complexity of DiMVMC can drop an order of magnitude via batch optimization technique.
Table III gives the run-time of all compared methods. The compared methods are run on a linux server111Configuration: Intel Xeon8163, 1TB RAM with NVIDIA Tesla K80.. All methods are implemented by Matlab2014a, except Nr-kmeans, DMClusts and DiMVMC are implemented by Python. We observe that the three fastest methods are OSC, Dec-kmeans and DMClusts, respectively. OSC and Dec-kmeans do not consider the correlations between views and work on the concatenated views, so they run faster than others. DMClusts employs the efficient semi-NMF  to decompose multi-view data layer by layer and generates multiple clustering simultaneously. Although MNMF also builds on efficient semi-NMF, it is constrained by the reference clustering when seeking the other clustering, and has a larger run-time than DMClusts. Nr-kmeans needs to update the clustering center many times, so it has a longer run-time than MNMF. MVMC involves with time demanding self-representation learning and the factorization of multiple representational matrices, so it has a longer run-time than others. Our DiMVMC has the largest run-time, since it has to capture the complex correlations between views and generate multiple clusterings with nonlinear clusters via optimizing multiple decoder networks. However, DiMVMC almost always generate multiple clusterings with better quality and diversity than these compared methods.
In this paper, we introduced the DiMVMC model to explore alternative clusterings from the ubiquitous incomplete multi-view data. DiMVMC can complete the missing data via a group of decoder networks, and seek multiple shared but diverse subspaces (clusterings therein) by further reducing the overlaps between subspaces. Experimental results on benchmark datasets confirm the effectiveness of DiMVMC. We will explore deep alternative clusterings by merging prior knowledge of different perspectives.
-  (2009) Learning from multiple partially observed views - an application to multilingual text categorization. In NeurIPS, pp. 28–36. Cited by: §IV-A.
-  (2006) Coala: a novel approach for the extraction of an alternate clustering of high quality and high dissimilarity. In ICDM, pp. 53–62. Cited by: §I, §II-B.
Alternative clustering analysis: a review. In Data Clustering: Algorithms and Applications, pp. 535–550. Cited by: §I, §II-B, §III-B.
-  (2006) Meta clustering. In ICDM, pp. 107–118. Cited by: §I, §II-B.
-  (2009) Multi-view clustering via canonical correlation analysis. In ICML, pp. 129–136. Cited by: §I, §II-A.
-  (2007) Non-redundant multi-view clustering via orthogonalization. In ICDM, pp. 133–142. Cited by: §I, §II-B, §IV-A, §IV-C.
-  (2010) Convex and semi-nonnegative matrix factorizations. TPAMI 32 (1), pp. 45–55. Cited by: §I, §II-B, §IV-E.
-  (2013) Sparse subspace clustering: algorithm, theory, and applications. TPAMI 35 (11), pp. 2765–2781. Cited by: §III-A.
Multi-insight visualization of multi-omics data via ensemble dimension reduction and tensor factorization. Bioinformatics 35 (10), pp. 1625–1633. Cited by: §I.
-  (2014) Generative adversarial nets. In NeurIPS, pp. 2672–2680. Cited by: §I.
-  (2005) Measuring statistical dependence with hilbert-schmidt norms. In ALT, pp. 63–77. Cited by: §I, §III-B.
-  (1994) Autoencoders, minimum description length and helmholtz free energy. In NeurIPS, pp. 3–10. Cited by: §III.
-  (2017) Sharable and individual multi-view metric learning. TPAMI 40 (9), pp. 2281–2288. Cited by: §I.
-  (2018) Doubly aligned incomplete multi-view clustering. In IJCAI, pp. 2262–2268. Cited by: §II-A.
-  (2019) One-pass incomplete multi-view clustering. In AAAI, pp. 3838–3845. Cited by: §I.
-  (2010) Data clustering: 50 years beyond k-means. PRL 31 (8), pp. 651–666. Cited by: §II-B.
Simultaneous unsupervised learning of disparate clusterings. Statistical Analysis and Data Mining 1 (3), pp. 195–210. Cited by: item iii, §II-B, §IV-A.
-  (2019) Multiple partitions aligned clustering. In IJCAI, pp. 2701–2707. Cited by: §I.
A co-training approach for multi-view spectral clustering. In ICML, pp. 393–400. Cited by: §II-A.
-  (2011) A co-training approach for multi-view spectral clustering. In ICML, pp. 393–400. Cited by: §IV-A.
-  (2011) Co-regularized multi-view spectral clustering. In NeurIPS, pp. 1413–1421. Cited by: §I.
-  (2001) Algorithms for non-negative matrix factorization. In NeurIPS, pp. 556–562. Cited by: §II-A.
-  (1996) Image representation using 2d gabor wavelets. TPAMI 18 (10), pp. 959–971. Cited by: §III-A.
-  (2014) Partial multi-view clustering. In AAAI, pp. 1968–1974. Cited by: §I, §I, §II-A.
-  (2015) Large-scale multi-view spectral clustering via bipartite graph. In AAAI, pp. 2750–2756. Cited by: §IV-A.
-  (2019) Deep adversarial multi-view clustering network. In IJCAI, pp. 2952–2958. Cited by: §I.
-  (2015) Partially shared latent factor learning with multiview data. TNNLS 26 (6), pp. 1233–1246. Cited by: §I.
-  (2016) Multiple kernel k-means clustering with matrix-induced regularization. In AAAI, pp. 1888–1894. Cited by: §I.
-  (2018) Consistent and specific multi-view subspace clustering.. In AAAI, pp. 3730–3737. Cited by: §I, §I, §II-A, §II-B.
-  (2018) Discovering non-redundant k-means clusterings in optimal subspaces. In KDD, pp. 1973–1982. Cited by: item iii, §I, §II-B, §IV-A, §IV-C.
-  (2011) Multimodal deep learning. In ICML, pp. 689–696. Cited by: §II-A.
-  (2004) Subspace clustering for high dimensional data: a review. SIGKDD 6 (1), pp. 90–105. Cited by: §I.
-  (2009) A principled and flexible framework for finding alternative clusterings. In KDD, pp. 717–726. Cited by: §III-B.
-  (2015) Multiple incomplete views clustering via weighted nonnegative matrix factorization with l2,1 regularization. In ECML/PKDD, pp. 318–334. Cited by: §II-A.
A survey of multi-view machine learning. NPA 23 (7-8), pp. 2031–2038. Cited by: §I.
-  (2018) Incomplete multi-view weak-label learning. In IJCAI, pp. 2703–2709. Cited by: §I, §I.
-  (2016) A deep matrix factorization method for learning attribute representations. TPAMI 39 (3), pp. 417–429. Cited by: §II-B.
-  (2011) Subspace clustering. Signal Processing Magazine IEEE 28 (2), pp. 52–68. Cited by: §III-A.
-  (2018) Partial multi-view clustering via consistent gan. In ICDM, pp. 1290–1295. Cited by: §I, §II-A.
-  (2015) On deep multi-view representation learning. In ICML, pp. 1083–1092. Cited by: §II-A.
-  (2019) Multiple independent subspace clusterings. In AAAI, pp. 5353–5360. Cited by: §I, §II-B.
-  (2018) Multiple co-clusterings. In ICDM, pp. 1308–1313. Cited by: §II-B, §IV-A.
-  (2020) Multi-view multiple clusterings using deep matrix factorization. In AAAI, pp. 6348–6355. Cited by: item iii, §I, §III-B, §III, §IV-A, §IV-A, §IV-E.
-  (2019) Unified embedding alignment with missing views inferring for incomplete multi-view clustering. In AAAI, pp. 5393–5400. Cited by: §II-A.
-  (2012) Convex multi-view subspace learning. In NeurIPS, pp. 1673–1681. Cited by: §III-A.
-  (2019) Adversarial incomplete multi-view clustering. In IJCAI, pp. 3933–3939. Cited by: §I, §I, §II-A, §III-A, §III.
-  (2018) Partial multi-view subspace clustering. In ACM MM, pp. 1794–1801. Cited by: §I.
-  (2017) Non-redundant multiple clustering by nonnegative matrix factorization. Machine Learning 106 (5), pp. 695–712. Cited by: item iii, §I, §II-B, §IV-A, §IV-A.
-  (2018) Multi-view clustering: a survey. Big Data Mining and Analytics 1 (2), pp. 83–107. Cited by: §I.
-  (2019) Discovering multiple co-clusterings in subspaces,. In SDM, pp. 423–431. Cited by: §II-B.
-  (2019) Multi-view multiple clustering. In IJCAI, pp. 4121–4127. Cited by: item iii, §I, §I, §II-B, §III, §IV-A, §IV-A, §IV-A, §IV-A, §IV-E.
-  (2019) CPM-nets: cross partial multi-view networks. In NeurIPS, pp. 557–567. Cited by: §II-A, §III-A, §III-A, §III.
-  (2017) Multi-view clustering via deep matrix factorization. In AAAI, pp. 2921–2927. Cited by: §I, §II-B.
-  (2016) Incomplete multi-modal visual data grouping.. In IJCAI, pp. 2392–2398. Cited by: §II-A.
-  (2012) Ensemble methods: foundations and algorithms. CRC Press. Cited by: §II-B.