Multi-view representation learning is recognized for its effectiveness in multi-source data analysis, yet it faces significant challenges: 1) Deep model structures remain opaque, lacking interpretability; 2) Research on compatibility models toward multi-feature and multi-relationship data is insufficient. In this paper, we introduce an interpretable multi-view representation learning framework specifically designed for the complex multi view scene. The barrier to achieving compatibility stems from the need to simultaneously process the homogeneous information inherent in multiple features and the heterogeneous characteristic of multi-relation data. To address this, we design an objective function solved by iterative methods to learn comprehensive relationships and the consistent representation. The introduction of comprehensive relationships aims to mitigate mutual interference among different data types while combining information abstracted from original features and relationships into a unified representation. We then convert iterative solutions into feed-forward network layers with embedded learnable modules, resulting in a deep network architecture that is interpretable at the design level. Extensive experimental results demonstrate the superior performance of the proposed method over state-of-the art approaches.

Representation learning techniques effectively unveil latent patterns within raw data. However, the learning process is often marred by uncertainties, such as variations in data quality and heterogeneous scenarios, which greatly affect the reliability of representation learning. In this article, we introduce a reliable representation learning framework to establish a connection between data attributes and modeling strategies, namely the interpretable attribute-oriented representation learning framework. First, by focusing on the inherent knowledge embedded in the data, we decouple it into four principal attributes: fidelity, topology, invariance, and discriminability. To explicitly address these attributes, we incorporate them into an optimization-derived framework using corresponding general loss terms. Furthermore, by treating the iterative solution process as a bridge, each derived network module possesses traceable interpretability, thus laying a reliable foundation. Ultimately, we extend the proposed framework to multisource heterogeneous scenarios, enabling it to adapt to complex environments while maintaining reliability. In essence, our work aims to seamlessly integrate deep representations with prior knowledge during the learning process, thereby creating a solid basis for dependable modeling. Networks derived from the proposed framework achieve promising results, particularly in complex multisource heterogeneous environments, demonstrating both their effectiveness and reliability. The code is available at https://github.com/ZihanFang11/2025_AORLNet_TNNLS.

Existing methods based on graph convolutional network often struggle with large-scale graphs due to their high computing consumption and inefficiency. Although strategies such as edge sparsification and node sampling can indeed decrease the complexity, they frequently result in information loss and local information bias. Furthermore, in multi-view scenarios, traditional multi-view fusion methods are unable to simultaneously account for both inter-view consistency and intra-view diversity, thus constraining model performance. In this paper, we propose a multi-view block-wise graph convolutional network that effectively addresses the challenges posed by large-scale graphs while exploiting the complementary nature of multi-view information. Specifically, we implement a node segmentation module to partition nodes into view-specific subsets, thereby diminishing computational complexity while preserving local structural information. To enhance feature extraction, plentiful subgraph representations are captured within blocks by alternating graph convolution with graph structure learning under a shared-weight strategy. Finally, the global fusion module introduces a cross-view inter-block loss that progressively aligns block representations across views, alleviates over-smoothing, and yields a consistent and comprehensive common representation. Extensive experiments on diverse large-scale graph datasets demonstrate that the proposed method not only outperforms state-of-the-art approaches in multi-view semi-supervised classification but also exhibits superior scalability and memory efficiency.