Deep Graph Convolutional Network Research Articles

SkipNode: On Alleviating Performance Degradation for Deep Graph Convolutional Networks

SkipNode: On Alleviating Performance Degradation for Deep Graph Convolutional Networks

Intelligent fault diagnosis of hoisting systems under complex working conditions using deep graph convolutional generative adversarial networks with limited data

Owing to the difficulty of collecting adequate fault data from hoisting systems under complex working conditions, data-driven diagnostic methods suffer from decreased accuracy due to inadequate fault information. To deal with this problem, we introduce an intelligent few-shot fault diagnosis approach using a deep graph convolutional generative adversarial networks (DGCGANs) algorithm. The goal of the proposed method is to acquire a more comprehensive few-shot fault feature information, thus facilitating the generation and augmentation of scarce data. Results of two cases including laboratory and real-world industrial datasets demonstrate the viability and efficacy of our approach for diagnosing few-shot faults. Specifically, the proposed DGCGAN method outperforms existing advanced diagnostics, thereby offering superior accuracy in identifying hoisting system faults with limited data. Finally, the practicality and adaptability of the proposed DGCGAN-based fault diagnosis method are further substantiated through comprehensive ablation studies.

Pipe Failure Prediction in the Water Distribution System Using a Deep Graph Convolutional Network and Temporal Failure Series

Pipe Failure Prediction in the Water Distribution System Using a Deep Graph Convolutional Network and Temporal Failure Series

Auto-Correlation and Channel Attention Enhanced Deep Graph Convolution Networks for Gait Phase Prediction Based on Multi-IMU System

Gait phase prediction is important in controlling assistive robotic devices such as exoskeletons, where the control unit must differentiate between gait phases to provide the necessary assistance when the user is wearing the exoskeleton. To achieve the objective of precisely identifying the gait phase of users for the accurate control of the exoskeleton, this study proposes Auto-Correlation and Channel Attention enhanced Deep Graph Convolutional Networks (ACCA-DGCN) for gait phase prediction, and a gait phase prediction model based on multiple inertial measurement units (IMUs) and skeleton graph was established, in order to fully utilize the dependency among joints, and enhance accuracy and reliability of gait phase prediction. First, a human lower limb gait data acquisition equipment was developed, and the gait data of human walking were collected. The skeleton graph of the human lower limb was constructed through the natural connection relationship of joints in the human skeleton. After that, the ACCA-DGCN-based gait phase prediction model was constructed by using the gait data of human walking. Auto-Correlation (AC) and Efficient Channel Attention (ECA) were introduced to effectively capture periodic features of gait data and focus on the channels with high contributions to gait phase prediction. Finally, the effect of the window size on the performance of the ACCA-DGCN model was explored, and the proposed algorithm was compared with the other five deep learning algorithms: CNN, RNN, TCN, LSTM, and DGCN. The experimental results show that the average accuracy of gait phase prediction model based on ACCA-DGCN reaches up to 92.26% and 97.21% in user-independent and user-dependent experiments, respectively, which is superior to the other five algorithms. This study provides a new method for gait phase prediction, which is useful for improving the control of exoskeleton robots.

SGG-DGCN: Wind Turbine Anomaly Identification by Using Deep Graph Convolutional Networks with Similarity Graph Generation Strategy

In order to minimize wind turbine failures, fault diagnosis of wind turbines is becoming increasingly important, deep learning methods excel at multivariate monitoring and data modeling, but they are often limited to Euclidean space and struggle to capture the complex coupling between wind turbine sensors. To address this problem, we convert SCADA data into graph data, where sensors act as nodes and their topological connections act as edges, to represent these complex relationships more efficiently. Specifically, a wind turbine anomaly identification method based on deep graph convolutional neural network using similarity graph generation strategy (SGG-DGCN) is proposed. Firstly, a plurality of similarity graphs containing similarity information between nodes are generated by different distance metrics. Then, the generated similarity graphs are fused using the proposed similarity graph generation strategy. Finally, the fused similarity graphs are fed into the DGCN model for anomaly identification. To verify the effectiveness of the proposed SGG-DGCN model, we conducted a large number of experiments. The experimental results show that the proposed SGG-DGCN model has the highest accuracy compared with other models. In addition, the results of ablation experiment also demonstrate that the proposed SGG strategy can effectively improve the accuracy of WT anomaly identification. Conflict of Interest Statement The authors declare no conflicts of interest.

WSSGCN: Wide Sub-stage Graph Convolutional Networks

