Graph Attention Research Articles

SpaGRA: Graph augmentation facilitates domain identification for spatially resolved transcriptomics

Recent advances in spatially resolved transcriptomics (SRT) have provided new opportunities for characterizing spatial structures of various tissues. Graph-based geometric deep learning have gained widespread adoption for spatial domain identification tasks. Currently, most methods define adjacency relation between cells or spots by their spatial distance in SRT data, which overlooks key biological interactions like gene expression similarities, and leads to inaccuracies in spatial domain identification. To tackle this challenge, we propose a novel method, SpaGRA (https://github.com/sunxue-yy/SpaGRA), for automatic multi-relationship construction based on graph augmentation. SpaGRA uses spatial distance as prior knowledge and dynamically adjusts edge weights with multi-head graph attention networks (GATs). This helps SpaGRA to uncover diverse node relationships and enhance message passing in geometric contrastive learning. Additionally, SpaGRA uses these multi-view relationships to construct negative samples, addressing sampling bias posed by random selection. Experimental results show that SpaGRA demonstrates superior domain identification performance on multiple datasets generated from different protocols. Using SpaGRA, we analyzed the functional regions in the mouse hypothalamus, identified key genes related to heart development in mouse embryos, and observed cancer-associated fibroblasts enveloping cancer cells in the latest Visium HD data. Overall, SpaGRA can effectively characterize spatial structures across diverse SRT datasets.

Pair-EGRET: Enhancing the prediction of protein-protein interaction sites through graph attention networks and protein language models.

Proteins are responsible for most biological functions, many of which require the interaction of more than one protein molecule. However, accurately predicting protein-protein interaction (PPI) sites (the interfacial residues of a protein that interact with other protein molecules) remains a challenge. The growing demand and cost associated with the reliable identification of PPI sites using conventional experimental methods call for computational tools for automated prediction and understanding of PPIs. We present Pair-EGRET, an edge-aggregated graph attention network that leverages the features extracted from pre-trained transformer-like models to accurately predict PPI sites. Pair-EGRET works on a k-nearest neighbor graph, representing the three-dimensional structure of a protein, and utilizes the cross-attention mechanism for accurate identification of interfacial residues of a pair of proteins. Through an extensive evaluation study using a diverse array of experimental data, evaluation metrics, and case studies on representative protein sequences, we demonstrate that Pair-EGRET can achieve remarkable performance in predicting PPI sites. Moreover, Pair-EGRET can provide interpretable insights from the learned cross-attention matrix. Pair-EGRET is freely available in open source form at the GitHub Repository https://github.com/1705004/Pair-EGRET. Supplementary data are available at Bioinformatics online.

Relation semantic fusion in subgraph for inductive link prediction in knowledge graphs

Inductive link prediction (ILP) in knowledge graphs (KGs) aims to predict missing links between entities that were not seen during the training phase. Recent some subgraph-based methods have shown some advancements, but they all overlook the relational semantics between entities during subgraph extraction. To overcome this limitation, we introduce a novel inductive link prediction model named SASILP (Structure and Semantic Inductive Link Prediction), which comprehensively incorporates relational semantics in both subgraph extraction and node initialization processes. The model employs a random walk strategy to calculate the structural scores of neighboring nodes and utilizes an enhanced graph attention network to determine their semantic scores. By integrating both structural and semantic scores, SASILP strategically selects key nodes to form a subgraph. Furthermore, the subgraph is initialized with a node initialization technique that integrates information about neighboring relations. The experiments conducted on benchmark datasets demonstrate that SASILP outperforms state-of-the-art methods on inductive link prediction tasks, and verify the effectiveness of our approach.

Exploiting Neighbor Effect: Conv-Agnostic GNN Framework for Graphs With Heterophily.

Due to the homophily assumption in graph convolution networks (GCNs), a common consensus in the graph node classification task is that graph neural networks (GNNs) perform well on homophilic graphs but may fail on heterophilic graphs with many interclass edges. However, the previous interclass edges' perspective and related homo-ratio metrics cannot well explain the GNNs' performance under some heterophilic datasets, which implies that not all the interclass edges are harmful to GNNs. In this work, we propose a new metric based on the von Neumann entropy to reexamine the heterophily problem of GNNs and investigate the feature aggregation of interclass edges from an entire neighbor identifiable perspective. Moreover, we propose a simple yet effective Conv-Agnostic GNN framework (CAGNNs) to enhance the performance of most GNNs on the heterophily datasets by learning the neighbor effect for each node. Specifically, we first decouple the feature of each node into the discriminative feature for downstream tasks and the aggregation feature for graph convolution (GC). Then, we propose a shared mixer module to adaptively evaluate the neighbor effect of each node to incorporate the neighbor information. The proposed framework can be regarded as a plug-in component and is compatible with most GNNs. The experimental results over nine well-known benchmark datasets indicate that our framework can significantly improve performance, especially for the heterophily graphs. The average performance gain is 9.81%, 25.81%, and 20.61% compared with graph isomorphism network (GIN), graph attention network (GAT), and GCN, respectively. Extensive ablation studies and robustness analysis further verify the effectiveness, robustness, and interpretability of our framework. Code is available at https://github.com/JC-202/CAGNN.

MAS-DGAT-Net: A dynamic graph attention network with multibranch feature extraction and staged fusion for EEG emotion recognition

In recent years, with the rise of deep learning technologies, EEG-based emotion recognition has garnered significant attention. However, most existing methods tend to focus on the spatiotemporal information of EEG signals while overlooking the potential topological information of brain regions. To address this issue, this paper proposes a dynamic graph attention network with multi-branch feature extraction and staged fusion (MAS-DGAT-Net), which integrates graph convolutional neural networks (GCN) for EEG emotion recognition. Specifically, the differential entropy (DE) features of EEG signals are first reconstructed into a correlation matrix using the Spearman correlation coefficient. Then, the brain-region connectivity-feature extraction (BCFE) module is employed to capture the brain connectivity features associated with emotional activation states. Meanwhile, this paper introduces a dual-branch cross-fusion feature extraction (CFFE) module, which consists of an attention-based cross-fusion feature extraction branch (A-CFFEB) and a cross-fusion feature extraction branch (CFFEB). A-CFFEB efficiently extracts key channel-frequency information from EEG features by using an attention mechanism and then fuses it with the output features from the BCFE. The fused features are subsequently input into the proposed dynamic graph attention module with a broad learning system (DGAT-BLS) to mine the brain connectivity feature information further. Finally, the deep features output by DGAT-BLS and CFFEB are combined for emotion classification. The proposed algorithm has been experimentally validated on SEED, SEED-IV, and DEAP datasets in subject-dependent and subject-independent settings, with the results confirming the model's effectiveness. The source code is publicly available at: https://github.com/cvmdsp/MAS-DGAT-Net

Comprehensive Graph Gradual Pruning for Sparse Training in Graph Neural Networks.

Graph neural networks (GNNs) tend to suffer from high computation costs due to the exponentially increasing scale of graph data and a large number of model parameters, which restricts their utility in practical applications. To this end, some recent works focus on sparsifying GNNs (including graph structures and model parameters) with the lottery ticket hypothesis (LTH) to reduce inference costs while maintaining performance levels. However, the LTH-based methods suffer from two major drawbacks: 1) they require exhaustive and iterative training of dense models, resulting in an extremely large training computation cost, and 2) they only trim graph structures and model parameters but ignore the node feature dimension, where vast redundancy exists. To overcome the above limitations, we propose a comprehensive graph gradual pruning framework termed CGP. This is achieved by designing a during-training graph pruning paradigm to dynamically prune GNNs within one training process. Unlike LTH-based methods, the proposed CGP approach requires no retraining, which significantly reduces the computation costs. Furthermore, we design a cosparsifying strategy to comprehensively trim all the three core elements of GNNs: graph structures, node features, and model parameters. Next, to refine the pruning operation, we introduce a regrowth process into our CGP framework, to reestablish the pruned but important connections. The proposed CGP is evaluated over a node classification task across six GNN architectures, including shallow models [graph convolutional network (GCN) and graph attention network (GAT)], shallow-but-deep-propagation models [simple graph convolution (SGC) and approximate personalized propagation of neural predictions (APPNP)], and deep models [GCN via initial residual and identity mapping (GCNII) and residual GCN (ResGCN)], on a total of 14 real-world graph datasets, including large-scale graph datasets from the challenging Open Graph Benchmark (OGB). Experiments reveal that the proposed strategy greatly improves both training and inference efficiency while matching or even exceeding the accuracy of the existing methods.

