Search

The research on emotion recognition in conversations (ERC) focuses on the interrelationship between conversational context and speaker modeling. The current research usually ignores the dependency within the conversation, which leads to the weak connection between the context of the conversation and the lack of logic between the speakers. Therefore, an emotion recognition in conversations model based on discourse parsing and graph attention network (DPGAT) was proposed to integrate the inter-dependency of conversation into the context modeling to make contextual information more dependent and global. Firstly, the discourse dependency relationships within the conversation were obtained through discourse parsing, and the discourse dependency graph and the speaker relationship graph were constructed. Subsequently, different types of speaker diagrams were internally integrated by multi-head attention mechanisms. Based on the graph attention network, cyclic learning was combined with dependency relationships to achieve the effective integration of contextual information and speaker information, realizing the external integration of context-related information in conversations. Finally, by analyzing the results of internal and external integration, the complete conversation context was restored, and the speaker's emotions were analyzed. By evaluating and verifying on English dataset MELD, EmoryNLP, DailyDialog and Chinese dataset M3ED, F1 scores were 66.23%, 40.03%, 59.28% and 52.77%, respectively. Compared with mainstream models, the proposed model at least reaches state-of-the-art, and can be used in different language scenarios.

Abstract Background Motif finding in Assay for Transposase-Accessible Chromatin using sequencing (ATAC-seq) data is essential to reveal the intricacies of transcription factor binding sites (TFBSs) and their pivotal roles in gene regulation. Deep learning technologies including convolutional neural networks (CNNs) and graph neural networks (GNNs), have achieved success in finding ATAC-seq motifs. However, CNN-based methods are limited by the fixed width of the convolutional kernel, which makes it difficult to find multiple transcription factor binding sites with different lengths. GNN-based methods has the limitation of using the edge weight information directly, makes it difficult to aggregate the neighboring nodes' information more efficiently when representing node embedding. Results To address this challenge, we developed a novel graph attention network framework named MMGAT, which employs an attention mechanism to adjust the attention coefficients among different nodes. And then MMGAT finds multiple ATAC-seq motifs based on the attention coefficients of sequence nodes and k-mer nodes as well as the coexisting probability of k-mers. Our approach achieved better performance on the human ATAC-seq datasets compared to existing tools, as evidenced the highest scores on the precision, recall, F1_score, ACC, AUC, and PRC metrics, as well as finding 389 higher quality motifs. To validate the performance of MMGAT in predicting TFBSs and finding motifs on more datasets, we enlarged the number of the human ATAC-seq datasets to 180 and newly integrated 80 mouse ATAC-seq datasets for multi-species experimental validation. Specifically on the mouse ATAC-seq dataset, MMGAT also achieved the highest scores on six metrics and found 356 higher-quality motifs. To facilitate researchers in utilizing MMGAT, we have also developed a user-friendly web server named MMGAT-S that hosts the MMGAT method and ATAC-seq motif finding results. Conclusions The advanced methodology MMGAT provides a robust tool for finding ATAC-seq motifs, and the comprehensive server MMGAT-S makes a significant contribution to genomics research. The open-source code of MMGAT can be found at https://github.com/xiaotianr/MMGAT , and MMGAT-S is freely available at https://www.mmgraphws.com/MMGAT-S/ .

Abstract Drug combination therapy is generally more effective than monotherapy in the field of cancer treatment. However, screening for effective synergistic combinations from a wide range of drug combinations is particularly important given the increase in the number of available drug classes and potential drug-drug interactions. Existing methods for predicting the synergistic effects of drug combinations primarily focus on extracting structural features of drug molecules and cell lines, but neglect the interaction mechanisms between cell lines and drug combinations. Consequently, there is a deficiency in comprehensive understanding of the synergistic effects of drug combinations. To address this issue, we propose a drug combination synergy prediction model based on multi-source feature interaction learning, named MFSynDCP, aiming to predict the synergistic effects of anti-tumor drug combinations. This model includes a graph aggregation module with an adaptive attention mechanism for learning drug interactions and a multi-source feature interaction learning controller for managing information transfer between different data sources, accommodating both drug and cell line features. Comparative studies with benchmark datasets demonstrate MFSynDCP's superiority over existing methods. Additionally, its adaptive attention mechanism graph aggregation module identifies drug chemical substructures crucial to the synergy mechanism. Overall, MFSynDCP is a robust tool for predicting synergistic drug combinations. The source code is available from GitHub at https://github.com/kkioplkg/MFSynDCP .

