Multi-view Graph Research Articles

Multi-view graph contrastive representation learning for bundle recommendation

Bundle recommendation can recommend a collection of associated items that can be consumed together to a user rather than recommending these items separately, making it extremely suitable for some scenarios such as product bundle recommendation and game bundle recommendation. Recent bundle recommendation approaches consider auxiliary data to mitigate sparse user-bundle interactions. However, these approaches obtain the node embeddings directly from the established user-bundle graph and do not explicitly exploit the relationships between users (bundles) when constructing recommendation models. Moreover, bundle recommendation approaches based on graph contrastive learning usually construct contrastive views by randomly discarding nodes (edges) in the graph, while discarding some essential nodes or edges will destroy the structure of the original graph, thereby deteriorating the quality of the learned node embeddings. Aiming at these limitations, we propose a bundle recommendation approach based on multi-view graph contrastive representation learning. First, we present a multi-view modeling method to model the relations between entities as several views from different perspectives. These views serve as inputs of graph neural networks for graph representation learning and provide contrastive views for the contrastive learning tasks. Second, we propose a novel framework for bundle recommendation. This framework obtains the user (bundle) embeddings from different views by performing multi-view graph representation learning and enhances the learned user and bundle embeddings through a two-level contrastive learning strategy. On this basis, the enhanced user (bundle) embeddings are fused for prediction. Finally, we design a joint optimization objective to optimize the model parameters, combining the prediction loss that supports multiple negative samples and the contrastive losses. Experiments on the Netease and Youshu datasets reveal that our approach outperforms the state-of-the-art (SOTA) baselines. Furthermore, the average improvements of Recall@K and NDCG@K of our approach over the SOTA baselines are approximately 3.38% and 2.80% on Netease and 3.94% and 4.84% on Youshu.

Joint Intra-view and Inter-view Enhanced Tensor Low-rank Induced Affinity Graph Learning

Graph-based and tensor-based multi-view clustering have gained popularity in recent years due to their ability to explore the relationship between samples. However, there are still several shortcomings in the current multi-view graph clustering algorithms. (1) Most previous methods only focus on the inter-view correlation, while ignoring the intra-view correlation. (2) They usually use the Tensor Nuclear Norm (TNN) to approximate the rank of tensors. However, while it has the same penalty for different singular values, the model cannot approximate the true rank of tensors well. To solve these problems in a unified way, we propose a new tensor-based multi-view graph clustering method. Specifically, we introduce the Enhanced Tensor Rank (ETR) minimization of intra-view and inter-view in the process of learning the affinity graph of each view. Compared with 10 state-of-the-art methods on 8 real datasets, the experimental results demonstrate the superiority of our method.

Fuzzy Multiview Graph Learning on Sparse Electronic Health Records

Fuzzy Multiview Graph Learning on Sparse Electronic Health Records

Multi-view graph contrastive learning for social recommendation.

With the rapid popularity of online social media, recommendation systems have increasingly harnessed social relations to enhance user-item interactions and mitigate the data sparsity issue. Beyond social connections, the semantic relatedness among items has emerged as a crucial factor in comprehending their inherent connections. In this work, we propose a novel Multi-view Contrastive learning framework for Social Recommendation, named MultiCSR. This framework adaptively incorporates user social networks and item knowledge graphs into modeling users preferences within recommendation systems. To facilitate the alignment of different views, we introduce a dedicated multi-view contrastive learning process that extracts rich information from each view and foster mutual enhancement. Extensive experiments conducted on three real-world datasets demonstrate the effectiveness of our framework over representative recommendation methods. Furthermore, ablation studies offer a deeper understanding of the mechanisms underlying our framework.

Multi-view graph convolutional networks based on multi-source information fusion for mechanical fault diagnosis