A simulation data-driven semi-supervised framework based on MK-KNN graph and ESSGAT for bearing fault diagnosis

Current supervised intelligent fault diagnosis relies on abundant labeled data. However, collecting and labeling data are typically both expensive and time-consuming. Fault diagnosis with unlabeled data remains a significant challenge. To address this issue, a simulation data-driven semi-supervised framework based on multi-kernel K-nearest neighbor (MK-KNN) and edge self-supervised graph attention network (ESSGAT) is proposed. The novel MK-KNN establishes the neighborhood relationships between simulation data and real data. The developed multi-kernel function mitigates the risks of overfitting and underfitting, thereby enhancing the robustness of the simulation-real graphs. The designed ESSGAT employs two forms of self-supervised attention to predict the presence of edges, increasing the weights of crucial neighboring nodes in the MK-KNN graph. The performance of the proposed method is evaluated using a public bearing dataset and a self-constructed dataset of high-speed train axle box bearings. The results show that the proposed method achieves better diagnostic performance compared with other state-of-the-art graph construction methods and graph convolutional networks.

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.

A geographic-semantic context-aware urban commuting flow prediction model using graph neural network

Urban commuting flow prediction is crucial for urban planning, transportation optimization, and supply chain management. Traditional models and machine learning solutions often fall short in capturing the complex dynamics of urban mobility, overlooking factors like spatial correlation and human mobility patterns. Recent deep learning advancements have shown promise by integrating spatial correlation through incorporating geographical adjacency. However, this approach may not fully capture spatial correlation, particularly the semantic adjacency effect of zones connected via public transportation lines, such as metro networks—a novel dimension overlooked in prior research. The metro station serves as a major transit hub, attracting passengers from various origins and destinations and correlating the flow between the connected zones and other zones within the metro network. Devising an optimized model to encapsulate these spatial correlations is another crucial area of research where scientists are actively seeking the most effective solutions. We propose a novel sequential hybrid approach leveraging graph-based learning, focusing on the underexplored impact of metro networks on commuting flow prediction. Our model integrates two types of adjacency—geographic and semantic—using Graph Convolutional Networks (GCNs) to embed geographic correlations among proximate zones and Graph Attention Networks (GATs) to incorporate semantic adjacency defined by metro line connectivity. Furthermore, our approach innovatively incorporates features directly from online maps, eliminating reliance on third-party resources and enhancing scalability and efficiency. We validate our model using real-world datasets from Montreal, Canada, comprising travel surveys and GPS trajectory types, totaling nearly 900,000 trip records. Through evaluation using established performance metrics such as MAE, RMSE, MAPE, and CPC, we demonstrate significant improvement in predictive accuracy compared to existing state-of-the-art models. Our research has practical implications for urban planning and infrastructure development, aiding policymakers and urban planners in analyzing the impact of new urban infrastructure on commuting flow dynamics and facilitating informed decisions regarding transportation and infrastructure planning.