ABSTRACTLand use/cover change is a major cause of ecological degradation. Reliable LUCC data are essential for evaluating habitat quality. The current method of surface cover classification based on the convolutional neural networks (CNNs) is usually a local spatial operation using a regular convolutional kernel, which ignores the correlation between adjacent image elements. This paper proposes a combination network with two branches, branch 1 uses the K-nearest neighbor clustering algorithm to construct superpixels and then uses the data transformation module to construct a graph attention network (GAT); branch 2 constructs the CNN using attention and residual modules to obtain the spatial and higher-order semantic information of the images. Finally, the features are fused using weighted fusion, and a classification map with less point noise and greater consistency with the real surface coverage is obtained. The classification results of this network are better than those of the other competitive methods. In addition, the urbanization of Sanya has resulted in significant habitat degradation. A good fit ([Formula: see text] in 2020 = 0.639) between habitat quality (HQ) and natural and socioeconomic factors was observed in Sanya. Natural factors are more relevant to HQ than socioeconomic factors and vary spatially.

Drug–target interaction (DTI) is a widely explored topic in the field of bioinformatics and plays a pivotal role in drug discovery. However, the traditional bio-experimental process of drug–target interaction identification requires a large investment of time and labor. To address this challenge, graph neural network (GNN) approaches in deep learning are becoming a prominent trend in the field of DTI research, which is characterized by multimodal processing of data, feature learning and interpretability in DTI. Nevertheless, some methods are still limited by homogeneous graphs and single features. To address the problems, we mechanistically analyze graph convolutional neural networks (GCNs) and graph attentional neural networks (GATs) to propose a new model for the prediction of drug–target interactions using graph neural networks named BiTGNN [Bidirectional Transformer (Bi-Transformer)–graph neural network]. The method first establishes drug–target pairs through the pseudo-position specificity scoring matrix (PsePSSM) and drug fingerprint data, and constructs a heterogeneous network by utilizing the relationship between the drug and the target. Then, the computational extraction of drug and target attributes is performed using GCNs and GATs for the purpose of model information flow extension and graph information enhancement. We collect interaction data using the proposed Bi-Transformer architecture, in which we design a bidirectional cross-attention mechanism for calculating the effects of drug–target interactions for realistic biological interaction simulations. Finally, a feed-forward neural network is used to obtain the feature matrices of the drug and the target, and DTI prediction is performed by fusing the two feature matrices. The Enzyme, Ion Channel (IC), G Protein-coupled Receptor (GPCR) and Nuclear Receptor (NR) datasets are used in the experiments, and compared with several existing mainstream models, our model outperforms in Area Under the ROC Curve (AUC), Specificity, Accuracy and the metric Area Under the Precision–Recall Curve (AUPR). [ABSTRACT FROM AUTHOR]

Accurate identification of potential drug-target pairs is a crucial step in drug development and drug repositioning, which is characterized by the ability of the drug to bind to and modulate the activity of the target molecule, resulting in the desired therapeutic effect. As machine learning and deep learning technologies advance, an increasing number of models are being engaged for the prediction of drug-target interactions. However, there is still a great challenge to improve the accuracy and efficiency of predicting. In this study, we proposed a deep learning method called Multi-source Information Fusion and Attention Mechanism for Drug-Target Interaction (MIFAM-DTI) to predict drug-target interactions. Firstly, the physicochemical property feature vector and the Molecular ACCess System molecular fingerprint feature vector of a drug were extracted based on its SMILES sequence. The dipeptide composition feature vector and the Evolutionary Scale Modeling -1b feature vector of a target were constructed based on its amino acid sequence information. Secondly, the PCA method was employed to reduce the dimensionality of the four feature vectors, and the adjacency matrices were constructed by calculating the cosine similarity. Thirdly, the two feature vectors of each drug were concatenated and the two adjacency matrices were subjected to a logical OR operation. And then they were fed into a model composed of graph attention network and multi-head self-attention to obtain the final drug feature vectors. With the same method, the final target feature vectors were obtained. Finally, these final feature vectors were concatenated, which served as the input to a fully connected layer, resulting in the prediction output. MIFAM-DTI not only integrated multi-source information to capture the drug and target features more comprehensively, but also utilized the graph attention network and multi-head self-attention to autonomously learn attention weights and more comprehensively capture information in sequence data. Experimental results demonstrated that MIFAM-DTI outperformed state-of-the-art methods in terms of AUC and AUPR. Case study results of coenzymes involved in cellular energy metabolism also demonstrated the effectiveness and practicality of MIFAM-DTI. [ABSTRACT FROM AUTHOR]

MicroRNAs (miRNAs) synergize with various biomolecules in human cells resulting in diverse functions in regulating a wide range of biological processes. Predicting potential disease-associated miRNAs as valuable biomarkers contributes to the treatment of human diseases. However, few previous methods take a holistic perspective and only concentrate on isolated miRNA and disease objects, thereby ignoring that human cells are responsible for multiple relationships. In this work, we first constructed a multi-view graph based on the relationships between miRNAs and various biomolecules, and then utilized graph attention neural network to learn the graph topology features of miRNAs and diseases for each view. Next, we added an attention mechanism again, and developed a multi-scale feature fusion module, aiming to determine the optimal fusion results for the multi-view topology features of miRNAs and diseases. In addition, the prior attribute knowledge of miRNAs and diseases was simultaneously added to achieve better prediction results and solve the cold start problem. Finally, the learned miRNA and disease representations were then concatenated and fed into a multi-layer perceptron for end-to-end training and predicting potential miRNA–disease associations. To assess the efficacy of our model (called MUSCLE), we performed 5- and 10-fold cross-validation (CV), which got average the Area under ROC curves of 0.966 |${\pm }$| 0.0102 and 0.973 |${\pm }$| 0.0135, respectively, outperforming most current state-of-the-art models. We then examined the impact of crucial parameters on prediction performance and performed ablation experiments on the feature combination and model architecture. Furthermore, the case studies about colon cancer, lung cancer and breast cancer also fully demonstrate the good inductive capability of MUSCLE. Our data and code are free available at a public GitHub repository: https://github.com/zht-code/MUSCLE.git. [ABSTRACT FROM AUTHOR]

