Counterfeit agricultural products pose a significant challenge to global food security and economic stability, necessitating advanced detection mechanisms to ensure authenticity and quality. To address this pressing i...Counterfeit agricultural products pose a significant challenge to global food security and economic stability, necessitating advanced detection mechanisms to ensure authenticity and quality. To address this pressing issue, we introduce iGFruit, an innovative model designed to enhance the detection of counterfeit agricultural products by integrating multimodal data processing. Our approach utilizes both image and text data for comprehensive feature extraction, employing advanced backbone models such as Vision Transformer (ViT), Normalizer-Free Network (NFNet), and Bidirectional Encoder Representations from Transformers (BERT). These extracted features are fused and processed using a Graph Attention Network (GAT) to capture intricate relationships within the multimodal data. The resulting fused representation is subsequently classified to detect counterfeit products with high precision. We validate the effectiveness of iGFruit through extensive experiments on two datasets: the publicly available MIT-States dataset and the proprietary TLU-States dataset, achieving state-of-the-art performance on both benchmarks. Specifically, iGFruit demonstrates an improvement of over 3% in average accuracy compared to baseline models, all while maintaining computational efficiency during inference. This work underscores the necessity and innovativeness of integrating graph-based feature learning to tackle the critical issue of counterfeit agricultural product detection.展开更多
Numerous works prove that existing neighbor-averaging graph neural networks(GNNs)cannot efficiently catch structure features,and many works show that injecting structure,distance,position,or spatial features can signi...Numerous works prove that existing neighbor-averaging graph neural networks(GNNs)cannot efficiently catch structure features,and many works show that injecting structure,distance,position,or spatial features can significantly improve the performance of GNNs,however,injecting high-level structure and distance into GNNs is an intuitive but untouched idea.This work sheds light on this issue and proposes a scheme to enhance graph attention networks(GATs)by encoding distance and hop-wise structure statistics.Firstly,the hop-wise structure and distributional distance information are extracted based on several hop-wise ego-nets of every target node.Secondly,the derived structure information,distance information,and intrinsic features are encoded into the same vector space and then added together to get initial embedding vectors.Thirdly,the derived embedding vectors are fed into GATs,such as GAT and adaptive graph diffusion network(AGDN)to get the soft labels.Fourthly,the soft labels are fed into correct and smooth(C&S)to conduct label propagation and get final predictions.Experiments show that the distance and hop-wise structures encoding enhanced graph attention networks(DHSEGATs)achieve a competitive result.展开更多
Automatic text summarization(ATS)plays a significant role in Natural Language Processing(NLP).Abstractive summarization produces summaries by identifying and compressing the most important information in a document.Ho...Automatic text summarization(ATS)plays a significant role in Natural Language Processing(NLP).Abstractive summarization produces summaries by identifying and compressing the most important information in a document.However,there are only relatively several comprehensively evaluated abstractive summarization models that work well for specific types of reports due to their unstructured and oral language text characteristics.In particular,Chinese complaint reports,generated by urban complainers and collected by government employees,describe existing resident problems in daily life.Meanwhile,the reflected problems are required to respond speedily.Therefore,automatic summarization tasks for these reports have been developed.However,similar to traditional summarization models,the generated summaries still exist problems of informativeness and conciseness.To address these issues and generate suitably informative and less redundant summaries,a topic-based abstractive summarization method is proposed to obtain global and local features.Additionally,a heterogeneous graph of the original document is constructed using word-level and topic-level features.Experiments and analyses on public review datasets(Yelp and Amazon)and our constructed dataset(Chinese complaint reports)show that the proposed framework effectively improves the performance of the abstractive summarization model for Chinese complaint reports.展开更多
Conductive polymer nanocomposites have emerged as essential materials for wearable devices.In this study,we propose a novel approach that combines graph attention networks(GAT)with an improved global pooling strategy ...Conductive polymer nanocomposites have emerged as essential materials for wearable devices.In this study,we propose a novel approach that combines graph attention networks(GAT)with an improved global pooling strategy and incremental learning.We train the GAT model on homopolymer/carbon nanotube(CNT)nanocomposite data simulated by hybrid particle-field molecular dynamics(hPF-MD)method within the CNT concentration range of 1–8%.We further analyze the conductive network structure by integrating the resistor network approach with the GAT’s attention scores,revealing optimal connectivity at a 7%concentration.The comparative analysis of trained data and the reconstructed network,based on the attention scores,underscores the GATmodel’s ability in learning network structural representations.This work not only validates the efficacy of the GAT model in property prediction and interpretable network structure analysis of polymer nanocomposites but also lays a cornerstone for the reverse engineering of polymer composites.展开更多
Recent advances in machine learning have demonstrated an enormous utility of deep learning approaches,particularly Graph Neural Networks(GNNs)for materials science.These methods have emerged as powerful tools for high...Recent advances in machine learning have demonstrated an enormous utility of deep learning approaches,particularly Graph Neural Networks(GNNs)for materials science.These methods have emerged as powerful tools for high-throughput prediction of material properties,offering a compelling enhancement and alternative to traditional first-principles calculations.While the community has predominantly focused on developing increasingly complex and universal models to enhance predictive accuracy,such approaches often lack physical interpretability and insights into materials behavior.Here,we introduce a novel computational paradigm—Self-Adaptable Graph Attention Networks integrated with Symbolic Regression(SA-GAT-SR)—that synergistically combines the predictive capability of GNNs with the interpretative power of symbolic regression.Our framework employs a self-adaptable encoding algorithm that automatically identifies and adjust attention weights so as to screen critical features from an expansive 180-dimensional feature space while maintainingO(n)computational scaling.The integratedSRmodule subsequently distills these features into compact analytical expressions that explicitly reveal quantum-mechanically meaningful relationships,achieving 23×acceleration compared to conventional SR implementations that heavily rely on first-principle calculations-derived features as input.This work suggests a new framework in computational materials science,bridging the gap between predictive accuracy and physical interpretability,offering valuable physical insights into material behavior.展开更多
Precise traffic flow forecasting is essential for mitigating urban traffic congestion.However,it is difficult for existing methods to adequately capture the dynamic spatio-temporal characteristics and multiscale tempo...Precise traffic flow forecasting is essential for mitigating urban traffic congestion.However,it is difficult for existing methods to adequately capture the dynamic spatio-temporal characteristics and multiscale temporal dependencies of traffic flow.A traffic flow prediction model with multiscale temporal awareness and graph diffusion attention networks(MT-GDAN)is proposed to address these issues.Specifically,a graph diffusion attention module is constructed,which dynamically adjusts and calculates the weights of neighboring nodes in the graph structure using a random graph attention network(GAT)and captures the spatial characteristics of hidden nodes through an adaptive adjacency matrix,thus better exploiting the dynamic spatio-temporal properties of traffic flow.Secondly,a multiscale isometric convolutional network and bi-level routing attention are used to construct a multiscale temporal awareness module.The former extracts local information of traffic flow segments by convolution with different sizes of convolution kernels and then introduces isometric convolution to obtain the global temporal relationship between local features of traffic flow segments;the latter filters irrelevant spatio-temporal features at a coarse regional level and focuses locally on key points to more accurately capture the multiscale temporal dependencies of traffic flows.Experimental results reveal that the MT-GDAN model surpasses the mainstream baseline model in terms of forecasting accuracy and exhibits good prediction performance.展开更多
Designing materials with targeted lattice thermal conductivity(LTC)demands electronic-level insight into chemical bonding.We introduce two bonding descriptors,namely normalized negative integrated COHP(-ICOHP)and norm...Designing materials with targeted lattice thermal conductivity(LTC)demands electronic-level insight into chemical bonding.We introduce two bonding descriptors,namely normalized negative integrated COHP(-ICOHP)and normalized integrated COBI,that correlate strongly with LTC and rattling(meansquared displacement),surpassing empirical rules and the unnormalized−ICOHP across>4500 inorganic crystals by first-principles.We train a crystal attention graph neural network(CATGNN)to predict these descriptors and screen~200,000 database structures for extreme LTCs.From 367(533)candidates with low(high)normalized-ICOHP and normalized ICOBI,first-principles validation identifies 106 dynamically stable compounds with LTC<5Wm^(−1)K^(−1)(68%<2Wm^(−1)K^(−1))and 13 stable compounds with LTC>100Wm^(−1)K^(−1).The descriptors’low cost and clear physical meaning provide a rapid,reliable route to high-throughput discovery and inverse design of crystalline materials with ultralow or ultrahigh LTC for applications in thermal insulation,thermoelectrics,and electronics cooling.展开更多
Dialogue State Tracking(DST)is a critical component of task-oriented spoken dialogue systems(SDS),tasked with maintaining an accurate representation of the conversational state by predicting slots and their correspond...Dialogue State Tracking(DST)is a critical component of task-oriented spoken dialogue systems(SDS),tasked with maintaining an accurate representation of the conversational state by predicting slots and their corresponding values.Recent advances leverage Large Language Models(LLMs)with prompt-based tuning to improve tracking accuracy and efficiency.However,these approaches often incur substantial computational and memory overheads and typically address slot extraction implicitly within prompts,without explicitly modeling the complex dependencies between slots and values.In this work,we propose PUGG,a novel DST framework that constructs schema-driven prompts to fine-tune GPT-2 and utilizes its tokenizer to implement a memory encoder.PUGG explicitly extracts slot values via GPT-2 and employs Graph Attention Networks(GATs)to model and reason over the intricate relationships between slots and their associated values.We evaluate PUGG on four publicly available datasets,where it achieves stateof-the-art performance across multiple evaluation metrics,highlighting its robustness and generalizability in diverse conversational scenarios.Our results indicate that the integration of GPT-2 substantially reduces model complexity and memory consumption by streamlining key processes.Moreover,prompt tuning enhances the model’s flexibility and precision in extracting relevant slot-value pairs,while the incorporation of GATs facilitates effective relational reasoning,leading to improved dialogue state representations.展开更多
Anomaly fluctuations in operating conditions, catalyst wear, crushing, and the deterioration of feedstock properties in fluid catalytic cracking (FCC) units can disrupt the normal circulating fluidization process of t...Anomaly fluctuations in operating conditions, catalyst wear, crushing, and the deterioration of feedstock properties in fluid catalytic cracking (FCC) units can disrupt the normal circulating fluidization process of the catalyst. Although several effective models have been proposed in previous research to address anomaly detection in chemical processes, most fail to adequately capture the spatial-temporal dependencies of multi-source, mixed-frequency information. In this study, an innovative multi-source mixed-frequency information fusion framework based on a spatial-temporal graph attention network (MIF-STGAT) is proposed to investigate the causes of FCC regenerator catalyst loss anomalies for guide onsite operational management, enhancing the long-term stability of FCC unit operations. First, a reconstruction-based dual-encoder-decoder framework is developed to facilitate the acquisition of mixed-frequency features and information fusion during the FCC regenerator catalyst loss process. Subsequently, a graph attention network and a multilayer long short-term memory network with a differential structure are integrated into the reconstruction-based dual-encoder-shared-decoder framework to capture the dynamic fluctuations and critical features associated with anomalies. Experimental results from the Chinese FCC industrial process demonstrate that MIF-STGAT achieves excellent accuracy and interpretability for anomaly detection.展开更多
It is known that long non-coding RNAs(lncRNAs)play vital roles in biological processes and contribute to the progression,development,and treatment of various diseases.Obviously,understanding associations between disea...It is known that long non-coding RNAs(lncRNAs)play vital roles in biological processes and contribute to the progression,development,and treatment of various diseases.Obviously,understanding associations between diseases and lncRNAs significantly enhances our ability to interpret disease mechanisms.Nevertheless,the process of determining lncRNA-disease associations is costly,labor-intensive,and time-consuming.Hence,it is expected to foster computational strategies to uncover lncRNA-disease relationships for further verification to save time and resources.In this study,a collaborative filtering and graph attention network-based LncRNA-Disease Association(CFGANLDA)method was nominated to expose potential lncRNA-disease associations.First,it takes into account the advantages of using biological information from multiple sources.Next,it uses a collaborative filtering technique in order to address the sparse data problem.It also employs a graph attention network to reinforce both linear and non-linear features of the associations to advance prediction performance.The computational results indicate that CFGANLDA gains better prediction performance compared to other state-of-the-art approaches.The CFGANLDA’s area under the receiver operating characteristic curve(AUC)metric is 0.9835,whereas its area under the precision-recall curve(AUPR)metric is 0.9822.Statistical analysis using 10-fold cross-validation experiments proves that these metrics are significant.Furthermore,three case studies on prostate,liver,and stomach cancers attest to the validity of CFGANLDA performance.As a result,CFGANLDA method proves to be a valued tool for lncRNA-disease association prediction.展开更多
Pedestrian trajectory prediction is pivotal and challenging in applications such as autonomous driving,social robotics,and intelligent surveillance systems.Pedestrian trajectory is governed not only by individual inte...Pedestrian trajectory prediction is pivotal and challenging in applications such as autonomous driving,social robotics,and intelligent surveillance systems.Pedestrian trajectory is governed not only by individual intent but also by interactions with surrounding agents.These interactions are critical to trajectory prediction accuracy.While prior studies have employed Convolutional Neural Networks(CNNs)and Graph Convolutional Networks(GCNs)to model such interactions,these methods fail to distinguish varying influence levels among neighboring pedestrians.To address this,we propose a novel model based on a bidirectional graph attention network and spatio-temporal graphs to capture dynamic interactions.Specifically,we construct temporal and spatial graphs encoding the sequential evolution and spatial proximity among pedestrians.These features are then fused and processed by the Bidirectional Graph Attention Network(Bi-GAT),which models the bidirectional interactions between the target pedestrian and its neighbors.The model computes node attention weights(i.e.,similarity scores)to differentially aggregate neighbor information,enabling fine-grained interaction representations.Extensive experiments conducted on two widely used pedestrian trajectory prediction benchmark datasets demonstrate that our approach outperforms existing state-of-theartmethods regarding Average Displacement Error(ADE)and Final Displacement Error(FDE),highlighting its strong prediction accuracy and generalization capability.展开更多
Quantum error-correcting codes are essential for fault-tolerant quantum computing,as they effectively detect and correct noise-induced errors by distributing information across multiple physical qubits.The subsystem s...Quantum error-correcting codes are essential for fault-tolerant quantum computing,as they effectively detect and correct noise-induced errors by distributing information across multiple physical qubits.The subsystem surface code with three-qubit check operators demonstrates significant application potential due to its simplified measurement operations and low logical error rates.However,the existing minimum-weight perfect matching(MWPM)algorithm exhibits high computational complexity and lacks flexibility in large-scale systems.Therefore,this paper proposes a decoder based on a graph attention network(GAT),representing error syndromes as undirected graphs with edge weights,and employing a multihead attention mechanism to efficiently aggregate node features and enable parallel computation.Compared to MWPM,the GAT decoder exhibits linear growth in computational complexity,adapts to different quantum code structures,and demonstrates stronger robustness under high physical error rates.The experimental results demonstrate that the proposed decoder achieves an overall accuracy of 89.95%under various small code lattice sizes(L=2,3,4,5),with the logical error rate threshold increasing to 0.0078,representing an improvement of approximately 13.04%compared to the MWPM decoder.This result significantly outperforms traditional methods,showcasing superior performance under small code lattice sizes and providing a more efficient decoding solution for large-scale quantum error correction.展开更多
Dear Editor,This letter proposes the graph tensor alliance attention network(GT-A^(2)T)to represent a dynamic graph(DG)precisely.Its main idea includes 1)Establishing a unified spatio-temporal message propagation fram...Dear Editor,This letter proposes the graph tensor alliance attention network(GT-A^(2)T)to represent a dynamic graph(DG)precisely.Its main idea includes 1)Establishing a unified spatio-temporal message propagation framework on a DG via the tensor product for capturing the complex cohesive spatio-temporal interdependencies precisely and 2)Acquiring the alliance attention scores by node features and favorable high-order structural correlations.展开更多
Recent advances in spatially resolved transcriptomics(SRT)have provided new opportunities for characterizing spatial structures of various tissues.Graph-based geometric deep learning has gained widespread adoption for...Recent advances in spatially resolved transcriptomics(SRT)have provided new opportunities for characterizing spatial structures of various tissues.Graph-based geometric deep learning has 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 presents superior domain identification performance on multiple datasets generated from different protocols.Using SpaGRA,we analyze the functional regions in the mouse hypothalamus,identify key genes related to heart development in mouse embryos,and observe cancer-associated fibroblasts enveloping cancer cells in the latest Visium HD data.Overall,SpaGRA can effectively characterize spatial structures across diverse SRT datasets.展开更多
With the continuous development of artificial intelligence and natural language processing technologies, traditional retrieval-augmented generation (RAG) techniques face numerous challenges in document answer precisio...With the continuous development of artificial intelligence and natural language processing technologies, traditional retrieval-augmented generation (RAG) techniques face numerous challenges in document answer precision and similarity measurement. This study, set against the backdrop of the shipping industry, combines top-down and bottom-up schema design strategies to achieve precise and flexible knowledge representation. The research adopts a semi-structured approach, innovatively constructing an adaptive schema generation mechanism based on reinforcement learning, which models the knowledge graph construction process as a Markov decision process. This method begins with general concepts, defining foundational industry concepts, and then delves into abstracting core concepts specific to the maritime domain through an adaptive pattern generation mechanism that dynamically adjusts the knowledge structure. Specifically, the study designs a four-layer knowledge construction framework, including the data layer, modeling layer, technology layer, and application layer. It draws on a mutual indexing strategy, integrating large language models and traditional information extraction techniques. By leveraging self-attention mechanisms and graph attention networks, it efficiently extracts semantic relationships. The introduction of logic-form-driven solvers and symbolic decomposition techniques for reasoning significantly enhances the model’s ability to understand complex semantic relationships. Additionally, the use of open information extraction and knowledge alignment techniques further improves the efficiency and accuracy of information retrieval. Experimental results demonstrate that the proposed method not only achieves significant performance improvements in knowledge graph retrieval within the shipping domain but also holds important theoretical innovation and practical application value.展开更多
Social robot accounts controlled by artificial intelligence or humans are active in social networks,bringing negative impacts to network security and social life.Existing social robot detection methods based on graph ...Social robot accounts controlled by artificial intelligence or humans are active in social networks,bringing negative impacts to network security and social life.Existing social robot detection methods based on graph neural networks suffer from the problem of many social network nodes and complex relationships,which makes it difficult to accurately describe the difference between the topological relations of nodes,resulting in low detection accuracy of social robots.This paper proposes a social robot detection method with the use of an improved neural network.First,social relationship subgraphs are constructed by leveraging the user’s social network to disentangle intricate social relationships effectively.Then,a linear modulated graph attention residual network model is devised to extract the node and network topology features of the social relation subgraph,thereby generating comprehensive social relation subgraph features,and the feature-wise linear modulation module of the model can better learn the differences between the nodes.Next,user text content and behavioral gene sequences are extracted to construct social behavioral features combined with the social relationship subgraph features.Finally,social robots can be more accurately identified by combining user behavioral and relationship features.By carrying out experimental studies based on the publicly available datasets TwiBot-20 and Cresci-15,the suggested method’s detection accuracies can achieve 86.73%and 97.86%,respectively.Compared with the existing mainstream approaches,the accuracy of the proposed method is 2.2%and 1.35%higher on the two datasets.The results show that the method proposed in this paper can effectively detect social robots and maintain a healthy ecological environment of social networks.展开更多
Continuous sign language recognition(CSLR)is challenging due to the complexity of video background,hand gesture variability,and temporal modeling difficulties.This work proposes a CSLR method based on a spatialtempora...Continuous sign language recognition(CSLR)is challenging due to the complexity of video background,hand gesture variability,and temporal modeling difficulties.This work proposes a CSLR method based on a spatialtemporal graph attention network to focus on essential features of video series.The method considers local details of sign language movements by taking the information on joints and bones as inputs and constructing a spatialtemporal graph to reflect inter-frame relevance and physical connections between nodes.The graph-based multihead attention mechanism is utilized with adjacent matrix calculation for better local-feature exploration,and short-term motion correlation modeling is completed via a temporal convolutional network.We adopted BLSTM to learn the long-termdependence and connectionist temporal classification to align the word-level sequences.The proposed method achieves competitive results regarding word error rates(1.59%)on the Chinese Sign Language dataset and the mean Jaccard Index(65.78%)on the ChaLearn LAP Continuous Gesture Dataset.展开更多
Recent advances in spatially resolved transcriptomic technologies have enabled unprecedented opportunities to elucidate tissue architecture and function in situ.Spatial transcriptomics can provide multimodal and compl...Recent advances in spatially resolved transcriptomic technologies have enabled unprecedented opportunities to elucidate tissue architecture and function in situ.Spatial transcriptomics can provide multimodal and complementary information simultaneously,including gene expression profiles,spatial locations,and histology images.However,most existing methods have limitations in efficiently utilizing spatial information and matched high-resolution histology images.To fully leverage the multi-modal information,we propose a SPAtially embedded Deep Attentional graph Clustering(SpaDAC)method to identify spatial domains while reconstructing denoised gene expression profiles.This method can efficiently learn the low-dimensional embeddings for spatial transcriptomics data by constructing multi-view graph modules to capture both spatial location connectives and morphological connectives.Benchmark results demonstrate that SpaDAC outperforms other algorithms on several recent spatial transcriptomics datasets.SpaDAC is a valuable tool for spatial domain detection,facilitating the comprehension of tissue architecture and cellular microenvironment.The source code of SpaDAC is freely available at Github(https://github.com/huoyuying/SpaDAC.git).展开更多
For permanent faults(PF)in the power communication network(PCN),such as link interruptions,the timesensitive networking(TSN)relied on by PCN,typically employs spatial redundancy fault-tolerance methods to keep service...For permanent faults(PF)in the power communication network(PCN),such as link interruptions,the timesensitive networking(TSN)relied on by PCN,typically employs spatial redundancy fault-tolerance methods to keep service stability and reliability,which often limits TSN scheduling performance in fault-free ideal states.So this paper proposes a graph attention residual network-based routing and fault-tolerant scheduling mechanism(GRFS)for data flow in PCN,which specifically includes a communication system architecture for integrated terminals based on a cyclic queuing and forwarding(CQF)model and fault recovery method,which reduces the impact of faults by simplified scheduling configurations of CQF and fault-tolerance of prioritizing the rerouting of faulty time-sensitive(TS)flows;considering that PF leading to changes in network topology is more appropriately solved by doing routing and time slot injection decisions hop-by-hop,and that reasonable network load can reduce the damage caused by PF and reserve resources for the rerouting of faulty TS flows,an optimization model for joint routing and scheduling is constructed with scheduling success rate as the objective,and with traffic latency and network load as constraints;to catch changes in TSN topology and traffic load,a D3QN algorithm based on a multi-head graph attention residual network(MGAR)is designed to solve the problem model,where the MGAR based encoder reconstructs the TSN status into feature embedding vectors,and a dueling network decoder performs decoding tasks on the reconstructed feature embedding vectors.Simulation results show that GRFS outperforms heuristic fault-tolerance algorithms and other benchmark schemes by approximately 10%in routing and scheduling success rate in ideal states and 5%in rerouting and rescheduling success rate in fault states.展开更多
PM2.5 concentration prediction is of great significance to environmental protection and human health.Achieving accurate prediction of PM2.5 concentration has become an important research task.However,PM2.5 pollutants ...PM2.5 concentration prediction is of great significance to environmental protection and human health.Achieving accurate prediction of PM2.5 concentration has become an important research task.However,PM2.5 pollutants can spread in the earth’s atmosphere,causing mutual influence between different cities.To effectively capture the air pollution relationship between cities,this paper proposes a novel spatiotemporal model combining graph attention neural network(GAT)and gated recurrent unit(GRU),named GAT-GRU for PM2.5 concentration prediction.Specifically,GAT is used to learn the spatial dependence of PM2.5 concentration data in different cities,and GRU is to extract the temporal dependence of the long-term data series.The proposed model integrates the learned spatio-temporal dependencies to capture long-term complex spatio-temporal features.Considering that air pollution is related to the meteorological conditions of the city,the knowledge acquired from meteorological data is used in the model to enhance PM2.5 prediction performance.The input of the GAT-GRU model consists of PM2.5 concentration data and meteorological data.In order to verify the effectiveness of the proposed GAT-GRU prediction model,this paper designs experiments on real-world datasets compared with other baselines.Experimental results prove that our model achieves excellent performance in PM2.5 concentration prediction.展开更多
文摘Counterfeit agricultural products pose a significant challenge to global food security and economic stability, necessitating advanced detection mechanisms to ensure authenticity and quality. To address this pressing issue, we introduce iGFruit, an innovative model designed to enhance the detection of counterfeit agricultural products by integrating multimodal data processing. Our approach utilizes both image and text data for comprehensive feature extraction, employing advanced backbone models such as Vision Transformer (ViT), Normalizer-Free Network (NFNet), and Bidirectional Encoder Representations from Transformers (BERT). These extracted features are fused and processed using a Graph Attention Network (GAT) to capture intricate relationships within the multimodal data. The resulting fused representation is subsequently classified to detect counterfeit products with high precision. We validate the effectiveness of iGFruit through extensive experiments on two datasets: the publicly available MIT-States dataset and the proprietary TLU-States dataset, achieving state-of-the-art performance on both benchmarks. Specifically, iGFruit demonstrates an improvement of over 3% in average accuracy compared to baseline models, all while maintaining computational efficiency during inference. This work underscores the necessity and innovativeness of integrating graph-based feature learning to tackle the critical issue of counterfeit agricultural product detection.
文摘Numerous works prove that existing neighbor-averaging graph neural networks(GNNs)cannot efficiently catch structure features,and many works show that injecting structure,distance,position,or spatial features can significantly improve the performance of GNNs,however,injecting high-level structure and distance into GNNs is an intuitive but untouched idea.This work sheds light on this issue and proposes a scheme to enhance graph attention networks(GATs)by encoding distance and hop-wise structure statistics.Firstly,the hop-wise structure and distributional distance information are extracted based on several hop-wise ego-nets of every target node.Secondly,the derived structure information,distance information,and intrinsic features are encoded into the same vector space and then added together to get initial embedding vectors.Thirdly,the derived embedding vectors are fed into GATs,such as GAT and adaptive graph diffusion network(AGDN)to get the soft labels.Fourthly,the soft labels are fed into correct and smooth(C&S)to conduct label propagation and get final predictions.Experiments show that the distance and hop-wise structures encoding enhanced graph attention networks(DHSEGATs)achieve a competitive result.
基金supported byNationalNatural Science Foundation of China(52274205)and Project of Education Department of Liaoning Province(LJKZ0338).
文摘Automatic text summarization(ATS)plays a significant role in Natural Language Processing(NLP).Abstractive summarization produces summaries by identifying and compressing the most important information in a document.However,there are only relatively several comprehensively evaluated abstractive summarization models that work well for specific types of reports due to their unstructured and oral language text characteristics.In particular,Chinese complaint reports,generated by urban complainers and collected by government employees,describe existing resident problems in daily life.Meanwhile,the reflected problems are required to respond speedily.Therefore,automatic summarization tasks for these reports have been developed.However,similar to traditional summarization models,the generated summaries still exist problems of informativeness and conciseness.To address these issues and generate suitably informative and less redundant summaries,a topic-based abstractive summarization method is proposed to obtain global and local features.Additionally,a heterogeneous graph of the original document is constructed using word-level and topic-level features.Experiments and analyses on public review datasets(Yelp and Amazon)and our constructed dataset(Chinese complaint reports)show that the proposed framework effectively improves the performance of the abstractive summarization model for Chinese complaint reports.
基金support from the National Natural Science Foundation of China(52273019)Fundamental Research Funds for the Central Universities(044420250076)+2 种基金General Program of National Natural Science Foundation of Liao Ning Province(2025-MS-105)Scientific Research Funds Project of Liaoning Provincial Department of Education(LJKZ0034)Beijing Natural Science Foundation(4242040).
文摘Conductive polymer nanocomposites have emerged as essential materials for wearable devices.In this study,we propose a novel approach that combines graph attention networks(GAT)with an improved global pooling strategy and incremental learning.We train the GAT model on homopolymer/carbon nanotube(CNT)nanocomposite data simulated by hybrid particle-field molecular dynamics(hPF-MD)method within the CNT concentration range of 1–8%.We further analyze the conductive network structure by integrating the resistor network approach with the GAT’s attention scores,revealing optimal connectivity at a 7%concentration.The comparative analysis of trained data and the reconstructed network,based on the attention scores,underscores the GATmodel’s ability in learning network structural representations.This work not only validates the efficacy of the GAT model in property prediction and interpretable network structure analysis of polymer nanocomposites but also lays a cornerstone for the reverse engineering of polymer composites.
基金supported by National Natural Science Foundation of China (No.12374057)Fundamental Research Funds for the Central Universities. The work (S.T.) at Los Alamos National Laboratory (LANL) was performed at the Center for Integrated Nanotechnologies (CINT), a U.S. Department of Energy, Office of Science user facility at LANL.
文摘Recent advances in machine learning have demonstrated an enormous utility of deep learning approaches,particularly Graph Neural Networks(GNNs)for materials science.These methods have emerged as powerful tools for high-throughput prediction of material properties,offering a compelling enhancement and alternative to traditional first-principles calculations.While the community has predominantly focused on developing increasingly complex and universal models to enhance predictive accuracy,such approaches often lack physical interpretability and insights into materials behavior.Here,we introduce a novel computational paradigm—Self-Adaptable Graph Attention Networks integrated with Symbolic Regression(SA-GAT-SR)—that synergistically combines the predictive capability of GNNs with the interpretative power of symbolic regression.Our framework employs a self-adaptable encoding algorithm that automatically identifies and adjust attention weights so as to screen critical features from an expansive 180-dimensional feature space while maintainingO(n)computational scaling.The integratedSRmodule subsequently distills these features into compact analytical expressions that explicitly reveal quantum-mechanically meaningful relationships,achieving 23×acceleration compared to conventional SR implementations that heavily rely on first-principle calculations-derived features as input.This work suggests a new framework in computational materials science,bridging the gap between predictive accuracy and physical interpretability,offering valuable physical insights into material behavior.
基金Supported by the by Key R&D Program of Gansu Province(No.23YFGA0063)the Key Talent Project of Gansu Province(No.2024RCXM57,2024RCXM22)the Major Science and Technology Special Program of Gansu Province(No.25ZYJA037).
文摘Precise traffic flow forecasting is essential for mitigating urban traffic congestion.However,it is difficult for existing methods to adequately capture the dynamic spatio-temporal characteristics and multiscale temporal dependencies of traffic flow.A traffic flow prediction model with multiscale temporal awareness and graph diffusion attention networks(MT-GDAN)is proposed to address these issues.Specifically,a graph diffusion attention module is constructed,which dynamically adjusts and calculates the weights of neighboring nodes in the graph structure using a random graph attention network(GAT)and captures the spatial characteristics of hidden nodes through an adaptive adjacency matrix,thus better exploiting the dynamic spatio-temporal properties of traffic flow.Secondly,a multiscale isometric convolutional network and bi-level routing attention are used to construct a multiscale temporal awareness module.The former extracts local information of traffic flow segments by convolution with different sizes of convolution kernels and then introduces isometric convolution to obtain the global temporal relationship between local features of traffic flow segments;the latter filters irrelevant spatio-temporal features at a coarse regional level and focuses locally on key points to more accurately capture the multiscale temporal dependencies of traffic flows.Experimental results reveal that the MT-GDAN model surpasses the mainstream baseline model in terms of forecasting accuracy and exhibits good prediction performance.
基金supported in part by the NSF(award numbers 2110033,2311202,2320292)SC EPSCoR/IDeA Program under NSF OIA-1655740(23-GC01)+2 种基金R.R.acknowledges financial support by the Severo Ochoa Centers of Excellence Program under grant CEX2023-001263-Sby the Generalitat de Catalunya under grant 2021 SGR 01519Calculations were performed at the Centro de Supercomputación de Galicia(CESGA)within actions FI-2023-1-0003,FI-2023-2-0005,and FI-2024-1-0012 of the Red Española de Supercomputación(RES).
文摘Designing materials with targeted lattice thermal conductivity(LTC)demands electronic-level insight into chemical bonding.We introduce two bonding descriptors,namely normalized negative integrated COHP(-ICOHP)and normalized integrated COBI,that correlate strongly with LTC and rattling(meansquared displacement),surpassing empirical rules and the unnormalized−ICOHP across>4500 inorganic crystals by first-principles.We train a crystal attention graph neural network(CATGNN)to predict these descriptors and screen~200,000 database structures for extreme LTCs.From 367(533)candidates with low(high)normalized-ICOHP and normalized ICOBI,first-principles validation identifies 106 dynamically stable compounds with LTC<5Wm^(−1)K^(−1)(68%<2Wm^(−1)K^(−1))and 13 stable compounds with LTC>100Wm^(−1)K^(−1).The descriptors’low cost and clear physical meaning provide a rapid,reliable route to high-throughput discovery and inverse design of crystalline materials with ultralow or ultrahigh LTC for applications in thermal insulation,thermoelectrics,and electronics cooling.
基金supported by the MSIT(Ministry of Science and ICT),Republic of Korea,under the ITRC(Information Technology Research Centre)support program(IITP-2024-RS-2024-00437191)supervised by the IITP(Institute for Information&Communications Technology Planning&Evaluation).
文摘Dialogue State Tracking(DST)is a critical component of task-oriented spoken dialogue systems(SDS),tasked with maintaining an accurate representation of the conversational state by predicting slots and their corresponding values.Recent advances leverage Large Language Models(LLMs)with prompt-based tuning to improve tracking accuracy and efficiency.However,these approaches often incur substantial computational and memory overheads and typically address slot extraction implicitly within prompts,without explicitly modeling the complex dependencies between slots and values.In this work,we propose PUGG,a novel DST framework that constructs schema-driven prompts to fine-tune GPT-2 and utilizes its tokenizer to implement a memory encoder.PUGG explicitly extracts slot values via GPT-2 and employs Graph Attention Networks(GATs)to model and reason over the intricate relationships between slots and their associated values.We evaluate PUGG on four publicly available datasets,where it achieves stateof-the-art performance across multiple evaluation metrics,highlighting its robustness and generalizability in diverse conversational scenarios.Our results indicate that the integration of GPT-2 substantially reduces model complexity and memory consumption by streamlining key processes.Moreover,prompt tuning enhances the model’s flexibility and precision in extracting relevant slot-value pairs,while the incorporation of GATs facilitates effective relational reasoning,leading to improved dialogue state representations.
基金supported by the Innovative Research Group Project of the National Natural Science Foundation of China(22021004)Sinopec Major Science and Technology Projects(321123-1).
文摘Anomaly fluctuations in operating conditions, catalyst wear, crushing, and the deterioration of feedstock properties in fluid catalytic cracking (FCC) units can disrupt the normal circulating fluidization process of the catalyst. Although several effective models have been proposed in previous research to address anomaly detection in chemical processes, most fail to adequately capture the spatial-temporal dependencies of multi-source, mixed-frequency information. In this study, an innovative multi-source mixed-frequency information fusion framework based on a spatial-temporal graph attention network (MIF-STGAT) is proposed to investigate the causes of FCC regenerator catalyst loss anomalies for guide onsite operational management, enhancing the long-term stability of FCC unit operations. First, a reconstruction-based dual-encoder-decoder framework is developed to facilitate the acquisition of mixed-frequency features and information fusion during the FCC regenerator catalyst loss process. Subsequently, a graph attention network and a multilayer long short-term memory network with a differential structure are integrated into the reconstruction-based dual-encoder-shared-decoder framework to capture the dynamic fluctuations and critical features associated with anomalies. Experimental results from the Chinese FCC industrial process demonstrate that MIF-STGAT achieves excellent accuracy and interpretability for anomaly detection.
基金supported by the Vietnam Ministry of Education and Training under project code B2023-SPH-14。
文摘It is known that long non-coding RNAs(lncRNAs)play vital roles in biological processes and contribute to the progression,development,and treatment of various diseases.Obviously,understanding associations between diseases and lncRNAs significantly enhances our ability to interpret disease mechanisms.Nevertheless,the process of determining lncRNA-disease associations is costly,labor-intensive,and time-consuming.Hence,it is expected to foster computational strategies to uncover lncRNA-disease relationships for further verification to save time and resources.In this study,a collaborative filtering and graph attention network-based LncRNA-Disease Association(CFGANLDA)method was nominated to expose potential lncRNA-disease associations.First,it takes into account the advantages of using biological information from multiple sources.Next,it uses a collaborative filtering technique in order to address the sparse data problem.It also employs a graph attention network to reinforce both linear and non-linear features of the associations to advance prediction performance.The computational results indicate that CFGANLDA gains better prediction performance compared to other state-of-the-art approaches.The CFGANLDA’s area under the receiver operating characteristic curve(AUC)metric is 0.9835,whereas its area under the precision-recall curve(AUPR)metric is 0.9822.Statistical analysis using 10-fold cross-validation experiments proves that these metrics are significant.Furthermore,three case studies on prostate,liver,and stomach cancers attest to the validity of CFGANLDA performance.As a result,CFGANLDA method proves to be a valued tool for lncRNA-disease association prediction.
基金funded by the National Natural Science Foundation of China,grant number 624010funded by the Natural Science Foundation of Anhui Province,grant number 2408085QF202+1 种基金funded by the Anhui Future Technology Research Institute Industry Guidance Fund Project,grant number 2023cyyd04funded by the Project of Research of Anhui Polytechnic University,grant number Xjky2022150.
文摘Pedestrian trajectory prediction is pivotal and challenging in applications such as autonomous driving,social robotics,and intelligent surveillance systems.Pedestrian trajectory is governed not only by individual intent but also by interactions with surrounding agents.These interactions are critical to trajectory prediction accuracy.While prior studies have employed Convolutional Neural Networks(CNNs)and Graph Convolutional Networks(GCNs)to model such interactions,these methods fail to distinguish varying influence levels among neighboring pedestrians.To address this,we propose a novel model based on a bidirectional graph attention network and spatio-temporal graphs to capture dynamic interactions.Specifically,we construct temporal and spatial graphs encoding the sequential evolution and spatial proximity among pedestrians.These features are then fused and processed by the Bidirectional Graph Attention Network(Bi-GAT),which models the bidirectional interactions between the target pedestrian and its neighbors.The model computes node attention weights(i.e.,similarity scores)to differentially aggregate neighbor information,enabling fine-grained interaction representations.Extensive experiments conducted on two widely used pedestrian trajectory prediction benchmark datasets demonstrate that our approach outperforms existing state-of-theartmethods regarding Average Displacement Error(ADE)and Final Displacement Error(FDE),highlighting its strong prediction accuracy and generalization capability.
基金Project supported by the Natural Science Foundation of Shandong Province,China(Grant No.ZR2021MF049)the Joint Fund of the Natural Science Foundation of Shandong Province,China(Grant Nos.ZR2022LLZ012 and ZR2021LLZ001)the Key Research and Development Program of Shandong Province,China(Grant No.2023CXGC010901)。
文摘Quantum error-correcting codes are essential for fault-tolerant quantum computing,as they effectively detect and correct noise-induced errors by distributing information across multiple physical qubits.The subsystem surface code with three-qubit check operators demonstrates significant application potential due to its simplified measurement operations and low logical error rates.However,the existing minimum-weight perfect matching(MWPM)algorithm exhibits high computational complexity and lacks flexibility in large-scale systems.Therefore,this paper proposes a decoder based on a graph attention network(GAT),representing error syndromes as undirected graphs with edge weights,and employing a multihead attention mechanism to efficiently aggregate node features and enable parallel computation.Compared to MWPM,the GAT decoder exhibits linear growth in computational complexity,adapts to different quantum code structures,and demonstrates stronger robustness under high physical error rates.The experimental results demonstrate that the proposed decoder achieves an overall accuracy of 89.95%under various small code lattice sizes(L=2,3,4,5),with the logical error rate threshold increasing to 0.0078,representing an improvement of approximately 13.04%compared to the MWPM decoder.This result significantly outperforms traditional methods,showcasing superior performance under small code lattice sizes and providing a more efficient decoding solution for large-scale quantum error correction.
基金supported in part by the National Natural Science Foundation of China(62372385).
文摘Dear Editor,This letter proposes the graph tensor alliance attention network(GT-A^(2)T)to represent a dynamic graph(DG)precisely.Its main idea includes 1)Establishing a unified spatio-temporal message propagation framework on a DG via the tensor product for capturing the complex cohesive spatio-temporal interdependencies precisely and 2)Acquiring the alliance attention scores by node features and favorable high-order structural correlations.
基金supported by the National Natural Science Foundation of China(Nos.62303271,U1806202,62103397)the Natural Science Foundation of Shandong Province(ZR2023QF081)Funding for open access charge:the National Natural Science Foundation of China(Nos.62303271,U1806202).
文摘Recent advances in spatially resolved transcriptomics(SRT)have provided new opportunities for characterizing spatial structures of various tissues.Graph-based geometric deep learning has 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 presents superior domain identification performance on multiple datasets generated from different protocols.Using SpaGRA,we analyze the functional regions in the mouse hypothalamus,identify key genes related to heart development in mouse embryos,and observe cancer-associated fibroblasts enveloping cancer cells in the latest Visium HD data.Overall,SpaGRA can effectively characterize spatial structures across diverse SRT datasets.
文摘With the continuous development of artificial intelligence and natural language processing technologies, traditional retrieval-augmented generation (RAG) techniques face numerous challenges in document answer precision and similarity measurement. This study, set against the backdrop of the shipping industry, combines top-down and bottom-up schema design strategies to achieve precise and flexible knowledge representation. The research adopts a semi-structured approach, innovatively constructing an adaptive schema generation mechanism based on reinforcement learning, which models the knowledge graph construction process as a Markov decision process. This method begins with general concepts, defining foundational industry concepts, and then delves into abstracting core concepts specific to the maritime domain through an adaptive pattern generation mechanism that dynamically adjusts the knowledge structure. Specifically, the study designs a four-layer knowledge construction framework, including the data layer, modeling layer, technology layer, and application layer. It draws on a mutual indexing strategy, integrating large language models and traditional information extraction techniques. By leveraging self-attention mechanisms and graph attention networks, it efficiently extracts semantic relationships. The introduction of logic-form-driven solvers and symbolic decomposition techniques for reasoning significantly enhances the model’s ability to understand complex semantic relationships. Additionally, the use of open information extraction and knowledge alignment techniques further improves the efficiency and accuracy of information retrieval. Experimental results demonstrate that the proposed method not only achieves significant performance improvements in knowledge graph retrieval within the shipping domain but also holds important theoretical innovation and practical application value.
基金This work was supported in part by the National Natural Science Foundation of China under Grants 62273272,62303375 and 61873277in part by the Key Research and Development Program of Shaanxi Province under Grant 2023-YBGY-243+2 种基金in part by the Natural Science Foundation of Shaanxi Province under Grants 2022JQ-606 and 2020-JQ758in part by the Research Plan of Department of Education of Shaanxi Province under Grant 21JK0752in part by the Youth Innovation Team of Shaanxi Universities.
文摘Social robot accounts controlled by artificial intelligence or humans are active in social networks,bringing negative impacts to network security and social life.Existing social robot detection methods based on graph neural networks suffer from the problem of many social network nodes and complex relationships,which makes it difficult to accurately describe the difference between the topological relations of nodes,resulting in low detection accuracy of social robots.This paper proposes a social robot detection method with the use of an improved neural network.First,social relationship subgraphs are constructed by leveraging the user’s social network to disentangle intricate social relationships effectively.Then,a linear modulated graph attention residual network model is devised to extract the node and network topology features of the social relation subgraph,thereby generating comprehensive social relation subgraph features,and the feature-wise linear modulation module of the model can better learn the differences between the nodes.Next,user text content and behavioral gene sequences are extracted to construct social behavioral features combined with the social relationship subgraph features.Finally,social robots can be more accurately identified by combining user behavioral and relationship features.By carrying out experimental studies based on the publicly available datasets TwiBot-20 and Cresci-15,the suggested method’s detection accuracies can achieve 86.73%and 97.86%,respectively.Compared with the existing mainstream approaches,the accuracy of the proposed method is 2.2%and 1.35%higher on the two datasets.The results show that the method proposed in this paper can effectively detect social robots and maintain a healthy ecological environment of social networks.
基金supported by the Key Research&Development Plan Project of Shandong Province,China(No.2017GGX10127).
文摘Continuous sign language recognition(CSLR)is challenging due to the complexity of video background,hand gesture variability,and temporal modeling difficulties.This work proposes a CSLR method based on a spatialtemporal graph attention network to focus on essential features of video series.The method considers local details of sign language movements by taking the information on joints and bones as inputs and constructing a spatialtemporal graph to reflect inter-frame relevance and physical connections between nodes.The graph-based multihead attention mechanism is utilized with adjacent matrix calculation for better local-feature exploration,and short-term motion correlation modeling is completed via a temporal convolutional network.We adopted BLSTM to learn the long-termdependence and connectionist temporal classification to align the word-level sequences.The proposed method achieves competitive results regarding word error rates(1.59%)on the Chinese Sign Language dataset and the mean Jaccard Index(65.78%)on the ChaLearn LAP Continuous Gesture Dataset.
基金supported by National Natural Science Foundation of China(62003028).X.L.was supported by a Scholarship from the China Scholarship Council.
文摘Recent advances in spatially resolved transcriptomic technologies have enabled unprecedented opportunities to elucidate tissue architecture and function in situ.Spatial transcriptomics can provide multimodal and complementary information simultaneously,including gene expression profiles,spatial locations,and histology images.However,most existing methods have limitations in efficiently utilizing spatial information and matched high-resolution histology images.To fully leverage the multi-modal information,we propose a SPAtially embedded Deep Attentional graph Clustering(SpaDAC)method to identify spatial domains while reconstructing denoised gene expression profiles.This method can efficiently learn the low-dimensional embeddings for spatial transcriptomics data by constructing multi-view graph modules to capture both spatial location connectives and morphological connectives.Benchmark results demonstrate that SpaDAC outperforms other algorithms on several recent spatial transcriptomics datasets.SpaDAC is a valuable tool for spatial domain detection,facilitating the comprehension of tissue architecture and cellular microenvironment.The source code of SpaDAC is freely available at Github(https://github.com/huoyuying/SpaDAC.git).
基金supported by Research and Application of Edge IoT Technology for Distributed New Energy Consumption in Distribution Areas,Project Number(5108-202218280A-2-394-XG)。
文摘For permanent faults(PF)in the power communication network(PCN),such as link interruptions,the timesensitive networking(TSN)relied on by PCN,typically employs spatial redundancy fault-tolerance methods to keep service stability and reliability,which often limits TSN scheduling performance in fault-free ideal states.So this paper proposes a graph attention residual network-based routing and fault-tolerant scheduling mechanism(GRFS)for data flow in PCN,which specifically includes a communication system architecture for integrated terminals based on a cyclic queuing and forwarding(CQF)model and fault recovery method,which reduces the impact of faults by simplified scheduling configurations of CQF and fault-tolerance of prioritizing the rerouting of faulty time-sensitive(TS)flows;considering that PF leading to changes in network topology is more appropriately solved by doing routing and time slot injection decisions hop-by-hop,and that reasonable network load can reduce the damage caused by PF and reserve resources for the rerouting of faulty TS flows,an optimization model for joint routing and scheduling is constructed with scheduling success rate as the objective,and with traffic latency and network load as constraints;to catch changes in TSN topology and traffic load,a D3QN algorithm based on a multi-head graph attention residual network(MGAR)is designed to solve the problem model,where the MGAR based encoder reconstructs the TSN status into feature embedding vectors,and a dueling network decoder performs decoding tasks on the reconstructed feature embedding vectors.Simulation results show that GRFS outperforms heuristic fault-tolerance algorithms and other benchmark schemes by approximately 10%in routing and scheduling success rate in ideal states and 5%in rerouting and rescheduling success rate in fault states.
基金Authors The research project is partially supported by National Natural ScienceFoundation of China under Grant No. 62072015, U19B2039, U1811463National Key R&D Programof China 2018YFB1600903.
文摘PM2.5 concentration prediction is of great significance to environmental protection and human health.Achieving accurate prediction of PM2.5 concentration has become an important research task.However,PM2.5 pollutants can spread in the earth’s atmosphere,causing mutual influence between different cities.To effectively capture the air pollution relationship between cities,this paper proposes a novel spatiotemporal model combining graph attention neural network(GAT)and gated recurrent unit(GRU),named GAT-GRU for PM2.5 concentration prediction.Specifically,GAT is used to learn the spatial dependence of PM2.5 concentration data in different cities,and GRU is to extract the temporal dependence of the long-term data series.The proposed model integrates the learned spatio-temporal dependencies to capture long-term complex spatio-temporal features.Considering that air pollution is related to the meteorological conditions of the city,the knowledge acquired from meteorological data is used in the model to enhance PM2.5 prediction performance.The input of the GAT-GRU model consists of PM2.5 concentration data and meteorological data.In order to verify the effectiveness of the proposed GAT-GRU prediction model,this paper designs experiments on real-world datasets compared with other baselines.Experimental results prove that our model achieves excellent performance in PM2.5 concentration prediction.
