Graph Neural Networks Research Articles

Dual Graph Neural Networks for Dynamic Users’ Behavior Prediction on Social Networking Services

Dual Graph Neural Networks for Dynamic Users’ Behavior Prediction on Social Networking Services

Research on Graph Multi-Attention Neural Network for Power System Transient Stability Assessment

Abstract Diagnosing the stability of power grids based on artificial intelligence technology is a research trend. The existing artificial intelligence stability analysis methods rely on a large number of fault case data, while the graph neural network method ignores the correlation characteristics of nodes themselves and the correlation of long-distance nodes. In order to solve the problems, the graph multi-attention neural network (GMANN) was proposed. The self-attention, which characterizes the correlation between different state quantities of a single node, is proposed, firstly. Then, long-distance association attention, which represents the correlation of distant nodes in the power grid, was proposed. The long-distance correlation attention and the adjacent correlation attention in graph attention network are fused to form a global attention that reflects the global importance of the power grid. The channel attention that characterizes the importance of different pooling methods of graph convolutional network is extracted and used to obtain the importance of different convolution operations. Finally, based on the multi-source attention fusion strategy, global attention and channel attention are embedded in the graph attention neural network to form a multi-level evaluation model to achieve power grid stability evaluation efficiently guided by multiple attentions. The proposed GMANN is verified based on simulated fault cases obtained from the 10-machine 39-node system in New England. The results show that the accuracy of the GMANN can reach 97.34%, which is better than other methods. And the missed judgment rate of important indicators is significantly better than other methods.

A dynamic electric fence planning framework for dockless bike-sharing systems based on inventory prediction

While dockless bike-sharing systems are growing in popularity due to their convenience, indiscriminate parking creates disorder in cities. To address this problem, this paper proposes a novel prediction-based approach for planning dynamic electric fences. These fences can adapt to dynamic usage patterns and efficiently guide parking behavior. First, graded clustering and spatial point integration algorithms are used to determine the locations of electric fence candidates. Second, initial parking and scheduling simulations are developed to calculate the inventory of each candidate. Finally, a spatiotemporal graph neural network is utilized to predict inventory and generate real-time deployment plans for electric fences. Case studies are conducted in two regions in Shanghai, China. Compared to a non-electric fence scenario, extensive experiments show that our framework can satisfy 98.6% of the parking demand and reduce spatial entropy by 15% within a reasonable walking distance. The results contribute to improving urban orderliness and promoting the sustainability of bike-sharing systems.

Enhancing Worker Recruitment in Collaborative Mobile Crowdsourcing: A Graph Neural Network Trust Evaluation Approach

Enhancing Worker Recruitment in Collaborative Mobile Crowdsourcing: A Graph Neural Network Trust Evaluation Approach

FairAGG: Toward Fair Graph Neural Networks via Fair Aggregation

FairAGG: Toward Fair Graph Neural Networks via Fair Aggregation

An efficient water quality index forecasting and categorization using optimized Deep Capsule Crystal Edge Graph neural network.

The world's freshwater supply, predominantly sourced from rivers, faces significant contamination from various economic activities, confirming that the quality of river water is critical for public health, environmental sustainability, and effective pollution control. This research addresses the urgent need for accurate and reliable water quality monitoring by introducing a novel method for estimating the water quality index (WQI). The proposed approach combines cutting-edge optimization techniques with Deep Capsule Crystal Edge Graph neural networks, marking a significant advancement in the field. The innovation lies in the integration of a Hybrid Crested Porcupine Genghis Khan Shark Optimization Algorithm for precise feature selection, ensuring that the most relevant indicators of water quality (WQ) are utilized. Furthermore, the use of the Greylag Goose Optimization Algorithm to fine-tune the neural network's weight parameters enhances the model's predictive accuracy. This dual optimization framework significantly improves WQI prediction, achieving a remarkable mean squared error (MSE) of 6.7 and an accuracy of 99%. By providing a robust and highly accurate method for WQ assessment, this research offers a powerful tool for environmental authorities to proactively manage river WQ, prevent pollution, and evaluate the success of restoration efforts. PRACTITIONER POINTS: Novel method combines optimization and Deep Capsule Crystal Edge Graph for WQI estimation. Preprocessing includes data cleanup and feature selection using advanced algorithms. Deep Capsule Crystal Edge Graph neural network predicts WQI with high accuracy. Greylag Goose Optimization fine-tunes network parameters for precise forecasts. Proposed method achieves low MSE of 6.7 and high accuracy of 99%.