Research on drug-drug interaction (DDI) is conducive to clinical medication and new drug development. Existing research technologies do not fully consider the topological structure of drug entities and other entities such as drugs, targets, and genes in the drug knowledge graph, as well as the semantic importance of different relationships between entities. To solve these problems, this paper proposes a model based on neighborhood relation-aware graph neural network (NRAGNN) to predict DDI. Firstly, the graph attention network is utilized to learn the weights and feature representations of different relationship edges, which enhances the semantic features of drug entities. Secondly, neighborhood representations for different layers around the drug entity are generated to capture the topological structure features of drug entities. Finally, the drug-drug interaction score is obtained by element-wise multiplication of the two drug feature representation vectors. Experimental results show that the proposed NRAGNN model achieves 0.899 4, 0.944 4, 0.956 7, and 0.902 3 in ACC, AUPR, AUC-ROC, and F1 indicators on the KEGG-DRUG dataset, respectively, outperforming other current models. [ABSTRACT FROM AUTHOR]

A graph neural network (GNN) is one of successful methods for handling tasks on a graph data structure, e.g. node embedding, link prediction and node classification. GNNs focus on a graph data structure that must aggregate messages on nodes in the graph to retain a graph-structured information in new node's message and proceed tasks on a graph. One of modifications on the propagation step in GNNs by adopting attention mechanism is a graph attention network (GAT). Applying this modification to signed graphs generated by sociological theories is called signed graph attention network (SiGAT). In this research, we utilize SiGAT and create novel graphs using graph characters to assess the performance of SiGAT models embedded in nodes across various characteristic graphs. The primary focus of our study was linked prediction, which aligns with the task employed in the previous research on SiGAT. We propose a method using graph characteristics to improve the time spent on the learning process in SiGAT. [ABSTRACT FROM AUTHOR]

Knowledge tracing aims to model the state of knowledge and ultimately predict the future performance of learners by describing exercises through the representation of concepts. However, in terms of the representation of concepts, the current research doesn’t model the influence of historical knowledge concepts on the temporal relationship of the current concepts, nor does it describe the role of the spatial relationship between various concepts in the exercise. In order to solve these problems, this paper proposed a knowledge tracing model characterized by temporal and spatial correlation fusion. First of all, based on the degree of temporal correlation between concepts, it modelled the temporal effect of historical concepts from current concepts. Secondly, it modelled the spatial interaction between several concepts contained in the exercise to obtain the representation of knowledge points containing temporal and spatial information through the graph attention network. Finally, it used the above representation of concepts to derive the representation of the exercises, and generated the current state of knowledge through the self-attention mechanism. In the experimental stage, this paper compared the performance of the proposed model with the five relevant knowledge tracing models on four real datasets. The results show that the proposed model has better performance. In particular, compared to the five comparative models on the ASSISTments2017 dataset, the AUC and ACC are improved by 1.7%～7.7% and 7.3%～12.1%, respectively. At the same time, the ablation experiment proves the effectiveness of modeling the temporal and spatial correlation between concepts, and the training process experiment shows that the proposed model has certain advantages in the representation of concepts and the modeling of their interaction relationships. The application examples can also show that the model has better practical results than other knowledge tracing models. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Chongqing University of Technology (Natural Science) is the property of Chongqing University of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Knowledge graphs (KGs) play a vital role in enhancing search results and recommendation systems. With the rapid increase in the size of KGs, they are becoming inaccurate and incomplete. This problem can be solved by the KG completion methods, of which graph attention network (GAT)-based methods stand out because of their superior performance. However, existing GAT-based KG completion methods often suffer from overfitting issues when dealing with heterogeneous KGs, primarily due to the unbalanced number of samples. Additionally, these methods demonstrate poor performance in predicting the tail (head) entity that shares the same relation and head (tail) entity with others. To solve these problems, we propose GATH, a novel GAT-based method designed for Heterogeneous KGs. GATH incorporates two separate attention network modules that work synergistically to predict the missing entities. We also introduce novel encoding and feature transformation approaches, enabling the robust performance of GATH in scenarios with imbalanced samples. Comprehensive experiments are conducted to evaluate GATH's performance. Compared with the existing state-of-the-art GAT-based model on Hits@10 and MRR metrics, our model improves performance by 5.2% and 5.2% on the FB15K-237 dataset and by 4.5% and 14.6% on the WN18RR dataset, respectively. [ABSTRACT FROM AUTHOR]

