Integrated Spatio-Temporal Graph Neural Network for Traffic Forecasting

Graph convolutional neural networks have difficulties in model training takes a lot of time and lack of universality in meta-path design when processing knowledge graphs. To solve these issues, this paper proposes an efficient recommendation algorithm integrating knowledge graphs with graph convolutional networks(EKG-GCN). The algorithm is mainly based on the graph convolution algorithm. Firstly, the relationship between users and entities is standardized and scored, then a new neighborhood aggregation method is proposed. Some nodes in the knowledge graph are set as central nodes. A distance-influence function is set up according to the distance from other nodes to the central node, and the feature extraction of information in the knowledge graph is completed according to the distance-influence function. Finally, the knowledge graph features are used as an auxiliary to complete the recommendation task. In the experiment, three data sets were selected to compare with other advanced models, and it was found that the model is in an advantageous position in terms of training time and recommendation effect, and has a certain degree of universality.

Traffic flow prediction is an important function of intelligent transportation systems. Accurate prediction results facilitate traffic management to issue early congestion warnings so that drivers can avoid congested roads, thus directly reducing the average driving time of vehicles, which means less greenhouse gas emissions. However, traffic flow data has complex spatial and temporal correlations, which makes it challenging to predict traffic flow accurately. A Gated Recurrent Graph Convolutional Attention Network (GRGCAN) for traffic flow prediction is proposed to solve this problem. The model consists of three components with the same structure, each of which contains one temporal feature extractor and one spatial feature extractor. The temporal feature extractor first introduces a gated recurrent unit (GRU) and uses the hidden states of the GRU combined with an attention mechanism to adaptively assign weights to each time step. In the spatial feature extractor, a node attention mechanism is constructed to dynamically assigns weights to each sensor node, and it is fused with the graph convolution operation. In addition, a residual connection is introduced into the network to reduce the loss of features in the deep network. Experimental results of 1-h traffic flow prediction on two real-world datasets (PeMSD4 and PeMSD8) show that the mean absolute percentage error (MAPE) of the GRGCAN model is as low as 15.97% and 12.13%, and the prediction accuracy and computational efficiency are better than the baselines.

We propose a novel automated deep learning framework, namely Automated Spatio-Temporal Dual Graph Convolutional Networks (Auto-STDGCN), for travel time estimation. Specifically, a hierarchical neural architecture search approach is introduced to capture the joint spatio-temporal correlations of intersections and road segments, whose search space is composed of internal and external search space. In the internal search space, spatial graph convolution and temporal convolution operations are adopted to capture the spatio-temporal correlations of the dual graphs. In the external search space, the node-wise and edge-wise graph convolution operations from the internal architecture search are built to capture the interaction patterns between the intersections and road segments. We conduct several experiments on two real-world datasets, and the results demonstrate that Auto-STDGCN is significantly superior to the state-of-art methods.

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.

Integrating vertex and edge features with Graph Convolutional Networks for skeleton-based action recognition

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.

As a current research hotspot, graph convolution networks (GCNs) have provided new opportunities for tree species classification in multi-source remote sensing images. To solve the challenge of limited label information, a new tree species classification model was proposed by using the semi-supervised graph convolution fusion method for hyperspectral images (HSIs) and multispectral images (MSIs). In the model, the graph-based attribute features and pixel-based features are fused to deepen the correlation of multi-source images to improve accuracy. Firstly, the model employs the canonical correlation analysis (CCA) method to maximize the correlation of multi-source images, which explores the relationship between information from various sources further and offers more valuable insights. Secondly, convolution calculations were made to extract features and then map graph node fusion, which not only reduces redundancy features but also enhances compelling features. Finally, the relationship between representative descriptors is captured through the use of hyperedge convolution in the training process, and the dominant features on the graph are fully mined. The tree species are classified through two fusion feature operations, leading to improved classification performance compared to state-of-the-art methods. The fusion strategy can produce a complete classification map of the study areas.