A hybrid spatiotemporal model combining graph attention network and gated recurrent unit for regional composite air pollution prediction and collaborative control

Machine learning (ML) models have been extensively applied in air quality prediction. However, many of these models often failed to unveil complex mechanisms and regional spatiotemporal variations of composite air pollution. This brings uncertainties in using ML models for effective composite air pollution control. The present study developed a novel hybrid spatiotemporal model framework combining Graph Attention Network (GAT) and Gated Recurrent Unit (GRU), namely the GAT-GRU model, to foresee composite air pollutions with a focus on PM2.5 and O3. By extracting attention matrices for PM2.5O3 composite pollution and applying the Louvain algorithm, the framework established effective community network divisions for coordinated control of PM2.5O3 composite pollution. The framework was applied and tested in China's “2 + 26″ cities, a city cluster with most heavy PM2.5 and O3 pollution and precursor emission sources. The results demonstrate that the framework successfully captured spatiotemporal evolution of combined PM2.5 and O3 pollution. The attention matrix is autonomously generated during course of the model learning process with the aim to interpret the complex interactions among “2 + 26″ cities. The framework provides a new perspective for the interpretability of artificial intelligence models and offers a methodological support and scientific evidence for formulating regional pollution cooperative governance strategies.

Optimizing Hybrid Active–Passive Thermal Management of Prismatic Li‐Ion Batteries Using Phase Change Materials and Porous‐Filled Mini‐Channels

