In recent years, multi-view graph clustering (MVGC) has attracted increasing attention from researchers. However, many existing MVGC methods focus on view-level integration through strategies like assigning weights to different views, for example, ignoring cross-view interactions between nodes. In fact, cross-view interactions at node level are crucial for extraction and fusion of semantic information. Additionally, some methods separate representation learning from clustering, which results in suboptimal clustering performance. To address these problems, we propose a novel unsupervised cross-view message passing method for MVGC. The kernel of our method is the cross-view interaction mechanism, which dynamically constructs node-specific cross-view edges based on node features and structural information. The mechanism enables adaptive interactions of informative nodes from different views, which promotes the extraction and propagation of complementary information. Besides, our method unifies representation learning and hyperspherical clustering in an end-to-end framework, which projects node representations into a hypersphere space, thereby enabling direct acquisition of balanced clustering results without dependence on external clustering methods. We provide comprehensive analyses on our method, and evaluate our method on six multi-view datasets. The results show that our method consistently achieves superior performance than existing state-of-the-art multi-view clustering methods.

In this paper, we present a novel Self-Supervised Learning (SSL) framework tailored for Multi-View Clustering (MVC), which learns cross-view semantic representations with clear clustering boundaries and derives balanced clustering in an end-to-end manner. Concretely, we propose a generative SSL module that learns high-level semantic representations by recovering randomly masked views from observed views. Then the extracted representations are unified via a sample-level local fusion mechanism and projected into a unit-hypersphere space with evenly distributed cluster prototypes such that the pseudo labels can be directly retrieved using cosine similarity. For each sample, we define highly credible positive pairs of the same cluster and negative pairs of different clusters and design a contrastive SSL module to force the sample to move toward its cluster prototype while farther from the other prototypes in the embedding space. Consequently, the representations exhibit clearer clustering boundaries, and the two SSL modules benefit each other. Finally, we further introduce a clustering regularizer to prevent trivial solutions and derive balanced clustering with theoretical guarantees. Comprehensive evaluations over eight benchmark datasets validate the effectiveness of our proposals against ten state-of-the-art MVC methods.