Disentangled traffic forecasting via efficient graph neural network

Abstract Traffic prediction is important to intelligent transportation systems, but it poses significant challenges due to the complex spatio-temporal correlation of traffic data. To address these challenges, we decompose complex traffic time series into events and trends using discrete wavelet transform. However, the high-frequency information decomposed by wavelet transform contains noise, so we designed a module to denoise the high-frequency events. We model the spatio-temporal correlations of trends and events separately using two mutually independent spatio-temporal networks. We use causal dilation convolution with local receptive fields and attention with global receptive fields to capture the correlation of fluctuating time series and the correlation of stable time series, respectively. We capture spatial correlation using a GNN optimized by an attention mechanism. Finally, we merge useful information from volatile events into predictable trends using adaptive event fusion. Our model significantly outperforms nine existing traffic prediction methods across four real datasets.

The influence maximization algorithm for integrating attribute graph clustering and heterogeneous graph transformer

In social networks, maximizing influence is an important research direction. However, traditional influence maximization algorithms often overlook the attribute information of nodes and the heterogeneity of networks, leading to inefficiency and inaccuracy in the propagation process. To address this issue, this study first constructs a social network influence maximization propagation model, and then combines auto-encoder and graph convolutional autoencoder to extract social network user attributes. Finally, Transformer is used to learn the feature representation of social network nodes. Moreover, a heterogeneous graph neural network is introduced to combine with Transformer to further learn the feature representation of nodes, so as to design an influence maximization algorithm combining attributed graph clustering and heterogeneous graph Transformer. The results showed that the loss values of the fusion algorithm on different datasets were 0.619 and 0.17, respectively, proving its good fitting performance. The recall rate and F1 of this fusion algorithm were 92.5 % and 0.90, respectively, proving its high clustering accuracy. The influence maximization model based on fusion algorithm achieved active node coverage of 67 % and 48 % on two datasets, respectively, proving its good influence propagation effect. The above results demonstrate that the designed model can effectively spread influence. This helps to better understand and utilize the influence dissemination mechanisms in social networks, thereby promoting the development of social network research.

AGNN: Alternating Graph-Regularized Neural Networks to Alleviate Over-Smoothing.

Graph convolutional network (GCN) with the powerful capacity to explore graph-structural data has gained noticeable success in recent years. Nonetheless, most of the existing GCN-based models suffer from the notorious over-smoothing issue, owing to which shallow networks are extensively adopted. This may be problematic for complex graph datasets because a deeper GCN should be beneficial to propagating information across remote neighbors. Recent works have devoted effort to addressing over-smoothing problems, including establishing residual connection structure or fusing predictions from multilayer models. Because of the indistinguishable embeddings from deep layers, it is reasonable to generate more reliable predictions before conducting the combination of outputs from various layers. In light of this, we propose an alternating graph-regularized neural network (AGNN) composed of graph convolutional layer (GCL) and graph embedding layer (GEL). GEL is derived from the graph-regularized optimization containing Laplacian embedding term, which can alleviate the over-smoothing problem by periodic projection from the low-order feature space onto the high-order space. With more distinguishable features of distinct layers, an improved Adaboost strategy is utilized to aggregate outputs from each layer, which explores integrated embeddings of multi-hop neighbors. The proposed model is evaluated via a large number of experiments including performance comparison with some multilayer or multi-order graph neural networks, which reveals the superior performance improvement of AGNN compared with the state-of-the-art models.

Powerful graph neural network for node classification of the IoT network

Powerful graph neural network for node classification of the IoT network

HGNN: A Hybrid Graph Neural Network Based on Transfer Learning for Linguistic Steganalysis