Copyright of Electric Power is the property of Electric Power Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Background: Motif finding in Assay for Transposase-Accessible Chromatin using sequencing (ATAC-seq) data is essential to reveal the intricacies of transcription factor binding sites (TFBSs) and their pivotal roles in gene regulation. Deep learning technologies including convolutional neural networks (CNNs) and graph neural networks (GNNs), have achieved success in finding ATAC-seq motifs. However, CNN-based methods are limited by the fixed width of the convolutional kernel, which makes it difficult to find multiple transcription factor binding sites with different lengths. GNN-based methods has the limitation of using the edge weight information directly, makes it difficult to aggregate the neighboring nodes' information more efficiently when representing node embedding. Results: To address this challenge, we developed a novel graph attention network framework named MMGAT, which employs an attention mechanism to adjust the attention coefficients among different nodes. And then MMGAT finds multiple ATAC-seq motifs based on the attention coefficients of sequence nodes and k-mer nodes as well as the coexisting probability of k-mers. Our approach achieved better performance on the human ATAC-seq datasets compared to existing tools, as evidenced the highest scores on the precision, recall, F1_score, ACC, AUC, and PRC metrics, as well as finding 389 higher quality motifs. To validate the performance of MMGAT in predicting TFBSs and finding motifs on more datasets, we enlarged the number of the human ATAC-seq datasets to 180 and newly integrated 80 mouse ATAC-seq datasets for multi-species experimental validation. Specifically on the mouse ATAC-seq dataset, MMGAT also achieved the highest scores on six metrics and found 356 higher-quality motifs. To facilitate researchers in utilizing MMGAT, we have also developed a user-friendly web server named MMGAT-S that hosts the MMGAT method and ATAC-seq motif finding results. Conclusions: The advanced methodology MMGAT provides a robust tool for finding ATAC-seq motifs, and the comprehensive server MMGAT-S makes a significant contribution to genomics research. The open-source code of MMGAT can be found at https://github.com/xiaotianr/MMGAT, and MMGAT-S is freely available at https://www.mmgraphws.com/MMGAT-S/. [ABSTRACT FROM AUTHOR]

In the realm of aspect-based sentiment analysis (ABSA), a paramount task is the extraction of triplets, which define aspect terms, opinion terms, and their respective sentiment orientations within text. This study introduces a novel extraction model, BiLSTM-BGAT-GCN, which seamlessly integrates graph neural networks with an enhanced biaffine attention mechanism. This model amalgamates the sophisticated capabilities of both graph attention and convolutional networks to process graph-structured data, substantially enhancing the interpretation and extraction of textual features. By optimizing the biaffine attention mechanism, the model adeptly uncovers the subtle interplay between aspect terms and emotional expressions, offering enhanced flexibility and superior contextual analysis through dynamic weight distribution. A series of comparative experiments confirm the model's significant performance improvements across various metrics, underscoring its efficacy and refined effectiveness in ABSA tasks. [ABSTRACT FROM AUTHOR]

The frequent occurrence of extreme heavy rainfall in cities has posed a severe threat to the personal and property safety of residents due to urban flooding. Accurate and efficient prediction of flooding areas within cities plays a crucial role in enhancing urban disaster emergency response capabilities. In order to improve the accuracy and intuitiveness of urban flooding area predictions, this article proposed a combination prediction model called GATLSTM, based on GAT (Graph Attention Network) and LSTM (Long Short-Time Memory). The GAT was used to extract local spatial features of flooding information, and it enhanced the memory of key information sequences by assigning weights to nodes. Subsequently, LSTM was employed to extract temporal features of flooding area sequences and predicted the flooding areas at inundation points for the next 10 minutes. The model was built and evaluated by using inundation data from a specific point in Kaifeng City. It was compared with LSTM, GAT and GCNLSTM models. The results indicate that the GATLSTM model outperforms the other three models in terms of prediction accuracy. It can accurately forecast flooding areas at inundation points in the short term, providing a scientific basis for flood prevention efforts and emergency response measures. [ABSTRACT FROM AUTHOR]

Graph-structured data is ubiquitous in real-world applications, such as social networks, citation networks, and communication networks. Graph neural network (GNN) is the key to process them. In recent years, graph attention networks (GATs) have been proposed for node classification and achieved encouraging performance. It focuses on the content associated on nodes to evaluate the attention weights, and the rich structure information in the graph is almost ignored. Therefore, we propose a multi-head attention mechanism to fully employ node content and graph structure information. The core idea is to introduce the interactions in the topological structure into the existing GATs. This method can more accurately estimate the attention weights among nodes, thereby improving the convergence of GATs. Second, the mechanism is lightweight and efficient, requires no training to learn, can accurately analyze higher-order structural information, and can be strongly interpreted through heatmaps. We name the proposed model content- and structure-based graph attention network (CSGAT). Furthermore, our proposed model achieves state-of-the-art performance on a number of datasets in node classification. The code and data are available at https://github.com/CroakerShark/CSGAT. [ABSTRACT FROM AUTHOR]