Graph Convolutional Networks (GCNs) have emerged as a potent tool for learning graph representations, finding applications in a plethora of real-world scenarios. Nevertheless, a significant portion of deep learning research has predominantly concentrated on enhancing model performance via the construction of deeper GCNs. Regrettably, the efficacy of training deep GCNs is marred by two fundamental weaknesses: the inadequacy of conventional methodologies in handling heterogeneous networks, and the exponential surge in model complexity as network depth increases. This, in turn, imposes constraints on their practical utility. To surmount these inherent limitations, we propose an innovative approach named the Wide Sub-stage Graph Convolutional Network (WSSGCN). Our method is an outcome of meticulous observations drawn from classical and graph convolutional networks, aimed at rectifying the constraints associated with traditional GCNs. Our strategy involves the conception of a staged convolutional network framework that mirrors the fundamental tenets of the step-by-step learning process akin to human cognition. This framework prioritizes three distinct forms of consistency: response-based, feature-based, and relationship-based. Our approach involves three tailored convolutional networks capturing node/edge, subgraph, and global features. Additionally, we introduce a novel method to expand graph width for efficient GCN training. Empirical validation on benchmarks highlights WSSGCN’s superior accuracy and faster training versus conventional GCNs. WSSGCN triumphs over traditional GCN constraints, significantly enhancing graph representation learning.

Large-scale prediction of collision cross-section with very deep graph convolutional network for small molecule identification

Ion mobility spectrometry (IMS) is a promising analytical technique for mass spectrometry (MS)-based compound identification by providing collision cross-section (CCS) value as an additional dimension with structural information. Here, GraphCCS was proposed to accurately predict the CCS value and expand the coverage of CCS libraries. A new adduct encoding method was proposed to encode SMILES strings and adduct types of compounds into adduct graphs. GraphCCS extended its predictive capability to ten different adduct types. A very deep graph convolutional network with up to 40 GCN layers was built to predict CCS values from adduct graphs. A curated dataset with 12,775 experimental CCS values was used to train, validate, and test the GraphCCS model. The resulting CCS predictions achieved a median relative error (MedRE) of 0.94 % and a coefficient of determination (R2) of 0.994 on the test set. Results on external test sets showed that GraphCCS outperformed AllCCS2, CCSbase, SigmaCCS, and DeepCCS. Based on the developed GraphCCS method, a large-scale in-silico database was built, including 2,394,468 CCS values. Those CCS values can be used to filter false positives complementary to retention times and tandem mass spectra. Finally, the effectiveness of GraphCCS in assisting compound identification was tested on a mouse adrenal gland lipid dataset with 1,960 lipids. The results demonstrated that the in-silico CCS values combined with MS spectra and retention times can efficiently filter the false positive candidates.

Node-Smoothness-Based Adaptive Initial Residual Deep Graph Convolutional Network

Node-Smoothness-Based Adaptive Initial Residual Deep Graph Convolutional Network

An Automatic Lie Detection Model Using EEG Signals Based on the Combination of Type 2 Fuzzy Sets and Deep Graph Convolutional Networks.

In recent decades, many different governmental and nongovernmental organizations have used lie detection for various purposes, including ensuring the honesty of criminal confessions. As a result, this diagnosis is evaluated with a polygraph machine. However, the polygraph instrument has limitations and needs to be more reliable. This study introduces a new model for detecting lies using electroencephalogram (EEG) signals. An EEG database of 20 study participants was created to accomplish this goal. This study also used a six-layer graph convolutional network and type 2 fuzzy (TF-2) sets for feature selection/extraction and automatic classification. The classification results show that the proposed deep model effectively distinguishes between truths and lies. As a result, even in a noisy environment (SNR = 0 dB), the classification accuracy remains above 90%. The proposed strategy outperforms current research and algorithms. Its superior performance makes it suitable for a wide range of practical applications.

Deep graph layer information mining convolutional network

Graph convolution network is a powerful method of deep learning of graph structure data. Existing methods usually adjust the neighborhood information aggregation mode or optimize the graph topology layer by layer for improving the graph convolution network. However, these methods seldom consider the discriminative information about hierarchical characteristics nodes (some special nodes only can be correctly classified in one layer and are the misclassification nodes in the other layers of deep graph convolutional networks) in the different layers for complementing the neighborhood topology information. To further find these information, a deep graph layer information mining convolutional network (GLIM) can alternately measure the neighborhood ranking information on topology structure and update the residual identity mapping node information on the different layers for enhancing the model classification performance. Moreover, GLIM can construct a unified framework with the various hyper-parameters for the different graph learning method based on graph convolution network. Experiments show GLIM outperforms the state-of-the-art methods for semi-supervised node classification in three cite datasets (Cora, CiteSeer,and PubMed) and three image datasets (MNIST, Cifar10 and Cifar100).

Spatiotemporal smoothing aggregation enhanced multi-scale residual deep graph convolutional networks for skeleton-based gait recognition

Spatiotemporal smoothing aggregation enhanced multi-scale residual deep graph convolutional networks for skeleton-based gait recognition