Steganography, especially in the form of text generation based on secret messages, has become a current research topic. It is more difficult to identify the hidden message when it embedded directly into the text without using a cover text, and it also has a higher embedding capacity. Owing to the high rate of imperceptibility and resistance to steganalysis of this type steganography, it is essential that steganalysis methods, generate better performance. Although the complexity of deep learning models increases the accuracy rate, it also increases the inference time. In this study, a linguistic steganalysis was performed with a lower inference time and a higher accuracy rate. In the developed model, first, differences between non-stega and steganographic texts were modelled by a finetuned Bert using the custom dataset. The disparity information obtained by fine-tuned model was distilled into 3 separate networks, BertGCN, BertGAT and BertGIN, for faster and more accurate inference. Then, these 3 distilled networks were combined through Transfer Learning to form a new model. Experiments demonstrates that the proposed model surpass other methods in terms of the accuracy (a success of 0.9879 at 3.22 bpw on text encoded through SAAC Encoding) and the effectiveness of inference (1.09 second).

Technology Focus: Offshore Drilling and Completion (October 2024)

The evolution of computational technology, coupled with the ability to digitize hardware and engage with end users, has enabled machine learning to enhance operational efficiency, safety, and cost-effectiveness in offshore oil and gas development. A key takeaway from recent literature is that, while automation tools have been present for years, their widespread adoption has been hindered by a lack of demonstrable financial benefits. To address this, the focus has shifted from mere deployment to achieving real value through significant cost savings, increased safety, and improved operational efficiencies (paper OTC 35137). Automation efforts in onshore operations prioritize efficiency, while offshore automation must focus on risk reduction and minimizing nonproductive time. For instance, a cutting-edge vessel-motion-prediction tool integrates advanced machine-learning techniques with metocean forecasts to enhance the reliability and safety of offshore drilling operations (paper OTC 35341). Paper OTC 35418 presents the importance of autonomous inflow-control devices in maximizing the production life of wells in deepwater West Africa, taking into account the various challenging reservoir conditions. Another critical insight from the research is the role of human intervention in the deployment of automation systems. Successful deployment requires iterative adjustments and feedback from operators to tailor systems to the specific needs of offshore environments. Collaboration among engineers, operators, and decision-makers is essential in refining these technologies to align them with operational goals and safety standards. Overall, these papers underscore the need for strategic adaptation of automation systems to the specific challenges of offshore environments. The success of predictive machine learning in this context depends on its ability to offer measurable financial benefits, improve safety, and drive operational efficiency. Recommended additional reading at OnePetro: www.onepetro.org. SPE 218473 Performance Optimization of Water-Injection Wells Using Autonomous Outflow Control Device Technology in Offshore Norway by G.F. Kvilaas, AkerBP, et al. SPE 218479 Use of Wired Drill Pipe, Along-String Measurements, and Advanced Logging-While-Drilling Imaging Enhances Wellbore-Condition Understanding and Improves Well Delivery Time, While Telemetry-Optimized Ultradeep Resistivity Measurements Enable Precise Geological Well Placement by Stephen Pink, NOV, et al. SPE 218360 Autonomous Restriction Navigation Through Wellbore in Wireline and Slickline Operations by S. DiPasquale, SLB, et al. OTC 35394 Intelligent Optimization of Ultradeepwater Oil-Transmission Risers Using an Enhanced Graph Neural Network by Hong Zhu, China University of Petroleum-Beijing, et al.

Transparent sparse graph pathway network for analyzing the internal relationship of lung cancer.