ABSTRACTTackling climate change is crucial, and electrifying the vehicular transportation sector is essential to reduce greenhouse gas emissions. Lithium‐ion (Li‐ion) batteries are highly efficient for electric vehicles (EVs) but face challenges such as thermal management, risk of thermal runaway, and high costs of lithium and cobalt. Overcoming these challenges is vital for the widespread adoption of hybrid and EVs. To overcome this drawback, this article proposed a large‐kernel attention graph convolutional network (LKAGCN) with leaf in wind optimization algorithm (LWOA) named as LKAGCN‐LWOA technique, which enhances the thermal management of prismatic Li‐ion batteries by integrating both active and passive cooling techniques. The system incorporates phase change materials (PCMs) with porous‐filled mini‐channels to regulate battery temperature effectively. The LKAGCN analyze thermal properties, battery conditions, and PCM characteristics to predict and optimize the thermal behavior of the battery pack using LWOA. The proposed methods tune the parameters of the hybrid thermal management system, ensuring efficient thermal regulation and improved performance. The proposed method is compared to various existing methods such as convolutional neural network (CNN), Taguchi method, and Finite element model (FEM).

Local Weather and Global Climate Data-Driven Long-Term Runoff Forecasting Based on Local–Global–Temporal Attention Mechanisms and Graph Attention Networks

The accuracy of long-term runoff models can be increased through the input of local weather variables and global climate indices. However, existing methods do not effectively extract important information from complex input factors across various temporal and spatial dimensions, thereby contributing to inaccurate predictions of long-term runoff. In this study, local–global–temporal attention mechanisms (LGTA) were proposed for capturing crucial information on global climate indices on monthly, annual, and interannual time scales. The graph attention network (GAT) was employed to extract geographical topological information of meteorological stations, based on remotely sensed elevation data. A long-term runoff prediction model was established based on long-short-term memory (LSTM) integrated with GAT and LGTA, referred to as GAT–LGTA–LSTM. The proposed model was compared to five comparative models (LGTA–LSTM, GAT–GTA–LSTM, GTA–LSTM, GAT–GA–LSTM, GA–LSTM). The models were applied to forecast the long-term runoff at Luning and Pingshan stations in China. The results indicated that the GAT–LGTA–LSTM model demonstrated the best forecasting performance among the comparative models. The Nash–Sutcliffe Efficiency (NSE) of GAT–LGTA–LSTM at the Luning and Pingshan stations reached 0.87 and 0.89, respectively. Compared to the GA–LSTM benchmark model, the GAT–LGTA–LSTM model demonstrated an average increase in NSE of 0.07, an average increase in Kling–Gupta Efficiency (KGE) of 0.08, and an average reduction in mean absolute percent error (MAPE) of 0.12. The excellent performance of the proposed model is attributed to the following: (1) local attention mechanism assigns a higher weight to key global climate indices at a monthly scale, enhancing the ability of global and temporal attention mechanisms to capture the critical information at annual and interannual scales and (2) the global attention mechanism integrated with GAT effectively extracts crucial temporal and spatial information from precipitation and remotely-sensed elevation data. Furthermore, attention visualization reveals that various global climate indices contribute differently to runoff predictions across distinct months. The global climate indices corresponding to specific seasons or months should be selected to forecast the respective monthly runoff.