The online calibration method for current transformers is an important research direction in the field of smart grids. This article constructs a transformer error prediction model based on spatiotemporal integration. This model draws inspiration from the structure of forgetting gates in gated loop units and combines it with a graph convolutional network (GCN) that is good at capturing the spatial relationships within the graph attention network to construct an adaptive GCN. The spatial module formed by this adaptive GCN is used to model the spatial relationships in the circuit network, and the attention mechanism and gated time convolutional network are combined to form a time module to learn the temporal relationships in the circuit network. The layer that combines the time and space modules is used, which consists of a gating mechanism for spatiotemporal fusion, and a transformer error prediction model based on a spatiotemporal correlation analysis is constructed. Finally, it is verified on a real power grid operation dataset, and compared with the existing prediction methods to analyze its performance. [ABSTRACT FROM AUTHOR]

Drug combination therapy is generally more effective than monotherapy in the field of cancer treatment. However, screening for effective synergistic combinations from a wide range of drug combinations is particularly important given the increase in the number of available drug classes and potential drug-drug interactions. Existing methods for predicting the synergistic effects of drug combinations primarily focus on extracting structural features of drug molecules and cell lines, but neglect the interaction mechanisms between cell lines and drug combinations. Consequently, there is a deficiency in comprehensive understanding of the synergistic effects of drug combinations. To address this issue, we propose a drug combination synergy prediction model based on multi-source feature interaction learning, named MFSynDCP, aiming to predict the synergistic effects of anti-tumor drug combinations. This model includes a graph aggregation module with an adaptive attention mechanism for learning drug interactions and a multi-source feature interaction learning controller for managing information transfer between different data sources, accommodating both drug and cell line features. Comparative studies with benchmark datasets demonstrate MFSynDCP's superiority over existing methods. Additionally, its adaptive attention mechanism graph aggregation module identifies drug chemical substructures crucial to the synergy mechanism. Overall, MFSynDCP is a robust tool for predicting synergistic drug combinations. The source code is available from GitHub at https://github.com/kkioplkg/MFSynDCP. [ABSTRACT FROM AUTHOR]

In response to the problem of aspect-level sentiment analysis uses attention mechanism and traditional deep learning methods to extract the relations between aspect words and contextual words at present, which do not fully considers syntactic dependency information and relational labels, resulting the worse the predicted effects, an relational graph attention network of aspect-level sentiment analysis was proposed. Firstly, pre-training model DeBERTa was used to get word embedding and initial word vector was used for multi-head attention to enhance the relationship between aspect words and contextual words. Then, relational labels were learned through graph attention networks. The relationship between aspects and contextual words can be further extracted with these relational label features, which improve ability of the model to extract sentimental features. Experimental results on the SemEval-2014 dataset show that the model outperforms the comparison model in both accuracy and Macro-F1. [ABSTRACT FROM AUTHOR]

In order to solve the problem that the existing log anomaly detection methods tend to focus only on the single feature of the quantitative relationship mode or the sequential mode, ignoring the relationship of the log time structure and the interrelation between different features, resulting in a high error detection rate and false positive rate, this paper proposed a log anomaly detection method based on the log time graph attention network. Firstly, this paper constructed a log time graph by designing a joint feature extraction module of log semantics and time structure, which effectively integrated the time structure relationship and semantic information of log. Secondly, it constructed the time relationship graph attention network, and used the graph structure to describe the time structure relationship between logs, which could adaptively learn the importance of different logs and carry out anomaly detection. Finally, it used three public datasets to verify the effectiveness of the model. Extensive experiments results indicate that the proposed method is able to effectively capture the temporal structure relationships in the logs, thereby improving the accuracy of anomaly detection. [ABSTRACT FROM AUTHOR]

Sentiment classification and emotion recognition are two close related tasks in NLP. However, most of the recent studies have treated them as two separate tasks, where the shared knowledge are neglected. In this paper, we propose a multi-task interactive graph attention network with position encodings, termed MIP-GAT, to improve the performance of each task by simultaneously leveraging similarities and differences. The main proposal is a multi-interactive graph interaction layer where a syntactic dependency connection , a cross-task connection and position encodings are constructed and incorporated into a unified graphical structure. Empirical evaluation on two benchmarking datasets, i.e., CMU-MOSEI and GoEmotions, shows the effectiveness of the proposed model over state-of-the-art baselines with the margin of 0.18%, 0.67% for sentiment analysis, 1.77%, 0.89% for emotion recognition. In addition, we also explore the superiority and limitations of the proposed model. • Sentiment classification and emotion recognition are two correlative tasks in NLP. • But they are often treated as separative tasks. • In contrast to differences, commonalities of sentiment and emotion are often ignored. • Keys in the task: syntactic knowledge, cross-task interaction, position information. • Simultaneously incorporating the three key factors into a graph structure. • Performance boosts by the interaction of two tasks in a unified graphical structure. [ABSTRACT FROM AUTHOR]