Data-driven intelligent diagnosis methods have demonstrated significant success within prognostics and health management systems due to their powerful feature representation and non-linear fitting capabilities. However, most existing methods employ simple fusion strategies and neglecting data structure considerations, which lead to incomplete feature representations for final diagnostic decisions. In this article, we address these limitations by proposing a multiview graph convolutional network [Formula: see text] framework based on multi-source information fusion for fault diagnosis of key components in mechanical equipment. This is achieved through joint research on sample graph and feature graph learning. First, convolution neural networks named the SharedNet module are leveraged to extract multi-source features, and then the deep features are concatenated in a fully connected layer. After that, we construct multi-view initial graphs to combine the correlations between samples and features to mine rich graph topology structure. Then, we redesign the graph learning strategy to further increase the robustness and generalizability of the proposed method. Finally, extensive experimental results on the multi-information datasets show that our proposed [Formula: see text] can not only outperform the state-of-the-art methods of comparison but also extract multi-view graph topology and feature representations for fault diagnosis.

ScMGATGRN: a multiview graph attention network-based method for inferring gene regulatory networks from single-cell transcriptomic data.

The gene regulatory network (GRN) plays a vital role in understanding the structure and dynamics of cellular systems, revealing complex regulatory relationships, and exploring disease mechanisms. Recently, deep learning (DL)-based methods have been proposed to infer GRNs from single-cell transcriptomic data and achieved impressive performance. However, these methods do not fully utilize graph topological information and high-order neighbor information from multiple receptive fields. To overcome those limitations, we propose a novel model based on multiview graph attention network, namely, scMGATGRN, to infer GRNs. scMGATGRN mainly consists of GAT, multiview, and view-level attention mechanism. GAT can extract essential features of the gene regulatory network. The multiview model can simultaneously utilize local feature information and high-order neighbor feature information of nodes in the gene regulatory network. The view-level attention mechanism dynamically adjusts the relative importance of node embedding representations and efficiently aggregates node embedding representations from two views. To verify the effectiveness of scMGATGRN, we compared its performance with 10 methods (five shallow learning algorithms and five state-of-the-art DL-based methods) on seven benchmark single-cell RNA sequencing (scRNA-seq) datasets from five cell lines (two in human and three in mouse) with four different kinds of ground-truth networks. The experimental results not only show that scMGATGRN outperforms competing methods but also demonstrate the potential of this model in inferring GRNs. The code and data of scMGATGRN are made freely available on GitHub (https://github.com/nathanyl/scMGATGRN).

Efficient Multi-View Graph Convolutional Network with Self-Attention for Multi-Class Motor Imagery Decoding.

Research on electroencephalogram-based motor imagery (MI-EEG) can identify the limbs of subjects that generate motor imagination by decoding EEG signals, which is an important issue in the field of brain-computer interface (BCI). Existing deep-learning-based classification methods have not been able to entirely employ the topological information among brain regions, and thus, the classification performance needs further improving. In this paper, we propose a multi-view graph convolutional attention network (MGCANet) with residual learning structure for multi-class MI decoding. Specifically, we design a multi-view graph convolution spatial feature extraction method based on the topological relationship of brain regions to achieve more comprehensive information aggregation. During the modeling, we build an adaptive weight fusion (Awf) module to adaptively merge feature from different brain views to improve classification accuracy. In addition, the self-attention mechanism is introduced for feature selection to expand the receptive field of EEG signals to global dependence and enhance the expression of important features. The proposed model is experimentally evaluated on two public MI datasets and achieved a mean accuracy of 78.26% (BCIC IV 2a dataset) and 73.68% (OpenBMI dataset), which significantly outperforms representative comparative methods in classification accuracy. Comprehensive experiment results verify the effectiveness of our proposed method, which can provide novel perspectives for MI decoding.

A Multi-view Graph Contrastive Learning Framework for Cross-Domain Sequential Recommendation

A Multi-view Graph Contrastive Learning Framework for Cross-Domain Sequential Recommendation

Unsupervised multi-view graph representation learning with dual weight-net

Unsupervised multi-view graph representation learning (UMGRL) aims to capture the complex relationships in the multi-view graph without human annotations, so it has been widely applied in real-world applications. However, existing UMGRL methods still face the issues as follows: (i) Previous UMGRL methods tend to overlook the importance of nodes with different influences and the importance of graphs with different relationships, so that they may lose discriminative information in nodes with large influences and graphs with important relationships. (ii) Previous UMGRL methods generally ignore the heterophilic edges in the multi-view graph to possibly introduce noise from different classes into node representations. To address these issues, we propose a novel bi-level optimization UMGRL framework with dual weight-net. Specifically, the lower-level optimizes the parameters of encoders to obtain node representations of different graphs, while the upper-level optimizes the parameters of the dual weight-net to adaptively and dynamically capture the importance of node level, graph level, and edge level, thus obtaining discriminative fused representations for downstream tasks. Moreover, theoretical analysis demonstrates that the proposed method shows a better generalization ability on downstream tasks, compared to previous UMGRL methods. Extensive experimental results verify the effectiveness of the proposed method on public datasets, in terms of different downstream tasks, compared to numerous comparison methods.

Multi-View Graph Learning for Path-Level Aging-Aware Timing Prediction

As CMOS technology continues to scale down, the aging effect—known as negative bias temperature instability (NBTI)—has become increasingly prominent, gradually emerging as a key factor affecting device reliability. Accurate aging-aware static timing analysis (STA) at the early design phase is critical for establishing appropriate timing margins to ensure circuit reliability throughout the chip lifecycle. However, traditional aging-aware timing analysis methods, typically based on Simulation Program with Integrated Circuit Emphasis (SPICE) simulations or aging-aware timing libraries, struggle to balance prediction accuracy with computational cost. In this paper, we propose a multi-view graph learning framework for path-level aging-aware timing prediction, which combines the strengths of the spatial–temporal Transformer network (STTN) and graph attention network (GAT) models to extract the aging timing features of paths from both timing-sensitive and workload-sensitive perspectives. Experimental results demonstrate that our proposed framework achieves an average MAPE score of 3.96% and reduces the average MAPE by 5.8 times compared to FFNN and 2.2 times compared to PNA, while maintaining acceptable increases in processing time.

A brain structure learning-guided multi-view graph representation learning for brain network analysis.

Resting-state brain networks represent the interconnectivity of different brain regions during rest. Utilizing brain network analysis methods to model these networks can enhance our understanding of how different brain regions collaborate and communicate without explicit external stimuli. However, analyzing resting-state brain networks faces challenges due to high heterogeneity and noise correlation between subjects. This study proposes a brain structure learning-guided multi-view graph representation learning method to address the limitations of current brain network analysis and improve the diagnostic accuracy (ACC) of mental disorders. We first used multiple thresholds to generate different sparse levels of brain networks. Subsequently, we introduced graph pooling to optimize the brain network representation by reducing noise edges and data inconsistency, thereby providing more reliable input for subsequent graph convolutional networks (GCNs). Following this, we designed a multi-view GCN to comprehensively capture the complexity and variability of brain structure. Finally, we employed an attention-based adaptive module to adjust the contributions of different views, facilitating their fusion. Considering that the Smith atlas offers superior characterization of resting-state brain networks, we utilized the Smith atlas to construct the graph network. Experiments on two mental disorder datasets, the Autism Brain Imaging Data Exchange (ABIDE) dataset and the Mexican Cocaine Use Disorders (SUDMEX CONN) dataset, show that our model outperforms the state-of-the-art methods, achieving nearly 75% ACC and 70% area under the receiver operating characteristic curve (AUC) on both datasets. These findings demonstrate that our method of combining multi-view graph learning and brain structure learning can effectively capture crucial structural information in brain networks while facilitating the acquisition of feature information from diverse perspectives, thereby improving the performance of brain network analysis.

Cost-Sensitive Weighted Contrastive Learning Based on Graph Convolutional Networks for Imbalanced Alzheimer's Disease Staging.

Identifying the progression stages of Alzheimer's disease (AD) can be considered as an imbalanced multi-class classification problem in machine learning. It is challenging due to the class imbalance issue and the heterogeneity of the disease. Recently, graph convolutional networks (GCNs) have been successfully applied in AD classification. However, these works did not handle the class imbalance issue in classification. Besides, they ignore the heterogeneity of the disease. To this end, we propose a novel cost-sensitive weighted contrastive learning method based on graph convolutional networks (CSWCL-GCNs) for imbalanced AD staging using resting-state functional magnetic resonance imaging (rs-fMRI). The proposed method is developed on a multi-view graph constructed by the functional connectivity (FC) and high-order functional connectivity (HOFC) features of the subjects. A novel cost-sensitive weighted contrastive learning procedure is proposed to capture discriminative information from the minority classes, encouraging the samples in the minority class to provide adequate supervision. Considering the heterogeneity of the disease, the weights of the negative pairs are introduced into contrastive learning and they are computed based on the distance to class prototypes, which are automatically learned from the training data. Meanwhile, the cost-sensitive mechanism is further introduced into contrastive learning to handle the class imbalance issue. The proposed CSWCL-GCN is evaluated on 720 subjects (including 184 NCs, 40 SMC patients, 208 EMCI patients, 172 LMCI patients and 116 AD patients) from the ADNI (Alzheimer's Disease Neuroimaging Initiative). Experimental results show that the proposed CSWCL-GCN outperforms state-of-the-art methods on the ADNI database.