Predicting the potential associations between circRNA and drug sensitivity using a multisource feature-based approach.

The unique non-coding RNA molecule known as circular RNA (circRNA) is distinguished from conventional linear RNA by having a longer half-life, greater degree of conservation and inherent solidity. Extensive research has demonstrated the profound impact of circRNA expression on cellular drug sensitivity and therapeutic efficacy. There is an immediate need for the creation of efficient computational techniques to anticipate the potential correlations between circRNA and drug sensitivity, as classical biological research approaches are time-consuming and costly. In this work, we introduce a novel deep learning model called SNMGCDA, which aims to forecast the relationships between circRNA and drug sensitivity. SNMGCDA incorporates a diverse range of similarity networks, enabling the derivation of feature vectors for circRNAs and drugs using three distinct calculation methods. First, we utilize a sparse autoencoder for the extraction of drug characteristics. Subsequently, the application of non-negative matrix factorization (NMF) enables the identification of relationships between circRNAs and drugs based on their shared features. Additionally, the multi-head graph attention network is employed to capture the characteristics of circRNAs. After acquiring the characteristics from these three separate components, we combine them to form a unified and inclusive feature vector for each cluster of circRNA and drug. Finally, the relevant feature vectors and labels are inputted into a multilayer perceptron (MLP) to make predictions. The outcomes of the experiment, obtained through 5-fold cross-validation (5-fold CV) and 10-fold cross-validation (10-fold CV), demonstrate SNMGCDA outperforms five other state-of-art methods in terms of performance. Additionally, the majority of case studies have predominantly confirmed newly discovered correlations by SNMGCDA, thereby emphasizing its reliability in predicting potential relationships between circRNAs and drugs.

LncRNA-miRNA interactions prediction based on meta-path similarity and Gaussian kernel similarity.

Long non-coding RNAs (lncRNAs) and microRNAs (miRNAs) are two typical types of non-coding RNAs that interact and play important regulatory roles in many animal organisms. Exploring the unknown interactions between lncRNAs and miRNAs contributes to a better understanding of their functional involvement. Currently, studying the interactions between lncRNAs and miRNAs heavily relies on laborious biological experiments. Therefore, it is necessary to design a computational method for predicting lncRNA-miRNA interactions. In this work, we propose a method called MPGK-LMI, which utilizes a graph attention network (GAT) to predict lncRNA-miRNA interactions in animals. First, we construct a meta-path similarity matrix based on known lncRNA-miRNA interaction information. Then, we use GAT to aggregate the constructed meta-path similarity matrix and the computed Gaussian kernel similarity matrix to update the feature matrix with neighbourhood information. Finally, a scoring module is used for prediction. By comparing with three state-of-the-art algorithms, MPGK-LMI achieves the best results in terms of performance, with AUC value of 0.9077, AUPR of 0.9327, ACC of 0.9080, F1-score of 0.9143 and precision of 0.8739. These results validate the effectiveness and reliability of MPGK-LMI. Additionally, we conduct detailed case studies to demonstrate the effectiveness and feasibility of our approach in practical applications. Through these empirical results, we gain deeper insights into the functional roles and mechanisms of lncRNA-miRNA interactions, providing significant breakthroughs and advancements in this field of research. In summary, our method not only outperforms others in terms of performance but also establishes its practicality and reliability in biological research through real-case analysis, offering strong support and guidance for future studies and applications.