DeepGCN based on variable multi‐graph and multimodal data for ASD diagnosis

AbstractDiagnosing individuals with autism spectrum disorder (ASD) accurately faces great challenges in clinical practice, primarily due to the data's high heterogeneity and limited sample size. To tackle this issue, the authors constructed a deep graph convolutional network (GCN) based on variable multi‐graph and multimodal data (VMM‐DGCN) for ASD diagnosis. Firstly, the functional connectivity matrix was constructed to extract primary features. Then, the authors constructed a variable multi‐graph construction strategy to capture the multi‐scale feature representations of each subject by utilising convolutional filters with varying kernel sizes. Furthermore, the authors brought the non‐imaging information into the feature representation at each scale and constructed multiple population graphs based on multimodal data by fully considering the correlation between subjects. After extracting the deeper features of population graphs using the deep GCN(DeepGCN), the authors fused the node features of multiple subgraphs to perform node classification tasks for typical control and ASD patients. The proposed algorithm was evaluated on the Autism Brain Imaging Data Exchange I (ABIDE I) dataset, achieving an accuracy of 91.62% and an area under the curve value of 95.74%. These results demonstrated its outstanding performance compared to other ASD diagnostic algorithms.

Heterogeneous text graph for comprehensive multilingual sentiment analysis: capturing short- and long-distance semantics.

Multilingual sentiment analysis (MSA) involves the task of comprehending people's opinions, sentiments, and emotions in multilingual written texts. This task has garnered considerable attention due to its importance in extracting insights for decision-making across diverse fields such as marketing, finance, and politics. Several studies have explored MSA using deep learning methods. Nonetheless, a majority of these studies depend on sequential-based approaches, which focus on capturing short-distance semantics within adjacent word sequences, but they overlook long-distance semantics, which can provide more profound insights for analysis. In this work, we propose an approach for multilingual sentiment analysis, namely MSA-GCN, leveraging a graph convolutional network to effectively capture both short- and long-distance semantics. MSA-GCN involves the comprehensive modeling of the multilingual sentiment analysis corpus through a unified heterogeneous text graph. Subsequently, a slightly deep graph convolutional network is employed to acquire predictive representations for all nodes by encouraging the transfer learning across languages. Extensive experiments are carried out on various language combinations using different benchmark datasets to assess the efficiency of the proposed approach. These datasets include Multilingual Amazon Reviews Corpus (MARC), Internet Movie Database (IMDB), Allociné, and Muchocine. The achieved results reveal that MSA-GCN significantly outperformed all baseline models in almost all datasets with a p-value < 0.05 based on student t-test. In addition, such approach shows prominent results in a variety of language combinations, revealing the robustness of the approach against language variation.

A Very Deep Graph Convolutional Network for 13C NMR Chemical Shift Calculations with Density Functional Theory Level Performance for Structure Assignment.

Nuclear magnetic resonance (NMR) chemical shift calculations are powerful tools for structure elucidation and have been extensively employed in both natural product and synthetic chemistry. However, density functional theory (DFT) NMR chemical shift calculations are usually time-consuming, while fast data-driven methods often lack reliability, making it challenging to apply them to computationally intensive tasks with a high requirement on quality. Herein, we have constructed a 54-layer-deep graph convolutional network for 13C NMR chemical shift calculations, which achieved high accuracy with low time-cost and performed competitively with DFT NMR chemical shift calculations on structure assignment benchmarks. Our model utilizes a semiempirical method, GFN2-xTB, and is compatible with a broad variety of organic systems, including those composed of hundreds of atoms or elements ranging from H to Rn. We used this model to resolve the controversial J/K ring junction problem of maitotoxin, which is the largest whole molecule assigned by NMR calculations to date. This model has been developed into user-friendly software, providing a useful tool for routine rapid structure validation and assignation as well as a new approach to elucidate the large structures that were previously unsuitable for NMR calculations.

Separable Deep Graph Convolutional Network Integrated With CNN and Prototype Learning for Hyperspectral Image Classification

Separable Deep Graph Convolutional Network Integrated With CNN and Prototype Learning for Hyperspectral Image Classification

The Role and Impact of Social Media Data Analysis in Art Event Planning

Abstract The proliferation of rich social data sources in the big data era offers a valuable opportunity for studying the planning of art events. In this study, we harvested data on art activity planning from social media via microblogging API calls, converting and analyzing this data through a novel methodological framework. Specifically, we employed the Sentiment-Enhanced Deep Graph Convolutional Network (SEDGCN) model to extract and identify sentiment features associated with art activity planning from social media datasets. Sentiments were categorized using the softmax function. Subsequently, our analysis integrated these findings into the art activity planning process. By conducting a correlation analysis between positive and negative sentiments on social media and various elements of art activity planning, we found a significant correlation (p &lt; 0.005) with all six examined elements of art planning. Furthermore, an effectiveness analysis conducted post-implementation of the planned art events revealed predominantly positive emotional responses among attendees. Notably, 325 art professionals reported a sense of healing as a result of their participation. The methodology proposed in this paper for analyzing social media data effectively captures audience emotions, thereby assisting planners in crafting art events that resonate with and fulfill the emotional needs of the audience.