Auto-weighted multi-view clustering via hierarchical bipartite graph

The expensive time consumption and hyper-parameters are two main drawbacks of most existing multi-view graph clustering methods. Especially in large-scale data clustering, these two defects are more serious. Aiming at these two problems, we propose a novel auto-weighted multi-view clustering method based on the hierarchical bipartite graph to effectively address these two limitations. Similar to the idea of an anchor graph, firstly, the bisecting k-means method is used instead of traditional method to generate a hierarchical anchor points set. And then, the hierarchical bipartite graph can be constructed between the original points and the anchor points of last layer. Since we only consider the anchor points on the last layer rather than using a larger number of anchors to obtain the bipartite graph, our proposed method will greatly reduce the time consumption. Moreover, the automatic learning strategy was adopted to select the appropriate weights for each view in our proposed approach, which remove the weight-related hyper-parameters and effectively avoid the vexing problem of hyper-parameters in multi-view graph clustering. Finally, experiments were carried out on synthetic data and different sizes benchmark data respectively to verify the validity of our method.

Diverse representation-guided graph learning for multi-view metric clustering

Multi-view graph clustering has garnered tremendous interest for its capability to effectively segregate data by harnessing information from multiple graphs representing distinct views. Despite the advances, conventional methods commonly construct similarity graphs straightway from raw features, leading to suboptimal outcomes due to noise or outliers. To address this, latent representation-based graph clustering has emerged. However, it often hypothesizes that multiple views share a fixed-dimensional coefficient matrix, potentially resulting in useful information loss and limited representation capabilities. Additionally, many methods exploit Euclidean distance as a similarity metric, which may inaccurately measure linear relationships between samples. To tackle these challenges, we develop a novel diverse representation-guided graph learning for multi-view metric clustering (DRGMMC). Concretely, raw sample matrix from each view is first projected into diverse latent spaces to capture comprehensive knowledge. Subsequently, a popular metric is leveraged to adaptively learn similarity graphs with linearity-aware based on attained coefficient matrices. Furthermore, a self-weighted fusion strategy and Laplacian rank constraint are introduced to output clustering results directly. Consequently, our model merges diverse representation learning, metric learning, consensus graph learning, and data clustering into a joint model, reinforcing each other for holistic optimization. Substantial experimental findings substantiate that DRGMMC outperforms most advanced graph clustering techniques.

