Exploiting node-feature bipartite graph in graph convolutional networks

Graph convolutional network – Long short term memory neural network- multi layer perceptron- Gaussian progress regression model: A new deep learning model for predicting ozone concertation

Traffic flow prediction plays an important role in intelligent transportation systems and is of great significance in the applications of traffic control and urban planning. Due to the complexity of road traffic flow data, traffic flow prediction has been one of the challenging tasks to fully exploit the spatiotemporal characteristics of roads to improve prediction accuracy. In this study, a combined flow direction level traffic flow prediction graph convolutional network (GCN) and long short-term memory (LSTM) model based on spatiotemporal characteristics is proposed. First, a GCN model is employed to capture the topological structure of the data graph and extract the spatial features of road networks. Additionally, due to the capability to handle long-term dependencies, the long-term memory is used to predict the time series of traffic flow and extract the time features. The proposed model is evaluated using real-world data, which are obtained from the intersection of Liuquan Road and Zhongrun Avenue in the Zibo High-Tech Zone of China. The results show that the developed combined GCN-LSTM flow direction level traffic flow prediction model can perform better than the single models of the LSTM model and GCN model, and the combined ARIMA-LSTM model in traffic flow has a strong spatiotemporal correlation.

Chronic obstructive pulmonary disease (COPD) is a common disease with high morbidity and mortality, where early detection benefits the population. However, the early diagnosis rate of COPD is low due to the absence or slight early symptoms. In this paper, a novel method based on graph convolution network (GCN) for early detection of COPD is proposed, which uses small and weakly labeled chest computed tomography image data from the publicly available Danish Lung Cancer Screening Trial database. The key idea is to construct a graph using regions of interest randomly selected from the segmented lung parenchyma and then input it into the GCN model for COPD detection. In this way, the model can not only extract the feature information of each region of interest but also the topological structure information between regions of interest, that is, graph structure information. The proposed GCN model achieves an acceptable performance with an accuracy of 0.77 and an area under a curve of 0.81, which is higher than the previous studies on the same dataset. GCN model also outperforms several state-of-the-art methods trained at the same time. As far as we know, it is also the first time using the GCN model on this dataset for COPD detection.Graphical abstract

Design of affinity-aware encoding by embedding graph centrality for graph classification

Entity linking, which maps named entity mentions in a document into the proper entities in a given knowledge graph, has been shown to be able to significantly benefit from modeling the entity relatedness through Graph Convolutional Networks (GCN). Nevertheless, existing GCN entity linking models fail to take into account the fact that the structured graph for a set of entities not only depends on the contextual information of the given document but also adaptively changes on different aggregation layers of the GCN, resulting in insufficiency in terms of capturing the structural information among entities. In this paper, we propose a dynamic GCN architecture to effectively cope with this challenge. The graph structure in our model is dynamically computed and modified during training. Through aggregating knowledge from dynamically linked nodes, our GCN model can collectively identify the entity mappings between the document and the knowledge graph, and efficiently capture the topical coherence among various entity mentions in the entire document. Empirical studies on benchmark entity linking data sets confirm the superior performance of our proposed strategy and the benefits of the dynamic graph structure.

Neuroimaging plays an significant role in diagnosing and pathological study of brain diseases. Considering that both functional and structural abnormalities may lead to brain dis-eases and disorders, single modal neuroimaging approach may not fully characterize brain activities and working modes. Fusion of multimodal neuroimaging data is expected to provide more comprehensive characterization of brain diseases, given that the different modalities contain more complementary information. Recently, Graph Convolutional Networks (GCNs) is shown to have powerful capacity in representation learning for graph-structure data, which is considered to integrate both graph se-mantic structure and node information. Therefore, in this paper, we propose the Weighted Graph AutoEncoder (WGAE), a GCN- driven multimodal fusion model, to learn the combinational latent node representation of fMRI and DTI neuroimaging data, which are used as node features and graph structure respectively in the graph in unsupervised manner. Experimental results on two real-world datasets show the superiority of the proposed model over other existing single-modal or multi-modal methods in learning representations for disease prediction as the downstream task. Furthermore, ablation experiments also show the collaborative contribution of multimodal neuroimaging fusion in the proposed model, and also show the feasibility of assessing the respective importance of the two modalities during the disease prediction.

WiFi fingerprinting positioning is one of the main indoor localization methods because of its reliable accuracy and low cost of deployment. The traditional methods conduct the localization by comparing the online RSSI with the fingerprint database using the various distance metrics while ignoring the structure information of fingerprints in the spatial and signal spaces. To tackle the problem, we proposes a graph learning based method with the combination of geographical location and node features. Our graph regards the WIFI fingerprints as graph nodes. Then we uses the semi-supervised graph convolutional neural network to predict the locations of the online the RSSI. After that, the prediction is preprocessed by uses the smoothing prediction with label propagation. Due to the experimental results, the proposed algorithm achieves good positioning results on both the UJIIndoorLoc public dataset and the self-collected museum dataset.

