Multiview Clustering via Proximity Learning in Latent Representation Space

Multiple Self-Adaptive Correlation-Based Multiview Multilabel Learning

In order to process multiview multilabel, multilabel, and multiview data, current learning algorithms are designed on the basis of data characteristics, correlations, etc. While these algorithms cannot express correlations among different features, instances, labels in within-view, cross-view, and consensus-view representations self-adaptively and relative accurately. To this end, this study takes the classical multiple correlations-based model as the basis and explores some laws of self-adaptive change for those correlations in multiple representations. The proposed algorithm is called multiple self-adaptive correlation-based multiview multilabel learning (MuSC-MVML). Extensive experiments on 38 datasets demonstrate the superiority of MuSC-MVML and some conclusions are addressed. 1) MuSC-MVML outperforms most compared algorithms in statistical in terms of AUC and its performance is also stable; 2) the computational cost of MuSC-MVML is moderate and on most datasets, MuSC-MVML has a relatively fast convergence; and 3) introducing some laws of self-adaptive change for those correlations can improve the ability of MuSC-MVML to process multiview multilabel datasets effectively and express correlations in multiple representations better. Furthermore, this study explains the reason that why we use alternating optimization strategy to optimize the model of MuSC-MVML and provides some suggestions that how to modify the model of MuSC-MVML to process incomplete multiview multilabel datasets with noise.

Contrastive Multiview Attribute Graph Clustering With Adaptive Encoders

Multiview attribute graph clustering aims to cluster nodes into disjoint categories by taking advantage of the multiview topological structures and the node attribute values. However, the existing works fail to explicitly discover the inherent relationships in multiview topological graph matrices while considering different properties between the graphs. Besides, they cannot well handle the sparse structure of some graphs in the learning procedure of graph embeddings. Therefore, in this article, we propose a novel contrastive multiview attribute graph clustering (CMAGC) with adaptive encoders method. Within this framework, the adaptive encoders concerning different properties of distinct topological graphs are chosen to integrate multiview attribute graph information by checking whether there exists high-order neighbor information or not. Meanwhile, the number of layers of the GCN encoders is selected according to the prior knowledge related to the characteristics of different topological graphs. In particular, the feature-level and cluster-level contrastive learning are conducted on the multiview soft assignment representations, where the union of the first-order neighbors from the corresponding graph pairs is regarded as the positive pairs for data augmentation and the sparse neighbor information problem in some graphs can be well dealt with. To the best of our knowledge, it is the first time to explicitly deal with the inherent relationships from the interview and intraview perspectives. Extensive experiments are conducted on several datasets to verify the superiority of the proposed CMAGC method compared with the state-of-the-art methods.

LR Aerial Photo Categorization by Cross-Resolution Perceptual Knowledge Propagation

There are hundreds of high- and low-altitude earth observation satellites that asynchronously capture massive-scale aerial photographs every day. Generally, high-altitude satellites take low-resolution (LR) aerial pictures, each covering a considerably large area. In contrast, low-altitude satellites capture high-resolution (HR) aerial photos, each depicting a relatively small area. Accurately discovering the semantics of LR aerial photos is an indispensable technique in computer vision. Nevertheless, it is also a challenging task due to: 1) the difficulty to characterize human hierarchical visual perception and 2) the intolerable human resources to label sufficient training data. To handle these problems, a novel cross-resolution perceptual knowledge propagation (CPKP) framework is proposed, focusing on adapting the visual perceptual experiences deeply learned from HR aerial photos to categorize LR ones. Specifically, by mimicking the human vision system, a novel low-rank model is designed to decompose each LR aerial photo into multiple visually/semantically salient foreground regions coupled with the background nonsalient regions. This model can: 1) produce a gaze-shifting path (GSP) simulating human gaze behavior and 2) engineer the deep feature for each GSP. Afterward, a kernel-induced feature selection (FS) algorithm is formulated to obtain a succinct set of deep GSP features discriminative across LR and HR aerial photos. Based on the selected features, the labels from LR and HR aerial photos are collaboratively utilized to train a linear classifier for categorizing LR ones. It is worth emphasizing that, such a CPKP mechanism can effectively optimize the linear classifier training, as labels of HR aerial photos are acquired more conveniently in practice. Comprehensive visualization results and comparative study have validated the superiority of our approach.

Sparse Low-Rank Multi-View Subspace Clustering With Consensus Anchors and Unified Bipartite Graph