GraphADT: empowering interpretable predictions of acute dermal toxicity with multi-view graph pooling and structure remapping.

Accurate prediction of acute dermal toxicity (ADT) is essential for the safe and effective development of contact drugs. Currently, graph neural networks, a form of deep learning technology, accurately model the structure of compound molecules, enhancing predictions of their ADT. However, many existing methods emphasize atom-level information transfer and overlook crucial data conveyed by molecular bonds and their interrelationships. Additionally, these methods often generate "equal" node representations across the entire graph, failing to accentuate "important" substructures like functional groups, pharmacophores, and toxicophores, thereby reducing interpretability. We introduce a novel model, GraphADT, utilizing structure remapping and multi-view graph pooling (MVPool) technologies to accurately predict compound ADT. Initially, our model applies structure remapping to better delineate bonds, transforming "bonds" into new nodes and "bond-atom-bond" interactions into new edges, thereby reconstructing the compound molecular graph. Subsequently, we use MVPool to amalgamate data from various perspectives, minimizing biases inherent to single-view analyses. Following this, the model generates a robust node ranking collaboratively, emphasizing critical nodes or substructures to enhance model interpretability. Lastly, we apply a graph comparison learning strategy to train both the original and structure remapped molecular graphs, deriving the final molecular representation. Experimental results on public datasets indicate that the GraphADT model outperforms existing state-of-the-art models. The GraphADT model has been demonstrated to effectively predict compound ADT, offering potential guidance for the development of contact drugs and related treatments. Our code and data are accessible at: https://github.com/mxqmxqmxq/GraphADT.git.