Recently, large-scale artificial intelligence models with billions of parameters have achieved good results in experiments, but their practical deployment on edge computing platforms is often subject to many constraints because of their resource requirements. These models require powerful computing platforms with a high memory capacity to store and process the numerous parameters and activations, which makes it challenging to deploy these large-scale models directly. Therefore, model compression techniques are crucial role in making these models more practical and accessible. In this article, a progressive channel pruning strategy combining graph attention network and transformer, namely GAT TransPruning, is proposed, which uses the graph attention networks (GAT) and the attention of transformer mechanism to determine the channel-to-channel relationship in large networks. This approach ensures that the network maintains its critical functional connections and optimizes the trade-off between model size and performance. In this study, VGG-16, VGG-19, ResNet-18, ResNet-34, and ResNet-50 are used as large-scale network models with the CIFAR-10 and CIFAR-100 datasets for verification and quantitative analysis of the proposed progressive channel pruning strategy. The experimental results reveal that the accuracy rate only drops by 6.58% when the channel pruning rate is 89% for VGG-19/CIFAR-100. In addition, the lightweight model inference speed is 9.10 times faster than that of the original large model. In comparison with the traditional channel pruning schemes, the proposed progressive channel pruning strategy based on the GAT and Transformer cannot only cut out the insignificant weight channels and effectively reduce the model size, but also ensure that the performance drop rate of its lightweight model is still the smallest even under high pruning ratio. [ABSTRACT FROM AUTHOR]

Point cloud super-resolution plays a central role in the mesh's quality in 3D reconstruction, while the feature extractor is vital for the learning-based point cloud upsampling pipelines. In this paper, we propose an arbitrary 3D point cloud upsampling network (PSR-GAT), which comprises the feature extraction module, GAT module, and upsampling module. For the input point cloud, the feature extraction module locates k nearest points of each point in 3D space by k-NN algorithm, then converts the local geometry information into high dimensional feature space through a multi-layer point-wise convolution. The GAT module converts the local geometry feature of each point into the semantic feature through a multi-layer graph attention network. The module dynamically adjusts the neighbor space of the point in each layer to increase the receptive field range and effectively fuses the semantic information of different levels through residual connection. This makes the local geometric in- formation extraction efficient. The upsampling module adds the number of points and maps them from feature space to 3D space. Extensive experimental results show that PSR-GAT exhibits a better performance than the existing state-of-the-art approaches. [ABSTRACT FROM AUTHOR]

Single-cell ribonucleic acid sequencing (scRNA-seq) allows researchers to study cell heterogeneity and diversity at the individual cell level. Cell clustering is an essential component of scRNA-seq data processing. However, the high dimensionality and high noise characteristics of scRNA-seq data may pose problems during data processing. Although many methods are available for scRNA-seq clustering analysis, most of them ignore the topological relationships of scRNA-seq data and do not fully utilize the potential associations between cells. In this study, we present scGAD, a graph attention autoencoder model with a dual decoder structure for clustering scRNA-seq data. We utilize a graph attention autoencoder with two decoders to learn feature representations of cells in latent space. To ensure that the learned latent feature representation maintains node properties and graph structure, we use an inner product decoder and a learnable graph attention decoder to reconstruct graph structure and node properties, respectively. On the 12 real scRNA-seq datasets, the average NMI and ARI scores of scGAD are 0.762 and 0.695, respectively, outperforming state-of-the-art single-cell clustering approaches. Biological analysis shows that the cell labels predicted by scGAD can assist in the downstream analysis of scRNA-seq data. [ABSTRACT FROM AUTHOR]

In wireless networks, the effectiveness of beamforming and power allocation strategies is crucial in meeting the increasing data demands of users and ensuring rapid data transmission. Graph learning approaches have been developed to tackle complex challenges in wireless communications and have shown promising results. However, most existing graph learning methods primarily focus on node features, neglecting the potential benefits of leveraging rich information from edge features. This study addresses this limitation and proposes a novel framework called Heterogeneous Node and Edge Graph Neural Network (HNENN). Specifically designed for heterogeneous networks, HNENN incorporates node-level and edge-level attention layers to learn and aggregate node and edge embeddings. The alternating stacking of these two layers facilitates the mutual enhancement of node and edge embeddings. Simulations show that the proposed framework works better than state-of-the-art approaches, getting a higher sum rate in different scenarios with different numbers of D2D pairs, training samples, interference levels, and transmit power budgets. [ABSTRACT FROM AUTHOR]

