Multi-view clustering leverages complementary information across views but struggles with scalability and robust inter-view fusion. We propose DREAM, a novel binary multi-view clustering method that integrates dual high-order random walks to enhance performance. First, multi-view data are mapped to bipartite graphs via RBF, then refined by high-order random walks to mitigate anchor sensitivity. Projection matrices are regularized by Enhanced Tensor Rank (ETR) for inter-view synergy, Bregman divergence for intra-view specificity, and adaptive weighting for view contribution balancing. Cluster labels are directly derived from the optimized binary codes. Experiments on four benchmarks show DREAM outperforms eight state-of-the-art methods, achieving up to 22.2% higher ACC and 29.7% higher NMI on biological datasets. The source code is available at https://github.com/HsuehBiao/DREAM.

Compared to single-view clustering, multi-view clustering leverages complementary information from different feature representations of the same object, significantly enhancing the understanding of complex data structures and improving robustness. To further address the computational bottleneck caused by high-dimensional and large-scale data, anchor-based multi-view clustering methods have attracted extensive attention in recent years. These methods select a small set of representative anchor points to construct sparse anchor graphs, approximate global similarities with linear complexity, and achieve cross-view alignment through a shared anchor space, balancing both efficiency and performance. This paper proposes an efficient frame-work for large-scale multi-view clustering, termed Consensus-Guided Anchor Graph Alignment for Multi-view Clustering (CAG2). It constructs view-specific local anchor graphs and aligns them with a global anchor graph to preserve cross-view structural consistency, while enforcing anchor similarity constraints to maintain clustering coherence. CAG2integrates three key mechanisms—anchor graph learning, graph alignment, and similarity preservation—into a unified optimization objective, which is efficiently solved via an alternating optimization strategy with theoretical convergence guarantees. Extensive experiments on five benchmark datasets against five state-of-the-art methods demonstrate its robustness and efficiency.

Multi-view clustering divides data into their under-lying partitions by exploiting multiple views information. Popular approaches leverage cross-view information by self-expressive tensor learning and then learn a low-rank or sparse essential representation tensor for capturing the global structure of multi-view data. However, this process may encounter instability due to the lack of protection for local within-view structures. To overcome this problem, this paper proposes a unified L ow-rank and HyperGraph Laplacian regularized Tensor learning (LHGT) method for multi-view clustering, which aims to integrate within-view high-order affinities in self-expressive tensor learning for capturing inherent clustering structure. LHGT effectively extracts global cross-view and local within-view high-order statistics. An effective optimization procedure is tailored for the proposed model. Experimental results on six real-world datasets illustrate the efficacy of LHGT, where a clear advance over nine state-of-the-art approaches.

The performance of most clustering methods hinges on the used pairwise affinity, which is usually denoted by a similarity matrix. However, the pairwise similarity is notoriously known for its vulnerability of noise contamination or the imbalance in samples or features, and thus hinders accurate clustering. To tackle this issue, we propose to use information among samples to boost the clustering performance. We proved that a simplified similarity for pairs, denoted by a fourth order tensor, equals to the Kronecker product of pairwise similarity matrices under decomposable assumption, or provide complementary information for which the pairwise similarity missed under indecomposable assumption. Then a high order similarity matrix is obtained from the tensor similarity via eigenvalue decomposition. The high order similarity capturing spatial information serves as a robust complement for the pairwise similarity. It is further integrated with the popular pairwise similarity, named by IPS2, to boost the clustering performance. Extensive experiments demonstrated that the proposed IPS2 significantly outperformed previous similarity-based methods on real-world datasets and it was capable of handling the clustering task over under-sampled and noisy datasets.

Multiple modality clustering seeks to partition objects via leveraging cross-modality relations to provide comprehensive descriptions of the same objects. Current clustering methods rely heavily on accurate affinity measurements among samples. The samplewise affinity is costive to be constructed yet easy to corrupt by the heterogeneous gap. In the era of big data, fast and accurate clustering of multiple modality data remains challenging. To fill the gap, we propose a novel approach to achieve the clustering by focusing on feature matching across different modalities instead of samplewise affinity. First, a feature matching matrix is calculated by measuring the potential featurewise correlations. The obtained matching matrix is decomposed into two bases corresponding to the column and row spaces of feature matching, acting as coded bases within feature spaces of the different modalities. Then, the sample assignment is obtained by jointly reconstructing the samples by the two bases. The feature matching potential and sample assignment are collaboratively learned by an alternating optimization scheme. The proposed method dramatically reduces the computational cost by avoiding the costive samplewise affinity estimation, without sacrificing accuracy. Extensive experiments on the synthetic and real-world datasets demonstrate its superior speed and high accuracy.