MvG-NRLMF: Multi-view graph neighborhood regularized logistic matrix factorization for identifying drug–target interaction

Traditional methods for predicting drug–target interactions (DTIs) have significant room for improvement in terms of time period and monetary overhead. At present, machine learning-based approaches are commonly used in the drug discovery field. In this study, a multi-view graph neighborhood regularized logical matrix factorization (MvG-NRLMF) model was proposed to predict unknown DTIs. Multiple similarity matrices (kernels) were constructed from the space of drugs and targets, the corresponding Laplacian matrices were generated, and these were fused. Finally, the MvG-NRLMF model was adjusted using an alternating gradient ascent procedure for training. On the four benchmark datasets, our method was competitive, and on some datasets, our method even outperformed existing models.

Graph feature fusion driven by deep autoencoder for advanced hyperspectral image unmixing

In this paper, we propose a pioneering approach for blind Hyperspectral Image (HSI) unmixing named Multi-Features Graph Deep Fusion Learning Networks for HSI Unmixing (MF-GDL). Our method leverages the power of multi-feature graph deep fusion learning networks. MF-GDL integrates spectral HSI graph features with complementary spatial graph features, overcoming the fixed window size limitation observed in prior deep learning approaches in capturing spatial relationships effectively. A key contribution lies in the introduction of multi-view graph learning, a novel aspect in HSI unmixing. By incorporating graph similarity-based spatial information, we address an important gap in the existing literature, marking the first attempt, to our knowledge, to tackle this challenge using a graph deep learning method. Furthermore, we introduce auxiliary information based on Extended Morphological Profiles (EMPs) to enrich spatial context beyond high-level spatial relationships between neighboring pixels. This multi-view fusion learning not only improves accuracy in material abundance estimation but also demonstrates the significance of considering multiple perspectives in HSI unmixing. We validate the efficacy of MF-GDL on four real datasets: Jasper Ridge, Samson, Urban, and Apex showcasing its robust performance and highlighting the substantial contribution of the multi-view aspect in advancing HSI unmixing techniques.

Diversity-Induced Bipartite Graph Fusion for Multiview Graph Clustering

Diversity-Induced Bipartite Graph Fusion for Multiview Graph Clustering

Multi-View Graph Embedding Learning for Image Co-Segmentation and Co-Localization

Multi-View Graph Embedding Learning for Image Co-Segmentation and Co-Localization

Sampling clustering based on multi-view attribute structural relations.

In light of the exponential growth in information volume, the significance of graph data has intensified. Graph clustering plays a pivotal role in graph data processing by jointly modeling the graph structure and node attributes. Notably, the practical significance of multi-view graph clustering is heightened due to the presence of diverse relationships within real-world graph data. Nonetheless, prevailing graph clustering techniques, predominantly grounded in deep learning neural networks, face challenges in effectively handling multi-view graph data. These challenges include the incapability to concurrently explore the relationships between multiple view structures and node attributes, as well as difficulties in processing multi-view graph data with varying features. To tackle these issues, this research proposes a straightforward yet effective multi-view graph clustering approach known as SLMGC. This approach uses graph filtering to filter noise, reduces computational complexity by extracting samples based on node importance, enhances clustering representations through graph contrastive regularization, and achieves the final clustering outcomes using a self-training clustering algorithm. Notably, unlike neural network algorithms, this approach avoids the need for intricate parameter settings. Comprehensive experiments validate the supremacy of the SLMGC approach in multi-view graph clustering endeavors when contrasted with prevailing deep neural network techniques.