Coronary heart disease (CHD) has become one of the most serious public health issues due to its high morbidity and mortality rates. Most of the existing coronary heart disease risk prediction models manually extract features based on shallow machine learning methods. It only focuses on the differences between local patient features and ignores the interaction modeling between global patients. Its accuracy is still insufficient for individualized patient management strategies. In this paper, we propose CHD prediction as a graph node classification task for the first time, where nodes can represent individuals in potentially diseased populations and graphs intuitively represent associations between populations. We used an adaptive multi-channel graph convolutional neural network (AM-GCN) model to extract graph embeddings from topology, node features, and their combinations through graph convolution. Then, the adaptive importance weights of the extracted embeddings are learned by using an attention mechanism. For different situations, we model the relationship of the CHD population with the population graph and the K-nearest neighbor graph method. Our experimental evaluation explored the impact of the independent components of the model on the CHD disease prediction performance and compared it to different baselines. The experimental results show that our new model exhibits the best experimental results on the CHD dataset, with a 1.3% improvement in accuracy, a 5.1% improvement in AUC, and a 4.6% improvement in F1-score compared to the nongraph model.

Entropy-aware self-training for graph convolutional networks

Skeleton-based action recognition aims to project skeleton sequences to action categories, where skeleton sequences are derived from multiple forms of pre-detected points. Compared with earlier methods that focus on exploring single-form skeletons via Graph Convolutional Networks (GCNs), existing methods tend to improve GCNs by leveraging multi-form skeletons due to their complementary cues. However, these methods (either adapting structure of GCNs or model ensemble) require the co-existence of all forms of skeletons during both training and inference stages, while a typical situation in real life is the existence of only partial forms for inference. To tackle this issue, we present Adaptive Cross-Form Learning (ACFL), which empowers well-designed GCNs to generate complementary representation from single-form skeletons without changing model capacity. Specifically, each GCN model in ACFL not only learns action representation from the single-form skeletons, but also adaptively mimics useful representations derived from other forms of skeletons. In this way, each GCN can learn how to strengthen what has been learned, thus exploiting model potential and facilitating action recognition as well. Extensive experiments conducted on three challenging benchmarks, i.e., NTU-RGB+D 120, NTU-RGB+D 60 and UAV-Human, demonstrate the effectiveness and generalizability of the proposed method. Specifically, the ACFL significantly improves various GCN models (i.e., CTR-GCN, MS-G3D, and Shift-GCN), achieving a new record for skeleton-based action recognition.

The generalization error of graph convolutional networks may enlarge with more layers

Graph, as an important data representation, is ubiquitous in many real world applications ranging from social network analysis to biology. How to correctly and effectively learn and extract information from graph is essential for a large number of machine learning tasks. Graph embedding is a way to transform and encode the data structure in high dimensional and non-euclidean feature space to a low dimensional and structural space, which is easily exploited by other machine learning algorithms. We have witnessed a huge surge of such embedding methods, from statistical approaches to recent deep learning methods such as the graph convolutional networks (GCN). Deep learning approaches usually outperform the traditional methods in most graph learning benchmarks by building an end-to-end learning framework to optimize the loss function directly. However, most of the existing GCN methods can only perform convolution operations with node features, while ignoring the handy information in edge features, such as relations in knowledge graphs. To address this problem, we present CensNet, Convolution with Edge-Node Switching graph neural network, for learning tasks in graph-structured data with both node and edge features. CensNet is a general graph embedding framework, which embeds both nodes and edges to a latent feature space. By using line graph of the original undirected graph, the role of nodes and edges are switched, and two novel graph convolution operations are proposed for feature propagation. Experimental results on real-world academic citation networks and quantum chemistry graphs show that our approach achieves or matches the state-of-the-art performance in four graph learning tasks, including semi-supervised node classification, multi-task graph classification, graph regression, and link prediction.

Graphs are a common and important data structure, and networks such as the Internet and social networks can be represented by graph structures. The proposal of Graph Convolutional Network (GCN) brings graph research into the era of deep learning and has achieved better results than traditional methods on various tasks. For ordinary neural networks, more layers can often achieve better results. However, for GCN, the deepening of the number of layers will cause a catastrophic decline in performance, including the gradual indistinguishability of node features, the disappearance of gradients, and the inability to update weights. This phenomenon is called over-smoothing. The occurrence of over-smoothing makes training deep GCNs a difficult problem. Compared with deep GCNs, shallow GCNs tend to perform better. Therefore, we design a contrastive learning model such that the deep GCN learns the features of the same node (positive samples) of the shallow GCN while alienating the features of other nodes (negative samples) , so that the deep GCN can learn the performance of the shallow GCN. Experiments show that our method can effectively alleviate the over-smoothing phenomenon. At the same time, we apply this model to other over-smoothing methods, and also achieve better results.KeywordsGraph convolutional networkGraph contrastive learningOver-smoothing

A Novel Privacy-Preserving Graph Convolutional Network via Secure Matrix Multiplication

Graph convolutional network (GCN) based approaches have achieved significant progress for solving complex, graph-structured problems. GCNs incorporate the graph structure information and the node (or edge) features through message passing and computes ‘deep’ node representations. Despite significant progress in the field, designing GCN architectures for heterogeneous graphs still remains an open challenge. Due to the schema of a heterogeneous graph, useful information may reside multiple hops away. A key question is how to perform message passing to incorporate information of neighbors multiple hops away while avoiding the well-known over-smoothing problem in GCNs. To address this question, we propose our GCN framework Deep Heterogeneous Graph Convolutional Network (DHGCN), which takes advantage of the schema of a heterogeneous graph and uses a hierarchical approach to effectively utilize information many hops away. It first computes representations of the target nodes based on their schema-derived ego-network (SEN). It then links the nodes of the same type with various pre-defined metapaths and performs message passing along these links to compute final node representations. Our design choices naturally capture the way a heterogeneous graph is generated from the schema. The experimental results on real and synthetic datasets corroborate the design choice and illustrate the performance gains relative to competing alternatives.