Graph Convolutional Network With Connectivity Uncertainty for EEG-Based Emotion Recognition.

Automatic emotion recognition based on multichannel Electroencephalography (EEG) holds great potential in advancing human-computer interaction. However, several significant challenges persist in existing research on algorithmic emotion recognition. These challenges include the need for a robust model to effectively learn discriminative node attributes over long paths, the exploration of ambiguous topological information in EEG channels and effective frequency bands, and the mapping between intrinsic data qualities and provided labels. To address these challenges, this study introduces the distribution-based uncertainty method to represent spatial dependencies and temporal-spectral relativeness in EEG signals based on Graph Convolutional Network (GCN) architecture that adaptively assigns weights to functional aggregate node features, enabling effective long-path capturing while mitigating over-smoothing phenomena. Moreover, the graph mixup technique is employed to enhance latent connected edges and mitigate noisy label issues. Furthermore, we integrate the uncertainty learning method with deep GCN weights in a one-way learning fashion, termed Connectivity Uncertainty GCN (CU-GCN). We evaluate our approach on two widely used datasets, namely SEED and SEEDIV, for emotion recognition tasks. The experimental results demonstrate the superiority of our methodology over previous methods, yielding positive and significant improvements. Ablation studies confirm the substantial contributions of each component to the overall performance.

From Cluster Assumption to Graph Convolution: Graph-Based Semi-Supervised Learning Revisited.

Graph-based semi-supervised learning (GSSL) has long been a research focus. Traditional methods are generally shallow learners, based on the cluster assumption. Recently, graph convolutional networks (GCNs) have become the predominant techniques for their promising performance. However, a critical question remains largely unanswered: why do deep GCNs encounter the oversmoothing problem, while traditional shallow GSSL methods do not, despite both progressing through the graph in a similar iterative manner? In this article, we theoretically discuss the relationship between these two types of methods in a unified optimization framework. One of the most intriguing findings is that, unlike traditional ones, typical GCNs may not effectively incorporate both graph structure and label information at each layer. Motivated by this, we propose three simple but powerful graph convolution methods. The first, optimized simple graph convolution (), is a supervised method, which guides the graph convolution process with labels. The others are two "no-learning" unsupervised methods: graph structure preserving graph convolution () and its multiscale version GGCM, both aiming to preserve the graph structure information during the convolution process. Finally, we conduct extensive experiments to show the effectiveness of our methods.

Structure-Aware DropEdge Toward Deep Graph Convolutional Networks.

It has been discovered that graph convolutional networks (GCNs) encounter a remarkable drop in performance when multiple layers are piled up. The main factor that accounts for why deep GCNs fail lies in oversmoothing, which isolates the network output from the input with the increase of network depth, weakening expressivity and trainability. In this article, we start by investigating refined measures upon DropEdge-an existing simple yet effective technique to relieve oversmoothing. We term our method as DropEdge ++ for its two structure-aware samplers in contrast to DropEdge: layer-dependent (LD) sampler and feature-dependent (FD) sampler. Regarding the LD sampler, we interestingly find that increasingly sampling edges from the bottom layer yields superior performance than the decreasing counterpart as well as DropEdge. We theoretically reveal this phenomenon with mean-edge-number (MEN), a metric closely related to oversmoothing. For the FD sampler, we associate the edge sampling probability with the feature similarity of node pairs and prove that it further correlates the convergence subspace of the output layer with the input features. Extensive experiments on several node classification benchmarks, including both full-and semi-supervised tasks, illustrate the efficacy of DropEdge ++ and its compatibility with a variety of backbones by achieving generally better performance over DropEdge and the no-drop version.

Intelligent Compound Fault Diagnosis of Roller Bearings Based on Deep Graph Convolutional Network.

The high correlation between rolling bearing composite faults and single fault samples is prone to misclassification. Therefore, this paper proposes a rolling bearing composite fault diagnosis method based on a deep graph convolutional network. First, the acquired raw vibration signals are pre-processed and divided into sub-samples. Secondly, a number of sub-samples in different health states are constructed as graph-structured data, divided into a training set and a test set. Finally, the training set is used as input to a deep graph convolutional neural network (DGCN) model, which is trained to determine the optimal structure and parameters of the network. A test set verifies the feasibility and effectiveness of the network. The experimental result shows that the DGCN can effectively identify compound faults in rolling bearings, which provides a new approach for the identification of compound faults in bearings.