Enhancing Non-Small Cell Lung Cancer Survival Prediction through Multi-Omics Integration Using Graph Attention Network.

Background: Cancer survival prediction is vital in improving patients' prospects and recommending therapies. Understanding the molecular behavior of cancer can be enhanced through the integration of multi-omics data, including mRNA, miRNA, and DNA methylation data. In light of these multi-omics data, we proposed a graph attention network (GAT) model in this study to predict the survival of non-small cell lung cancer (NSCLC). Methods: The different omics data were obtained from The Cancer Genome Atlas (TCGA) and preprocessed and combined into a single dataset using the sample ID. We used the chi-square test to select the most significant features to be used in our model. We used the synthetic minority oversampling technique (SMOTE) to balance the dataset and the concordance index (C-index) to measure the performance of our model on different combinations of omics data. Results: Our model demonstrated superior performance, with the highest value of the C-index obtained when we used both mRNA and miRNA data. This demonstrates that the multi-omics approach could be effective in predicting survival. Further pathway analysis conducted with KEGG showed that our GAT model provided high weights to the features that are associated with the viral entry pathways, such as the Epstein-Barr virus and Influenza A pathways, which are involved in lung cancer development. From our findings, it can be observed that the proposed GAT model leads to a significantly improved prediction of survival by exploiting the strengths of multiple omics datasets and the findings from the enriched pathways. Our GAT model outperforms other state-of-the-art methods that are used for NSCLC prediction. Conclusions: In this study, we developed a new model for the survival prediction of NSCLC using the GAT based on multi-omics data. Our model showed outstanding predictive values, and the KEGG analysis of the selected significant features showed that they were implicated in pivotal biological processes underlying pathways such as Influenza A and the Epstein-Barr virus infection, which are linked to lung cancer progression.

Entity Linking Model Based on Cascading Attention and Dynamic Graph

The purpose of entity linking is to connect entity mentions in text to real entities in the knowledge base. Existing methods focus on using the text topic, entity type, linking order, and association between entities to obtain the target entities. Although these methods have achieved good results, they ignore the exploration of candidate entities, leading to insufficient semantic information among entities. In addition, the implicit relationship and discrimination within the candidate entities also affect the accuracy of entity linking. To address these problems, we introduce information about candidate entities from Wikipedia and construct a graph model to capture implicit dependencies between different entity decisions. Specifically, we propose a cascade attention mechanism and develop a novel local entity linkage model termed CAM-LEL. This model leverages the interaction between entity mentions and candidate entities to enhance the semantic representation of entities. Furthermore, a global entity linkage model termed DG-GEL based on a dynamic graph is established to construct an entity association graph, and a random walking algorithm and entity entropy are used to extract the implicit relationships within entities to increase the differentiation between entities. Experimental results and in-depth analyses of multiple datasets show that our model outperforms other state-of-the-art models.

Microbe-drug association prediction model based on graph convolution and attention networks

The human microbiome plays a key role in drug development and precision medicine, but understanding its complex interactions with drugs remains a challenge. Identifying microbe-drug associations not only enhances our understanding of their mechanisms but also aids in drug discovery and repurposing. Traditional experiments are expensive and time-consuming, making computational methods for predicting microbe-drug associations a new trend. Currently, computational methods specifically designed for this task are still scarce. Therefore, to address the shortcomings of traditional experimental methods in predicting potential microbe-drug associations, this paper proposes a new prediction model named GCNATMDA. The model combines two deep learning models, Graph Convolutional Network and Graph Attention Network, and aims to reveal potential relationships between microbes and drugs by learning related features. Thus improve the efficiency and accuracy of prediction. We first integrated the microbe-drug association matrix from the existing dataset, and then combined the calculated microbe-drug characteristic matrix as the model input. The GCN module is used to dig deeper into the potential characterization of microbes and drugs, while the GAT module further learns the more complex interactions between them and generates the corresponding score matrix. The experimental results show that the GCNATMDA model achieves 96.59% and 93.01% in AUC and AUPR evaluation indexes, respectively, which is significantly better than the existing prediction models. In addition, the reliability of the prediction results is verified by a series of experiments.