While it is important to find the key biomarkers and improve the accuracy of disease models, it is equally important to understand their interaction relationships. In this study, a transparent sparse graph pathway network (TSGPN) is proposed based on the structure of graph neural networks. This network simulates the action of genes in vivo, adds to prior knowledge, and improves the model's accuracy. First, the graph connection was constructed according to protein-protein interaction networks and competing endogenous RNA (ceRNA) networks, from which some noise or unimportant connections were spontaneously removed based on the graph attention mechanism and hard concrete estimation. This realized the reconstruction of the ceRNA network representing the influence of other genes in the disease on mRNA. Next, the gene-based interpretation was transformed into a pathway-based interpretation based on the pathway database, and the hidden layer was added to realize the high-dimensional analysis of the pathway. Finally, the experimental results showed that the proposed TSGPN method is superior to other comparison methods in F1 score and AUC, and more importantly, it can effectively display the role of genes. Through data analysis applied to lung cancer prognosis, ten pathways related to LUSC prognosis were found, as well as the key biomarkers closely related to these pathways, such as HOXA10, hsa-mir-182, and LINC02544. The relationship between them was also reconstructed to better explain the internal mechanism of the disease.

Spatio-Temporal Graph Neural Networks for Predictive Learning in Urban Computing: A Survey

Spatio-Temporal Graph Neural Networks for Predictive Learning in Urban Computing: A Survey

A Signed Subgraph Encoding Approach via Linear Optimization for Link Sign Prediction.

In this article, we consider the problem of inferring the sign of a link based on known sign data in signed networks. Regarding this link sign prediction problem, signed directed graph neural networks (SDGNNs) provides the best prediction performance currently to the best of our knowledge. In this article, we propose a different link sign prediction architecture called subgraph encoding via linear optimization (SELO), which obtains overall leading prediction performances compared to the state-of-the-art algorithm SDGNN. The proposed model utilizes a subgraph encoding approach to learn edge embeddings for signed directed networks. In particular, a signed subgraph encoding approach is introduced to embed each subgraph into a likelihood matrix instead of the adjacency matrix through a linear optimization (LO) method. Comprehensive experiments are conducted on five real-world signed networks with area under curve (AUC), F1, micro-F1, and macro-F1 as the evaluation metrics. The experiment results show that the proposed SELO model outperforms existing baseline feature-based methods and embedding-based methods on all the five real-world networks and in all the four evaluation metrics.

Application of a single-cell-RNA-based biological-inspired graph neural network in diagnosis of primary liver tumors

Single-cell technology depicts integrated tumor profiles including both tumor cells and tumor microenvironments, which theoretically enables more robust diagnosis than traditional diagnostic standards based on only pathology. However, the inherent challenges of single-cell RNA sequencing (scRNA-seq) data, such as high dimensionality, low signal-to-noise ratio (SNR), sparse and non-Euclidean nature, pose significant obstacles for traditional diagnostic approaches. The diagnostic value of single-cell technology has been largely unexplored despite the potential advantages. Here, we present a graph neural network-based framework tailored for molecular diagnosis of primary liver tumors using scRNA-seq data. Our approach capitalizes on the biological plausibility inherent in the intercellular communication networks within tumor samples. By integrating pathway activation features within cell clusters and modeling unidirectional inter-cellular communication, we achieve robust discrimination between malignant tumors (including hepatocellular carcinoma, HCC, and intrahepatic cholangiocarcinoma, iCCA) and benign tumors (focal nodular hyperplasia, FNH) by scRNA data of all tissue cells and immunocytes only. The efficacy to distinguish iCCA from HCC was further validated on public datasets. Through extending the application of high-throughput scRNA-seq data into diagnosis approaches focusing on integrated tumor microenvironment profiles rather than a few tumor markers, this framework also sheds light on minimal-invasive diagnostic methods based on migrating/circulating immunocytes.

Deploying Graph Neural Networks in Wireless Networks: A Link Stability Viewpoint

Deploying Graph Neural Networks in Wireless Networks: A Link Stability Viewpoint

CGG: Category-aware global graph contrastive learning for session-based recommendation

With the auxiliary role of category information in capturing user interests, employing category information to improve session-based recommendation (SBR) is getting an energetic research point. Recent studies organized the category-aware session as the graph structure and utilized the graph neural network to explore the session interest for SBR. However, existing studies only focused on the category information in the current session and failed to overcome inherent sparsity of session data, which resulted in suboptimal SBR performance. To overcome these deficiencies, we propose a Category-aware Global Graph contrastive learning method, namely CGG, for SBR. To be specific, we firstly construct the category-aware global graph based on global item-item transitions, item-category associations and global category-category transitions, which utilizes more sufficient category information across sessions to learn embeddings of categories and items. Furthermore, we design the hierarchical dual-pattern contrastive learning mechanism to model the information interaction of graphical and sequential patterns of a category-aware session, which overcomes the negative influence of sparse session data by injecting self-supervised signals. Extensive experiments on multiple real-world datasets verify that CGG outperforms seven mainstream SBR methods on different measurements.