Anchor technology is popularly employed in multi-view subspace clustering (MVSC) to reduce the complexity cost. However, due to the sampling operation being performed on each individual view independently and not considering the distribution of samples in all views, the produced anchors are usually slightly distinguishable, failing to characterize the whole data. Moreover, it is necessary to fuse multiple separated graphs into one, which leads to the final clustering performance heavily subject to the fusion algorithm adopted. What is worse, existing MVSC methods generate dense bipartite graphs, where each sample is associated with all anchor candidates. We argue that this dense-connected mechanism will fail to capture the essential local structures and degrade the discrimination of samples belonging to the respective near anchor clusters. To alleviate these issues, we devise a clustering framework named SL-CAUBG. Specifically, we do not utilize sampling strategy but optimize to generate the consensus anchors within all views so as to explore the information between different views. Based on the consensus anchors, we skip the fusion stage and directly construct the unified bipartite graph across views. Most importantly, norm and Laplacian-rank constraints employed on the unified bipartite graph make it capture both local and global structures simultaneously. norm helps eliminate the scatters between anchors and samples by constructing sparse links and guarantees our graph to be with clear anchor-sample affinity relationship. Laplacian-rank helps extract the global characteristics by measuring the connectivity of unified bipartite graph. To deal with the nondifferentiable objective function caused by norm, we adopt an iterative re-weighted method and the Newton's method. To handle the nonconvex Laplacian-rank, we equivalently transform it as a convex trace constraint. We also devise a four-step alternate method with linear complexity to solve the resultant problem. Substantial experiments show the superiority of our SL-CAUBG.

Multiview Spectral Clustering Based on Consensus Neighbor Strategy

Multiview spectral clustering, renowned for its spatial learning capability, has garnered significant attention in the data mining field. However, existing methods assume that the optimal consensus adjacency matrix is confined within the space spanned by each view's adjacency matrix. This constraint restricts the feasible domain of the algorithm and hinders the exploration of the optimal consensus adjacency matrix. To address this limitation, we propose a novel and convex strategy, termed the consensus neighbor strategy, for learning the optimal consensus adjacency matrix. This approach constructs the optimal consensus adjacency matrix by capturing the consensus local structure of each sample across all views, thereby expanding the search space and facilitating the discovery of the optimal consensus adjacency matrix. Furthermore, we introduce the concept of a correlation measuring matrix to prevent trivial solution. We develop an efficient iterative algorithm to solve the resulting optimization problem, benefitting from the convex nature of our model, which ensures convergence to a global optimum. Experimental results on 16 multiview datasets demonstrate that our proposed algorithm surpasses state-of-the-art methods in terms of its robust consensus representation learning capability. The code of this article is uploaded to https://github.com/PhdJiayiTang/Consensus-Neighbor-Strategy.git.

Iterative Multiview Subspace Learning for Unpaired Multiview Clustering

In real applications, several unpredictable or uncertain factors could result in unpaired multiview data, i.e., the observed samples between views cannot be matched. Since joint clustering among views is more effective than individual clustering in each view, we investigate unpaired multiview clustering (UMC), which is a valuable but insufficiently studied problem. Due to lack of matched samples between views, we could fail to build the connection between views. Therefore, we aim to learn the latent subspace shared by views. However, existing multiview subspace learning methods usually rely on the matched samples between views. To address this issue, we propose an iterative multiview subspace learning strategy [iterative unpaired multiview clustering (IUMC)], aiming to learn a complete and consistent subspace representation among views for UMC. Moreover, based on IUMC, we design two effective UMC methods: 1) Iterative unpaired multiview clustering via covariance matrix alignment (IUMC-CA) that further aligns the covariance matrix of subspace representations and then performs clustering on the subspace and 2) iterative unpaired multiview clustering via one-stage clustering assignments (IUMC-CY) that performs one-stage multiview clustering (MVC) by replacing the subspace representations with clustering assignments. Extensive experiments show the excellent performance of our methods for UMC, compared with the state-of-the-art methods. Also, the clustering performance of observed samples in each view can be considerably improved by those observed samples from the other views. In addition, our methods have good applicability in incomplete MVC.

Parameter-Free and Scalable Incomplete Multiview Clustering With Prototype Graph

Multiview clustering (MVC) seamlessly combines homogeneous information and allocates data samples into different communities, which has shown significant effectiveness for unsupervised tasks in recent years. However, some views of samples may be incomplete due to unfinished data collection or storage failure in reality, which refers to the so-called incomplete multiview clustering (IMVC). Despite many IMVC pioneer frameworks have been introduced, the majority of their approaches are limited by the cubic time complexity and quadratic space complexity which heavily prevent them from being employed in large-scale IMVC tasks. Moreover, the massively introduced hyper-parameters in existing methods are not practical in real applications. Inspired by recent unsupervised multiview prototype progress, we propose a novel parameter-free and scalable incomplete multiview clustering framework with the prototype graph termed PSIMVC-PG to solve the aforementioned issues. Different from existing full pair-wise graph studying, we construct an incomplete prototype graph to flexibly capture the relations between existing instances and discriminate prototypes. Moreover, PSIMVC-PG can directly obtain the prototype graph without pre-process of searching hyper-parameters. We conduct massive experiments on various incomplete multiview tasks, and the performances show clear advantages over existing methods. The code of PSIMVC-PG can be publicly downloaded at https://github.com/wangsiwei2010/PSIMVC-PG.