Clustering objects remains challenges in seeking an under-lying partition by exploiting multiple views. Popular clustering algorithms focus on designing various constraints to handle particular representation tasks, all of which rely on a predefined pairwise similarity (sample-to-sample). However, the pairwise similarity is notoriously vulnerable to noise or outliers contaminations, resulting in sub-optimal clustering performances. To tackle the issue, this paper proposes to enhance multi-view clustering by exploring varieties of high-order statistics within multi-view data, named by HIgh-order Similarity and essential Tensor clustering method (HIST). The HIST incorporates both high-order similarity (samples-to-samples) and high-order correlation (view-to-view) into an adaptive learning model to comprehensively exploit the inherent clustering structure. Experimental results on six real datasets show the superiority of our approach over the ten popular methods.

Genomic data alignment, a fundamental operation in sequencing, can be utilized to map reads into a reference sequence, query on a genomic database and perform genetic tests. However, with the reduction of sequencing cost and the accumulation of genome data, privacy-preserving genomic sequencing data alignment is becoming unprecedentedly important. In this paper, we present a comprehensive review of secure genomic data comparison schemes. We discuss the privacy threats, including adversaries and privacy attacks. The attacks can be categorized into inference, membership, identity tracing and completion attacks and have been applied to obtaining the genomic privacy information. We classify the state-of-the-art genomic privacy-preserving alignment methods into three different scenarios: large-scale reads mapping, encrypted genomic datasets querying and genetic testing to ease privacy threats. A comprehensive analysis of these approaches has been carried out to evaluate the computation and communication complexity as well as the privacy requirements. The survey provides the researchers with the current trends and the insights on the significance and challenges of privacy issues in genomic data alignment.

Multi-view clustering aims to partition objects into potential categories by utilizing cross-view information. One of the core issues is to sufficiently leverage different views to learn a latent subspace, within which the clustering task is performed. Recently, it has been shown that representing the multi-view data by a tensor and then learning a latent self-expressive tensor is effective. However, early works mainly focus on learning essential tensor representation from multi-view data and the resulted affinity matrix is considered as a byproduct or is computed by a simple average in Euclidean space, thereby destroying the intrinsic clustering structure. To that end, here we proposed a novel multi-view clustering method to directly learn a well-structured affinity matrix driven by the clustering task on Grassmann manifold. Specifically, we firstly employed a tensor learning model to unify multiple feature spaces into a latent low-rank tensor space. Then each individual view was merged on Grassmann manifold to obtain both an integrative subspace and a consensus affinity matrix, driven by clustering task. The two parts are modeled by a unified objective function and optimized jointly to mine a decomposable affinity matrix. Extensive experiments on eight real-world datasets show that our method achieves superior performances over other popular methods.

Multi-view clustering aims to partition the data into their underlying clusters via leveraging multiple views information. To exploit cross-view information, existed approaches in tensor-based subspace learning attract much attention. In order to explore essential tensor, the most recent work mainly focuses on capturing representation tensor with sparse and low-rank constraints. However, one shortcoming is that this process may suffer from instability since it did not consider retaining local structure between samples. To tackle the issue, we introduce a novel self-expressive tensor learning method considering both global and local constraints to promote the learning of representation tensor. In particular, we construct a tensor-based subspace representation that joint low-rank and graph-regularized tensor learning to a united optimization problem. The essential global structure and high-order correlations can be naturally captured through low-rank self-expressive tensor learning. Meanwhile, the local structures can be preserved by introducing graph regularized terms on representation tensor, thus bring benefits to subsequent clustering task. An effective optimization procedure for solving the proposed model is presented. We conduct extensive experiments on text, object, and gene expression datasets. The experimental results well demonstrate that the proposed method, named by TLGRL, achieves superiority over benchmark methods.