IDSV-GCN: Integrating Dual Syntactic Views Graph Convolutional Network for aspect-based sentiment analysis

Aspect-based sentiment analysis (ABSA) aims to predict the sentiment polarity towards given aspects in a sentence. Recent research has highlighted that graph neural networks based on syntactic dependency trees effectively convey rich syntactic information and are suitable for ABSA tasks. Most existing work typically adopt either dependency type or minimum distance between nodes in the original syntactic tree to construct different views. However, existing work overlooks the high-dimensional local feature information in dependency relations, resulting in inadequate exploration of this view. Meanwhile, most work ignores that the minimum distance view and the dependency view can be complementary and integrated in syntactic analysis. Unfortunately, directly adding the two views introduces noise issues, leading to unsatisfactory results after their integration. To address these issues, this paper introduces an integrating dual syntactic views graph convolutional network (IDSV-GCN) model that seamlessly integrates dependency type view and minimum distance view, enabling comprehensive utilization of syntactic structure and information. To better address the computation of weights in the dependency type view, we innovatively propose a fusion attention mechanism. This approach effectively captures both global and local feature information. To more effectively integrate the two views and reduce the impact of noise, we employ a syntactic mask layer to filter out noise in the dependency type view and highlighting important dependency feature information. Then, we construct a minimum distance weight matrix based on the matrix obtained from the dependency type view. Finally, we merge the two matrices and feed them into the GCN to facilitate the model’s learning of syntactic information. Experimental results on three widely-used benchmark datasets demonstrate that our proposed IDSV-GCN model outperforms state-of-the-art methods.

Hierarchical Graph Neural Network: A Lightweight Image Matching Model with Enhanced Message Passing of Local and Global Information in Hierarchical Graph Neural Networks

Graph Neural Networks (GNNs) have gained popularity in image matching methods, proving useful for various computer vision tasks like Structure from Motion (SfM) and 3D reconstruction. A well-known example is SuperGlue. Lightweight variants, such as LightGlue, have been developed with a focus on stacking fewer GNN layers compared to SuperGlue. This paper proposes the h-GNN, a lightweight image matching model, with improvements in the two processing modules, the GNN and matching modules. After image features are detected and described as keypoint nodes of a base graph, the GNN module, which primarily aims at increasing the h-GNN’s depth, creates successive hierarchies of compressed-size graphs from the base graph through a clustering technique termed SC+PCA. SC+PCA combines Principal Component Analysis (PCA) with Spectral Clustering (SC) to enrich nodes with local and global information during graph clustering. A dual non-contrastive clustering loss is used to optimize graph clustering. Additionally, four message-passing mechanisms have been proposed to only update node representations within a graph cluster at the same hierarchical level or to update node representations across graph clusters at different hierarchical levels. The matching module performs iterative pairwise matching on the enriched node representations to obtain a scoring matrix. This matrix comprises scores indicating potential correct matches between the image keypoint nodes. The score matrix is refined with a ‘dustbin’ to further suppress unmatched features. There is a reprojection loss used to optimize keypoint match positions. The Sinkhorn algorithm generates a final partial assignment from the refined score matrix. Experimental results demonstrate the performance of the proposed h-GNN against competing state-of-the-art (SOTA) GNN-based methods on several image matching tasks under homography, estimation, indoor and outdoor camera pose estimation, and 3D reconstruction on multiple datasets. Experiments also demonstrate improved computational memory and runtime, approximately 38.1% and 26.14% lower than SuperGlue, and an average of about 6.8% and 7.1% lower than LightGlue. Future research will explore the effects of integrating more recent simplicial message-passing mechanisms, which concurrently update both node and edge representations, into our proposed model.