This paper proposes a novel Quantum Spatial Graph Convolutional Neural Network (QSGCNN) model that can directly learn a classification function for graphs of arbitrary sizes. The main idea is to define a new quantum-inspired spatial graph convolution associated with pre-transformed fixed-sized aligned grid structures of graphs, in terms of quantum information propagation between grid vertices of each graph. We show that the proposed QSGCNN model can significantly reduce either the information loss or the notorious tottering problem arising in existing spatially-based Graph Convolutional Network (GCN) models. Experiments on benchmark graph datasets demonstrate the effectiveness of the proposed QSGCNN model.

LightGCAN: A lightweight graph convolutional attention network for user preference modeling and personalized recommendation

Spatiotemporal graph convolution has made significant progress in skeleton-based action recognition in recent years. Most of the existing graph convolution methods take all the joints of the human skeleton as the overall modeling graph, ignoring the differences in the movement patterns of various parts of the human, and cannot well connect the relationship between the different parts of the human skeleton. To capture the unique features of different parts of human skeleton data and the correlation of different parts, we propose two new graph convolution methods: the whole graph convolution network (WGCN) and the part graph convolution network (PGCN). WGCN learns the whole scale skeleton spatiotemporal features according to the movement patterns and physical structure of the human skeleton. PGCN divides the human skeleton graph into several subgraphs to learn the part scale spatiotemporal features. Moreover, we propose an adaptive fusion module that combines the two features for multiple complementary adaptive fusion to obtain more effective skeleton features. By coupling these proposals, we build a whole and part adaptive fusion graph convolution neural network (WPGCN) that outperforms previous state-of-the-art methods on three large-scale datasets: NTU RGB+D 60, NTU RGB+D 120, and Kinetics Skeleton 400.

Traffic flow forecasting is the basis for the dynamic control and application of Intelligent Transport Systems (ITS), which is of great practical importance in reducing road congestion. Accurately predicting traffic flow remains a significant obstacle due to the intricate spatial and temporal dependencies associated with traffic movement. To capture the simultaneous dynamics of traffic flow’s spatiotemporal features, this paper suggests a novel Spatiotemporal Interactive Dynamic Synchronous Graph Convolution Network (STIDSG) for traffic flow forecasting, which is composed of the Interactive Dynamic Graph Convolution Network (IDGCN) and the Spatiotemporal Synchronous Graph Convolution Layer (STSGCL). IDGCN learns and shares features using an interactive learning strategy that is based on Dynamic Graph Convolution (DGCN). By incorporating DGCN into the interactive learning structure, it is possible to learn dynamic spatial features of traffic flow in an interactive manner while also capturing temporal dependencies. STSGCL effectively captures the intricate local and dynamic correlations of traffic flows by designing numerous Spatiotemporal Synchronization Graph Convolution Modules (STSGCM) for different time periods. The results of the experiment demonstrate that the STIDSG model suggested in this paper can proficiently extract the changing spatiotemporal features of the traffic flow and outperforms the commonly used baseline methods for prediction. The results of the experiment demonstrate that the STIDSG model suggested in this paper can proficiently extract the changing spatiotemporal features of the traffic flow and outperforms the commonly used baseline methods for prediction.

Dynamic traffic correlations based spatio-temporal graph convolutional network for urban traffic prediction

We propose in this paper a contextualised graph convolution network over multiple dependency sub-graphs for relation extraction. A novel method to construct multiple sub-graphs using words in shortest dependency path and words linked to entities in the dependency graph is proposed. Graph convolution operation is performed over the resulting multiple sub-graphs to obtain more informative features useful for relation extraction. Our experimental results show that the proposed method achieves superior performance over existing GCN-based models achieving state-of-the-art performance on cross-sentence n-ary relation extraction and SemEval 2010 Task 8 sentence-level relation extraction task. Our model also achieves a comparable performance to the SoTA on the TACRED dataset.

Multi-scale sampling attention graph convolutional networks for skeleton-based action recognition

Boundary graph convolutional network for temporal action detection