3D Point Cloud Semantic Segmentation based on Multi-scale Dense Nested Networks

Aiming at the problem that the relationship between geometric features and semantic features is ignored in the point cloud data downsampling process, which leads to inaccurate segmentation of object boundaries and structural details, this paper proposes a 3D point cloud semantic segmentation network based on multi-scale dense nested type. Firstly, a dense nested network architecture is constructed by nesting multiple multi-scale feature fusion modules to fuse multi-scale features of different directions between encoder-decoder paths, so as to effectively propagate local ge-ometric context information and enhance the ability of cross-scale information interaction. Secondly, a local feature aggregation unit is constructed in the multi-scale feature fusion module, which strengthens the structural awareness within the local point set based on graph convolution and attention mechanism, and promotes the complementarity of local geometric features and abstract semantic information. Then, the cross-layer multi-loss supervision module is combined to further optimize the multi-scale feature propagation, which makes the network training more stable and improves the point cloud segmentation accuracy. Finally, this paper verified the proposed network on the S3DIS dataset. The experimental results show that the proposed network has the mean intersection over Union of 71.2% and the overall accuracy of 88.7%, which is 1.2 and 0.7 percentage points higher than RandLA-Net, respectively, which proves that the proposed network can effectively improve the accuracy of 3D point cloud semantic segmentation.

Domination based graph neural networks

Graph Neural Networks (GNNs) have emerged as a widely used and effective method across various domains for learning from graph data. Despite the abundance of GNN variants, many struggle with effectively propagating messages over long distances. This paper introduces a novel hierarchical message passing framework for graph learning, specifically designed to address the challenge of long-distance message propagation in graphs. By constructing smaller graphs from the main graph using the concept of domination, a fundamental principle in graph theory, we facilitate more efficient message passing within each subgraph. Subsequently, we employ a Graph Attention Network (GAT) to aggregate these features and propagate them to distant nodes across the graph. Experimental results on standard node classification datasets validate that the proposed architecture achieves performance comparable to or better than conventional GNNs. Additionally, our model consistently performs better on graphs with missing edges.

Edge-featured multi-hop attention graph neural network for intrusion detection system

With the development of the Internet, the application of computer technology has rapidly become widespread, driving the progress of Internet of Things (IoT) technology. The attacks present on networks have become more complex and stealthy. However, traditional network intrusion detection systems with singular functions are no longer sufficient to meet current demands. While some machine learning-based network intrusion detection systems have emerged, traditional machine learning methods cannot effectively respond to the complex and dynamic nature of network attacks. Intrusion detection systems utilizing deep learning can better enhance detection capabilities through diverse data learning and training. To capture the topological relationships in network data, using graph neural networks (GNNs) is most suitable. Most existing GNNs for intrusion detection use multi-layer network training, which may lead to over-smoothing issues. Additionally, current intrusion detection solutions often lack efficiency. To mitigate the issues mentioned above, this paper proposes an Edge-featured Multi-hop Attention Graph Neural Network for Intrusion Detection System (EMA-IDS), aiming to improve detection performance by capturing more features from data flows. Our method enhances computational efficiency through attention propagation and integrates node and edge features, fully leveraging data characteristics. We carried out experiments on four public datasets, which are NF-CSE-CIC-IDS2018-v2, NF-UNSW-NB15-v2, NF-BoT-IoT, and NF-ToN-IoT. Compared with existing models, our method demonstrated superior performance.