Time series anomaly detection is very important to ensure the security of industrial control systems (ICSs). Many algorithms have performed well in anomaly detection. However, the performance of most of these algorithms decreases sharply with the increase in feature dimension. This paper proposes an anomaly detection scheme based on Graph Attention Network (GAT) and Informer. GAT learns sequential characteristics effectively, and Informer performs excellently in long time series prediction. In addition, long-time forecasting loss and short-time forecasting loss are used to detect multivariate time series anomalies. Short-time forecasting is used to predict the next time value, and long-time forecasting is employed to assist the short-time prediction. We conduct a large number of experiments on industrial control system datasets SWaT and WADI. Compared with most advanced methods, we achieve competitive results, especially on higher-dimensional datasets. Moreover, the proposed method can accurately locate anomalies and realize interpretability. [ABSTRACT FROM AUTHOR]

The construction of medical knowledge graphs (MKGs) is steadily progressing from manual to automatic methods, which inevitably introduce noise, which could impair the performance of downstream healthcare applications. Existing error detection approaches depend on the topological structure and external labels of entities in MKGs to improve their quality. Nevertheless, due to the cost of manual annotation and imperfect automatic algorithms, precise entity labels in MKGs cannot be readily obtained. To address these issues, we propose an approach named Enhancing error detection on Medical knowledge graphs via intrinsic labEL (EMKGEL). Considering the absence of hyper-view KG, we establish a hyper-view KG and a triplet-level KG for implicit label information and neighborhood information, respectively. Inspired by the success of graph attention networks (GATs), we introduce the hyper-view GAT to incorporate label messages and neighborhood information into representation learning. We leverage a confidence score that combines local and global trustworthiness to estimate the triplets. To validate the effectiveness of our approach, we conducted experiments on three publicly available MKGs, namely PharmKG-8k, DiseaseKG, and DiaKG. Compared with the baseline models, the Precision@K value improved by 0.7%, 6.1%, and 3.6%, respectively, on these datasets. Furthermore, our method empirically showed that it significantly outperformed the baseline on a general knowledge graph, Nell-995. [ABSTRACT FROM AUTHOR]

Accurate cancer subtype prediction is crucial for personalized medicine. Integrating multi-omics data represents a viable approach to comprehending the intricate pathophysiology of complex diseases like cancer. Conventional machine learning techniques are not ideal for analyzing the complex interrelationships among different categories of omics data. Numerous models have been suggested using graph-based learning to uncover veiled representations and network formations unique to distinct types of omics data to heighten predictions regarding cancers and characterize patients' profiles, amongst other applications aimed at improving disease management in medical research. The existing graph-based state-of-the-art multi-omics integration approaches for cancer subtype prediction, MOGONET, and SUPREME, use a graph convolutional network (GCN), which fails to consider the level of importance of neighboring nodes on a particular node. To address this gap, we hypothesize that paying attention to each neighbor or providing appropriate weights to neighbors based on their importance might improve the cancer subtype prediction. The natural choice to determine the importance of each neighbor of a node in a graph is to explore the graph attention network (GAT). Here, we propose MOGAT, a novel multi-omics integration approach, leveraging GAT models that incorporate graph-based learning with an attention mechanism. MOGAT utilizes a multi-head attention mechanism to extract appropriate information for a specific sample by assigning unique attention coefficients to neighboring samples. Based on our knowledge, our group is the first to explore GAT in multi-omics integration for cancer subtype prediction. To evaluate the performance of MOGAT in predicting cancer subtypes, we explored two sets of breast cancer data from TCGA and METABRIC. Our proposed approach, MOGAT, outperforms MOGONET by 32% to 46% and SUPREME by 2% to 16% in cancer subtype prediction in different scenarios, supporting our hypothesis. Our results also showed that GAT embeddings provide a better prognosis in differentiating the high-risk group from the low-risk group than raw features. [ABSTRACT FROM AUTHOR]

This article addresses the pervasive issue of fraud in financial transactions by introducing the Graph Attention Network (GAN) into graph neural networks. The article integrates Node Attention Networks and Semantic Attention Networks to construct a Dual-Head Attention Network module, enabling a comprehensive analysis of complex relationships in user transaction data. This approach adeptly handles non-linear features and intricate data interaction relationships. The article incorporates a Gradient-Boosting Decision Tree (GBDT) to enhance fraud identification to create the GBDT–Dual-channel Graph Attention Network (GBDT-DGAN). In a bid to ensure user privacy, this article introduces blockchain technology, culminating in the development of a financial anti-fraud model that fuses blockchain with the GBDT-DGAN algorithm. Experimental verification demonstrates the model's accuracy, reaching 93.82%, a notable improvement of at least 5.76% compared to baseline algorithms such as Convolutional Neural Networks. The recall and F1 values stand at 89.5% and 81.66%, respectively. Additionally, the model exhibits superior network data transmission security, maintaining a packet loss rate below 7%. Consequently, the proposed model significantly outperforms traditional approaches in financial fraud detection accuracy and ensures excellent network data transmission security, offering an efficient and secure solution for fraud detection in the financial domain. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Jilin University (Science Edition) / Jilin Daxue Xuebao (Lixue Ban) is the property of Zhongguo Xue shu qi Kan (Guang Pan Ban) Dian zi Za zhi She and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Traditional two-dimensional dynamic fault detection methods describe nonlinear dynamics by constructing a two-dimensional sliding window in the batch and time directions. However, determining the shape of a two-dimensional sliding window for different phases can be challenging. Samples in the two-dimensional sliding windows are assigned equal importance before being utilized for feature engineering and statistical control. This will inevitably lead to redundancy in the input, complicating fault detection. This paper proposes a novel method named attention-based two-dimensional dynamic-scale graph autoencoder (2D-ADSGAE). Firstly, a new approach is introduced to construct a graph based on a predefined sliding window, taking into account the differences in importance and redundancy. Secondly, to address the training difficulties and adapt to the inherent heterogeneity typically present in the dynamics of a batch across both its time and batch directions, we devise a method to determine the shape of the sliding window using the Pearson correlation coefficient and a high-density gridding policy. The method is advantageous in determining the shape of the sliding windows at different phases, extracting nonlinear dynamics from batch process data, and reducing redundant information in the sliding windows. Two case studies demonstrate the superiority of 2D-ADSGAE. [ABSTRACT FROM AUTHOR]

As the cornerstone of intelligent transportation systems, accurate traffic prediction can reduce the pressure of urban traffic, reduce the cost of residents' travel time, and provide a reference basis for urban construction planning. Existing traffic prediction methods focus on spatio-temporal dependence modeling, ignoring the influence of weather factors on spatio-temporal characteristics, and the prediction task has complexity and an uneven distribution in different spatio-temporal scenarios and weather changes. In view of this, we propose a weather interaction-aware spatio-temporal attention network (WST-ANet), in which we integrate feature models and dynamic graph modules in the encoder and decoder, and use a spatio-temporal weather interaction perception module for prediction. Firstly, the contextual semantics of the traffic flows are fused using a feature embedding module to improve the adaptability to weather drivers; then, an encoder–decoder is constructed by combining the Dynamic Graph Module and the WSTA Block, to extract spatio-temporal aggregated correlations in the roadway network; finally, the feature information of the encoder was weighted and aggregated using the cross-focusing mechanism, and attention was paid to the hidden state of the encoding. Traffic flow was predicted using the PeMS04 and PeMS08 datasets and compared with multiple typical baseline models. It was learned through extensive experiments that the accuracy evaluation result is the smallest in WST-ANet, which demonstrated the superiority of the proposed model. This can more accurately predict future changes in traffic in different weather conditions, providing decision makers with a basis for optimizing scenarios. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Computer-Aided Design & Computer Graphics / Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao is the property of Gai Kan Bian Wei Hui and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This article addresses the pervasive issue of fraud in financial transactions by introducing the Graph Attention Network (GAN) into graph neural networks. The article integrates Node Attention Networks and Semantic Attention Networks to construct a Dual-Head Attention Network module, enabling a comprehensive analysis of complex relationships in user transaction data. This approach adeptly handles non-linear features and intricate data interaction relationships. The article incorporates a Gradient-Boosting Decision Tree (GBDT) to enhance fraud identification to create the GBDT–Dual-channel Graph Attention Network (GBDT-DGAN). In a bid to ensure user privacy, this article introduces blockchain technology, culminating in the development of a financial anti-fraud model that fuses blockchain with the GBDT-DGAN algorithm. Experimental verification demonstrates the model’s accuracy, reaching 93.82%, a notable improvement of at least 5.76% compared to baseline algorithms such as Convolutional Neural Networks. The recall and F1 values stand at 89.5% and 81.66%, respectively. Additionally, the model exhibits superior network data transmission security, maintaining a packet loss rate below 7%. Consequently, the proposed model significantly outperforms traditional approaches in financial fraud detection accuracy and ensures excellent network data transmission security, offering an efficient and secure solution for fraud detection in the financial domain.

Emotion recognition is an important part of human-computer interaction and human communication information is multi-model. Despite advancements in emotion recognition models, certain challenges persist. The first problem (Problem 1) pertains to the predominant focus in existing research on mining the interaction information between modes and the context information in the dialogue process but neglects to mine the role information between multi-model states and context information in the dialogue process. The second problem (Problem 2) is in the context information of the dialogue where the information is not completely transmitted in a temporal structure. Aiming at these two problems, we propose a multi-model fusion dialogue graph attention network (MM DialogueGAT). To solve the problem 1, the bidirectional GRU mechanism is used to extract the information from each model. In the multi-model information fusion problem, different model configurations and different combinations use the cross-model multi-head attention mechanism to establish a multi-head attention layer. Text, video and audio information are used as the main and auxiliary modes for information fusion. To solve the problem 2, in the temporal context information extraction problem, the GAT graph structure is used to capture the context information in the mode. The results show that our model achieves good results using the IMEOCAP datasets.