Dynamic publishing of social network graphs offers insights into user behavior but brings privacy risks, notably re-identification attacks on evolving data snapshots. Existing methods based on -anonymity can mitigate ...Dynamic publishing of social network graphs offers insights into user behavior but brings privacy risks, notably re-identification attacks on evolving data snapshots. Existing methods based on -anonymity can mitigate these attacks but are cumbersome, neglect dynamic protection of community structure, and lack precise utility measures. To address these challenges, we present a dynamic social network graph anonymity scheme with community structure protection (DSNGA-CSP), which achieves the dynamic anonymization process by incorporating community detection. First, DSNGA-CSP categorizes communities of the original graph into three types at each timestamp, and only partitions community subgraphs for a specific category at each updated timestamp. Then, DSNGA-CSP achieves intra-community and inter-community anonymization separately to retain more of the community structure of the original graph at each timestamp. It anonymizes community subgraphs by the proposed novel -composition method and anonymizes inter-community edges by edge isomorphism. Finally, a novel information loss metric is introduced in DSNGA-CSP to precisely capture the utility of the anonymized graph through original information preservation and anonymous information changes. Extensive experiments conducted on five real-world datasets demonstrate that DSNGA-CSP consistently outperforms existing methods, providing a more effective balance between privacy and utility. Specifically, DSNGA-CSP shows an average utility improvement of approximately 30% compared to TAKG and CTKGA for three dynamic graph datasets, according to the proposed information loss metric IL.展开更多
According to the characteristic and the requirement of multipath planning, a new multipath planning method is proposed based on network. This method includes two steps： the construction of network and multipath searc...According to the characteristic and the requirement of multipath planning, a new multipath planning method is proposed based on network. This method includes two steps： the construction of network and multipath searching. The construction of network proceeds in three phases： the skeleton extraction of the configuration space, the judgment of the cross points in the skeleton and how to link the cross points to form a network. Multipath searching makes use of the network and iterative penalty method （IPM） to plan multi-paths, and adjusts the planar paths to satisfy the requirement of maneuverability of unmanned aerial vehicle （UAV）. In addition, a new height planning method is proposed to deal with the height planning of 3D route. The proposed algorithm can find multiple paths automatically according to distribution of terrain and threat areas with high efficiency. The height planning can make 3D route following the terrain. The simulation experiment illustrates the feasibility of the proposed method.展开更多
In social networks,weighted graph anonymity is gaining more and more attention.But fan-following graphs like Twitter’s are not protected by anonymity.Privacy protection based on directed graphs should arouse everyone...In social networks,weighted graph anonymity is gaining more and more attention.But fan-following graphs like Twitter’s are not protected by anonymity.Privacy protection based on directed graphs should arouse everyone’s importance,thus it requires effective anonymization techniques.In this paper,we propose a directed edge weighted graph anonymity scheme to model the shortest path in a directed network graph by Floyd algorithm and Dijkstra algorithm.Also,we execute the experiments on the number of anonymity solutions and time with different edge weights to verify their anonymity feasibility.Finally,we analyze the anonymity of two algorithms and to some extent concluded that Floyd algorithm is more suitable for anonymity of directed network graphs.展开更多
With the emphasis on user privacy and communication security, encrypted traffic has increased dramatically, which brings great challenges to traffic classification. The classification method of encrypted traffic based...With the emphasis on user privacy and communication security, encrypted traffic has increased dramatically, which brings great challenges to traffic classification. The classification method of encrypted traffic based on GNN can deal with encrypted traffic well. However, existing GNN-based approaches ignore the relationship between client or server packets. In this paper, we design a network traffic topology based on GCN, called Flow Mapping Graph (FMG). FMG establishes sequential edges between vertexes by the arrival order of packets and establishes jump-order edges between vertexes by connecting packets in different bursts with the same direction. It not only reflects the time characteristics of the packet but also strengthens the relationship between the client or server packets. According to FMG, a Traffic Mapping Classification model (TMC-GCN) is designed, which can automatically capture and learn the characteristics and structure information of the top vertex in FMG. The TMC-GCN model is used to classify the encrypted traffic. The encryption stream classification problem is transformed into a graph classification problem, which can effectively deal with data from different data sources and application scenarios. By comparing the performance of TMC-GCN with other classical models in four public datasets, including CICIOT2023, ISCXVPN2016, CICAAGM2017, and GraphDapp, the effectiveness of the FMG algorithm is verified. The experimental results show that the accuracy rate of the TMC-GCN model is 96.13%, the recall rate is 95.04%, and the F1 rate is 94.54%.展开更多
The increasing popularity of the Internet and the widespread use of information technology have led to a rise in the number and sophistication of network attacks and security threats.Intrusion detection systems are cr...The increasing popularity of the Internet and the widespread use of information technology have led to a rise in the number and sophistication of network attacks and security threats.Intrusion detection systems are crucial to network security,playing a pivotal role in safeguarding networks from potential threats.However,in the context of an evolving landscape of sophisticated and elusive attacks,existing intrusion detection methodologies often overlook critical aspects such as changes in network topology over time and interactions between hosts.To address these issues,this paper proposes a real-time network intrusion detection method based on graph neural networks.The proposedmethod leverages the advantages of graph neural networks and employs a straightforward graph construction method to represent network traffic as dynamic graph-structured data.Additionally,a graph convolution operation with a multi-head attention mechanism is utilized to enhance the model’s ability to capture the intricate relationships within the graph structure comprehensively.Furthermore,it uses an integrated graph neural network to address dynamic graphs’structural and topological changes at different time points and the challenges of edge embedding in intrusion detection data.The edge classification problem is effectively transformed into node classification by employing a line graph data representation,which facilitates fine-grained intrusion detection tasks on dynamic graph node feature representations.The efficacy of the proposed method is evaluated using two commonly used intrusion detection datasets,UNSW-NB15 and NF-ToN-IoT-v2,and results are compared with previous studies in this field.The experimental results demonstrate that our proposed method achieves 99.3%and 99.96%accuracy on the two datasets,respectively,and outperforms the benchmark model in several evaluation metrics.展开更多
Spectrum-based fault localization (SBFL) generates a ranked list of suspicious elements by using the program execution spectrum, but the excessive number of elements ranked in parallel results in low localization accu...Spectrum-based fault localization (SBFL) generates a ranked list of suspicious elements by using the program execution spectrum, but the excessive number of elements ranked in parallel results in low localization accuracy. Most researchers consider intra-class dependencies to improve localization accuracy. However, some studies show that inter-class method call type faults account for more than 20%, which means such methods still have certain limitations. To solve the above problems, this paper proposes a two-phase software fault localization based on relational graph convolutional neural networks (Two-RGCNFL). Firstly, in Phase 1, the method call dependence graph (MCDG) of the program is constructed, the intra-class and inter-class dependencies in MCDG are extracted by using the relational graph convolutional neural network, and the classifier is used to identify the faulty methods. Then, the GraphSMOTE algorithm is improved to alleviate the impact of class imbalance on classification accuracy. Aiming at the problem of parallel ranking of element suspicious values in traditional SBFL technology, in Phase 2, Doc2Vec is used to learn static features, while spectrum information serves as dynamic features. A RankNet model based on siamese multi-layer perceptron is constructed to score and rank statements in the faulty method. This work conducts experiments on 5 real projects of Defects4J benchmark. Experimental results show that, compared with the traditional SBFL technique and two baseline methods, our approach improves the Top-1 accuracy by 262.86%, 29.59% and 53.01%, respectively, which verifies the effectiveness of Two-RGCNFL. Furthermore, this work verifies the importance of inter-class dependencies through ablation experiments.展开更多
The ability to accurately predict urban traffic flows is crucial for optimising city operations.Consequently,various methods for forecasting urban traffic have been developed,focusing on analysing historical data to u...The ability to accurately predict urban traffic flows is crucial for optimising city operations.Consequently,various methods for forecasting urban traffic have been developed,focusing on analysing historical data to understand complex mobility patterns.Deep learning techniques,such as graph neural networks(GNNs),are popular for their ability to capture spatio-temporal dependencies.However,these models often become overly complex due to the large number of hyper-parameters involved.In this study,we introduce Dynamic Multi-Graph Spatial-Temporal Graph Neural Ordinary Differential Equation Networks(DMST-GNODE),a framework based on ordinary differential equations(ODEs)that autonomously discovers effective spatial-temporal graph neural network(STGNN)architectures for traffic prediction tasks.The comparative analysis of DMST-GNODE and baseline models indicates that DMST-GNODE model demonstrates superior performance across multiple datasets,consistently achieving the lowest Root Mean Square Error(RMSE)and Mean Absolute Error(MAE)values,alongside the highest accuracy.On the BKK(Bangkok)dataset,it outperformed other models with an RMSE of 3.3165 and an accuracy of 0.9367 for a 20-min interval,maintaining this trend across 40 and 60 min.Similarly,on the PeMS08 dataset,DMST-GNODE achieved the best performance with an RMSE of 19.4863 and an accuracy of 0.9377 at 20 min,demonstrating its effectiveness over longer periods.The Los_Loop dataset results further emphasise this model’s advantage,with an RMSE of 3.3422 and an accuracy of 0.7643 at 20 min,consistently maintaining superiority across all time intervals.These numerical highlights indicate that DMST-GNODE not only outperforms baseline models but also achieves higher accuracy and lower errors across different time intervals and datasets.展开更多
Traditional Chinese medicine(TCM)features complex compatibility mechanisms involving multicomponent,multi-target,and multi-pathway interactions.This study presents an interpretable graph artificial intelligence(GraphA...Traditional Chinese medicine(TCM)features complex compatibility mechanisms involving multicomponent,multi-target,and multi-pathway interactions.This study presents an interpretable graph artificial intelligence(GraphAI)framework to quantify such mechanisms in Chinese herbal formulas(CHFs).A multidimensional TCM knowledge graph(TCM-MKG;https://zenodo.org/records/13763953)was constructed,integrating seven standardized modules:TCM terminology,Chinese patent medicines(CPMs),Chinese herbal pieces(CHPs),pharmacognostic origins(POs),chemical compounds,biological targets,and diseases.A neighbor-diffusion strategy was used to address the sparsity of compound-target associations,increasing target coverage from 12.0%to 98.7%.Graph neural networks(GNNs)with attention mechanisms were applied to 6,080 CHFs,modeled as graphs with CHPs as nodes.To embed domain-specific semantics,virtual nodes medicinal properties,i.e.,therapeutic nature,flavor,and meridian tropism,were introduced,enabling interpretable modeling of inter-CHP relationships.The model quantitatively captured classical compatibility roles such as“monarch-minister-assistant-guide”,and uncovered TCM etiological types derived from diagnostic and efficacy patterns.Model validation using 215 CHFs used for coronavirus disease 2019(COVID-19)management highlighted Radix Astragali-Rhizoma Phragmitis as a high-attention herb pair.Mass spectrometry(MS)and target prediction identified three active compounds,i.e.,methylinissolin-3-O-glucoside,corydalin,and pingbeinine,which converge on pathways such as neuroactive ligand-receptor interaction,xenobiotic response,and neuronal function,supporting their neuroimmune and detoxification potential.Given their high safety and dietary compatibility,this herb pair may offer therapeutic value for managing long COVID-19.All data and code are openly available(https://github.com/ZENGJingqi/GraphAI-for-TCM),providing a scalable and interpretable platform for TCM mechanism research and discovery of bioactive herbal constituents.展开更多
In recent years,gait-based emotion recognition has been widely applied in the field of computer vision.However,existing gait emotion recognition methods typically rely on complete human skeleton data,and their accurac...In recent years,gait-based emotion recognition has been widely applied in the field of computer vision.However,existing gait emotion recognition methods typically rely on complete human skeleton data,and their accuracy significantly declines when the data is occluded.To enhance the accuracy of gait emotion recognition under occlusion,this paper proposes a Multi-scale Suppression Graph ConvolutionalNetwork(MS-GCN).TheMS-GCN consists of three main components:Joint Interpolation Module(JI Moudle),Multi-scale Temporal Convolution Network(MS-TCN),and Suppression Graph Convolutional Network(SGCN).The JI Module completes the spatially occluded skeletal joints using the(K-Nearest Neighbors)KNN interpolation method.The MS-TCN employs convolutional kernels of various sizes to comprehensively capture the emotional information embedded in the gait,compensating for the temporal occlusion of gait information.The SGCN extracts more non-prominent human gait features by suppressing the extraction of key body part features,thereby reducing the negative impact of occlusion on emotion recognition results.The proposed method is evaluated on two comprehensive datasets:Emotion-Gait,containing 4227 real gaits from sources like BML,ICT-Pollick,and ELMD,and 1000 synthetic gaits generated using STEP-Gen technology,and ELMB,consisting of 3924 gaits,with 1835 labeled with emotions such as“Happy,”“Sad,”“Angry,”and“Neutral.”On the standard datasets Emotion-Gait and ELMB,the proposed method achieved accuracies of 0.900 and 0.896,respectively,attaining performance comparable to other state-ofthe-artmethods.Furthermore,on occlusion datasets,the proposedmethod significantly mitigates the performance degradation caused by occlusion compared to other methods,the accuracy is significantly higher than that of other methods.展开更多
Session-based recommendation systems(SBR)are pivotal in suggesting items by analyzing anonymized sequences of user interactions.Traditional methods,while competent,often fall short in two critical areas:they fail to a...Session-based recommendation systems(SBR)are pivotal in suggesting items by analyzing anonymized sequences of user interactions.Traditional methods,while competent,often fall short in two critical areas:they fail to address potential inter-session item transitions,which are behavioral dependencies that extend beyond individual session boundaries,and they rely on monolithic item aggregation to construct session representations.This approach does not capture the multi-scale and heterogeneous nature of user intent,leading to a decrease in modeling accuracy.To overcome these limitations,a novel approach called HMGS has been introduced.This system incorporates dual graph architectures to enhance the recommendation process.A global transition graph captures latent cross-session item dependencies,while a heterogeneous intra-session graph encodesmulti-scale item embeddings through localized feature propagation.Additionally,amulti-tier graphmatchingmechanism aligns user preference signals across different granularities,significantly improving interest localization accuracy.Empirical validation on benchmark datasets(Tmall and Diginetica)confirms HMGS’s efficacy against state-of-the-art baselines.Quantitative analysis reveals performance gains of 20.54%and 12.63%in Precision@10 on Tmall and Diginetica,respectively.Consistent improvements are observed across auxiliary metrics,with MRR@10,Precision@20,and MRR@20 exhibiting enhancements between 4.00%and 21.36%,underscoring the framework’s robustness in multi-faceted recommendation scenarios.展开更多
Aspect-oriented sentiment analysis is a meticulous sentiment analysis task that aims to analyse the sentiment polarity of specific aspects. Most of the current research builds graph convolutional networks based on dep...Aspect-oriented sentiment analysis is a meticulous sentiment analysis task that aims to analyse the sentiment polarity of specific aspects. Most of the current research builds graph convolutional networks based on dependent syntactic trees, which improves the classification performance of the models to some extent. However, the technical limitations of dependent syntactic trees can introduce considerable noise into the model. Meanwhile, it is difficult for a single graph convolutional network to aggregate both semantic and syntactic structural information of nodes, which affects the final sentence classification. To cope with the above problems, this paper proposes a bi-channel graph convolutional network model. The model introduces a phrase structure tree and transforms it into a hierarchical phrase matrix. The adjacency matrix of the dependent syntactic tree and the hierarchical phrase matrix are combined as the initial matrix of the graph convolutional network to enhance the syntactic information. The semantic information feature representations of the sentences are obtained by the graph convolutional network with a multi-head attention mechanism and fused to achieve complementary learning of dual-channel features. Experimental results show that the model performs well and improves the accuracy of sentiment classification on three public benchmark datasets, namely Rest14, Lap14 and Twitter.展开更多
Machine learning algorithms are widely used to interpret well logging data.To enhance the algorithms'robustness,shuffling the well logging data is an unavoidable feature engineering before training models.However,...Machine learning algorithms are widely used to interpret well logging data.To enhance the algorithms'robustness,shuffling the well logging data is an unavoidable feature engineering before training models.However,latent information stored between different well logging types and depth is destroyed during the shuffle.To investigate the influence of latent information,this study implements graph convolution networks(GCNs),long-short temporal memory models,recurrent neural networks,temporal convolution networks,and two artificial neural networks to predict the microbial lithology in the fourth member of the Dengying Formation,Moxi gas field,central Sichuan Basin.Results indicate that the GCN model outperforms other models.The accuracy,F1-score,and area under curve of the GCN model are 0.90,0.90,and 0.95,respectively.Experimental results indicate that the time-series data facilitates lithology prediction and helps determine lithological fluctuations in the vertical direction.All types of logs from the spectral in the GCN model and also facilitates lithology identification.Only on condition combined with latent information,the GCN model reaches excellent microbialite classification resolution at the centimeter scale.Ultimately,the two actual cases show tricks for using GCN models to predict potential microbialite in other formations and areas,proving that the GCN model can be adopted in the industry.展开更多
Cryptocurrency is a remarkable financial innovation that has affected the financial system in fundamental ways.Its increasingly complex interactions with the conventional financial market make precisely forecasting it...Cryptocurrency is a remarkable financial innovation that has affected the financial system in fundamental ways.Its increasingly complex interactions with the conventional financial market make precisely forecasting its volatility increasingly challenging.To this end,we propose a novel framework based on the evolving multiscale graph neural network(EMGNN).Specifically,we embed a graph that depicts the interactions between the cryptocurrency and conventional financial markets into the predictive process.Furthermore,we employ hierarchical evolving graph structure learners to model the dynamic and scale-specific interactions.We also evaluate our framework’s robustness and discuss its interpretability by extracting the learned graph structure.The empirical results show that(i)cryptocurrency volatility is not isolated from the conventional market,and the embedded graph can provide effective information for prediction;(ii)the EMGNN-based forecasting framework generally yields outstanding and robust performance in terms of multiple volatility estimators,cryptocurrency samples,forecasting horizons,and evaluation criteria;and(iii)the graph structure in the predictive process varies over time and scales and is well captured by our framework.Overall,our work provides new insights into risk management for market participants and into policy formulation for authorities.展开更多
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.展开更多
Weather forecasting is crucial for agriculture,transportation,and industry.Deep Learning(DL)has greatly improved the prediction accuracy.Among them,Graph Neural Networks(GNNs)excel at processing weather data by establ...Weather forecasting is crucial for agriculture,transportation,and industry.Deep Learning(DL)has greatly improved the prediction accuracy.Among them,Graph Neural Networks(GNNs)excel at processing weather data by establishing connections between regions.This allows them to understand complex patterns that traditional methods might miss.As a result,achieving more accurate predictions becomes possible.The paper reviews the role of GNNs in short-to medium-range weather forecasting.The methods are classified into three categories based on dataset differences.The paper also further identifies five promising research frontiers.These areas aim to boost forecasting precision and enhance computational efficiency.They offer valuable insights for future weather forecasting systems.展开更多
Schizophrenia(SZ)stands as a severe psychiatric disorder.This study applied diffusion tensor imaging(DTI)data in conjunction with graph neural networks to distinguish SZ patients from normal controls(NCs)and showcases...Schizophrenia(SZ)stands as a severe psychiatric disorder.This study applied diffusion tensor imaging(DTI)data in conjunction with graph neural networks to distinguish SZ patients from normal controls(NCs)and showcases the superior performance of a graph neural network integrating combined fractional anisotropy and fiber number brain network features,achieving an accuracy of 73.79%in distinguishing SZ patients from NCs.Beyond mere discrimination,our study delved deeper into the advantages of utilizing white matter brain network features for identifying SZ patients through interpretable model analysis and gene expression analysis.These analyses uncovered intricate interrelationships between brain imaging markers and genetic biomarkers,providing novel insights into the neuropathological basis of SZ.In summary,our findings underscore the potential of graph neural networks applied to multimodal DTI data for enhancing SZ detection through an integrated analysis of neuroimaging and genetic features.展开更多
Objective:Prostate cancer(PCa)exhibits significant genomic differences between Western and Asian populations.This study aimed to design a predictive model applicable across diverse populations while selecting a limite...Objective:Prostate cancer(PCa)exhibits significant genomic differences between Western and Asian populations.This study aimed to design a predictive model applicable across diverse populations while selecting a limited set of genes suitable for clinical implementation.Methods:We utilized an integrated dataset of 1360 whole-exome and whole-genome sequences from Chinese and Western PCa cohorts to develop and evaluate the model.External validation was conducted using an independent cohort of patients.A graph neural network architecture,termed the pathway-aware multi-layered hierarchical network-Western and Asian(P-NETwa),was developed and trained on combined genomic profiles from Chinese and Western cohorts.The model employed a multilayer perceptron(MLP)to identify key signature genes from multiomics data,enabling precise prediction of PCa metastasis.Results:The model achieved an accuracy of 0.87 and an F1-score of 0.85 on Western population datasets.The application of integrated Chinese and Western population data improved the accuracy to 0.88,achieving an F1-score of 0.75.The analysis identified 18 signature genes implicated in PCa progression,including established markers(AR and TP53)and novel candidates(MUC16,MUC4,and ASB12).For clinical adoption,the model was optimized for commercially available gene panels while maintaining high classification accuracy.Additionally,a user-friendly web interface was developed to facilitate real-time prediction of primary versus metastatic status using the pre-trained P-NETwa-MLP model.Conclusion:The P-NETwa-MLP model integrates a query system that allows for efficient retrieval of prediction outcomes and associated genomic signatures via sample ID,enhancing its potential for seamless integration into clinical workflows.展开更多
Metal–organic frameworks(MOFs)hold great potential for gas separation and storage,and graph neural networks have proven to be a powerful tool for exploring material structure–property relationships and discovering n...Metal–organic frameworks(MOFs)hold great potential for gas separation and storage,and graph neural networks have proven to be a powerful tool for exploring material structure–property relationships and discovering new materials.Unlike traditional molecular graphs,crystal graphs require consideration of periodic invariance and modes.In addition,MOF structures such as covalent bonds,functional groups,and global structures impact adsorption performance in different ways.However,redundant atomic interactions can disrupt training accuracy,potentially leading to overfitting.In this paper,we propose a multi-scale crystal graph for describing periodic crystal structures,modeling interatomic interactions at different scales while preserving periodicity invariance.We also propose a multi-head attention crystal graph network in multi-scale graphs(MHACGN-MS),which learns structural characteristics by focusing on interatomic interactions at different scales,thereby reducing interference from redundant interactions.Using MOF adsorption for gases as an example,we demonstrate that MHACGN-MS outperforms traditional graph neural networks in predicting multi-component gas adsorption.We also visualize attention scores to validate effective learning and demonstrate the model’s interpretability.展开更多
With the rapid development of deep learning neural networks,new solutions have emerged for addressing fluid flow problems in porous media.Combining data-driven approaches with physical constraints has become a hot res...With the rapid development of deep learning neural networks,new solutions have emerged for addressing fluid flow problems in porous media.Combining data-driven approaches with physical constraints has become a hot research direction,with physics-informed neural networks(PINNs) being the most popular hybrid model.PINNs have gained widespread attention in subsurface fluid flow simulations due to their low computational resource requirements,fast training speeds,strong generalization capabilities,and broad applicability.Despite success in homogeneous settings,standard PINNs face challenges in accurately calculating flux between irregular Eulerian cells with disparate properties and capturing global field influences on local cells.This limits their suitability for heterogeneous reservoirs and the irregular Eulerian grids frequently used in reservoir.To address these challenges,this study proposes a physics-informed graph neural network(PIGNN) model.The PIGNN model treats the entire field as a whole,integrating information from neighboring grids and physical laws into the solution for the target grid,thereby improving the accuracy of solving partial differential equations in heterogeneous and Eulerian irregular grids.The optimized model was applied to pressure field prediction in a spatially heterogeneous reservoir,achieving an average L_(2) error and R_(2) score of 6.710×10^(-4)and 0.998,respectively,which confirms the effectiveness of model.Compared to the conventional PINN model,the average L_(2) error was reduced by 76.93%,the average R_(2) score increased by 3.56%.Moreover,evaluating robustness,training the PIGNN model using only 54% and 76% of the original data yielded average relative L_(2) error reductions of 58.63% and 56.22%,respectively,compared to the PINN model.These results confirm the superior performance of this approach compared to PINN.展开更多
Recommendation systems(RSs)are crucial in personalizing user experiences in digital environments by suggesting relevant content or items.Collaborative filtering(CF)is a widely used personalization technique that lever...Recommendation systems(RSs)are crucial in personalizing user experiences in digital environments by suggesting relevant content or items.Collaborative filtering(CF)is a widely used personalization technique that leverages user-item interactions to generate recommendations.However,it struggles with challenges like the cold-start problem,scalability issues,and data sparsity.To address these limitations,we develop a Graph Convolutional Networks(GCNs)model that captures the complex network of interactions between users and items,identifying subtle patterns that traditional methods may overlook.We integrate this GCNs model into a federated learning(FL)framework,enabling themodel to learn fromdecentralized datasets.This not only significantly enhances user privacy—a significant improvement over conventionalmodels but also reassures users about the safety of their data.Additionally,by securely incorporating demographic information,our approach further personalizes recommendations and mitigates the coldstart issue without compromising user data.We validate our RSs model using the openMovieLens dataset and evaluate its performance across six key metrics:Precision,Recall,Area Under the Receiver Operating Characteristic Curve(ROC-AUC),F1 Score,Normalized Discounted Cumulative Gain(NDCG),and Mean Reciprocal Rank(MRR).The experimental results demonstrate significant enhancements in recommendation quality,underscoring that combining GCNs with CF in a federated setting provides a transformative solution for advanced recommendation systems.展开更多
基金supported by the Natural Science Foundation of China(No.U22A2099)the Innovation Project of Guangxi Graduate Education(YCBZ2023130).
文摘Dynamic publishing of social network graphs offers insights into user behavior but brings privacy risks, notably re-identification attacks on evolving data snapshots. Existing methods based on -anonymity can mitigate these attacks but are cumbersome, neglect dynamic protection of community structure, and lack precise utility measures. To address these challenges, we present a dynamic social network graph anonymity scheme with community structure protection (DSNGA-CSP), which achieves the dynamic anonymization process by incorporating community detection. First, DSNGA-CSP categorizes communities of the original graph into three types at each timestamp, and only partitions community subgraphs for a specific category at each updated timestamp. Then, DSNGA-CSP achieves intra-community and inter-community anonymization separately to retain more of the community structure of the original graph at each timestamp. It anonymizes community subgraphs by the proposed novel -composition method and anonymizes inter-community edges by edge isomorphism. Finally, a novel information loss metric is introduced in DSNGA-CSP to precisely capture the utility of the anonymized graph through original information preservation and anonymous information changes. Extensive experiments conducted on five real-world datasets demonstrate that DSNGA-CSP consistently outperforms existing methods, providing a more effective balance between privacy and utility. Specifically, DSNGA-CSP shows an average utility improvement of approximately 30% compared to TAKG and CTKGA for three dynamic graph datasets, according to the proposed information loss metric IL.
基金supported by the National High Technology Research and Development Program of China(2007AA12Z166)
文摘According to the characteristic and the requirement of multipath planning, a new multipath planning method is proposed based on network. This method includes two steps： the construction of network and multipath searching. The construction of network proceeds in three phases： the skeleton extraction of the configuration space, the judgment of the cross points in the skeleton and how to link the cross points to form a network. Multipath searching makes use of the network and iterative penalty method （IPM） to plan multi-paths, and adjusts the planar paths to satisfy the requirement of maneuverability of unmanned aerial vehicle （UAV）. In addition, a new height planning method is proposed to deal with the height planning of 3D route. The proposed algorithm can find multiple paths automatically according to distribution of terrain and threat areas with high efficiency. The height planning can make 3D route following the terrain. The simulation experiment illustrates the feasibility of the proposed method.
基金supported in part by the National Natural Science Foundation of China(Nos.62171132 and 62102088)Joint Funds for the Innovation of Science and Technology of Fujian Province(No.2024Y9491)Natural Science Foundation of Fujian Province(Nos.2024J09032 and 2025J01379).
文摘In social networks,weighted graph anonymity is gaining more and more attention.But fan-following graphs like Twitter’s are not protected by anonymity.Privacy protection based on directed graphs should arouse everyone’s importance,thus it requires effective anonymization techniques.In this paper,we propose a directed edge weighted graph anonymity scheme to model the shortest path in a directed network graph by Floyd algorithm and Dijkstra algorithm.Also,we execute the experiments on the number of anonymity solutions and time with different edge weights to verify their anonymity feasibility.Finally,we analyze the anonymity of two algorithms and to some extent concluded that Floyd algorithm is more suitable for anonymity of directed network graphs.
基金supported by the National Key Research and Development Program of China No.2023YFA1009500.
文摘With the emphasis on user privacy and communication security, encrypted traffic has increased dramatically, which brings great challenges to traffic classification. The classification method of encrypted traffic based on GNN can deal with encrypted traffic well. However, existing GNN-based approaches ignore the relationship between client or server packets. In this paper, we design a network traffic topology based on GCN, called Flow Mapping Graph (FMG). FMG establishes sequential edges between vertexes by the arrival order of packets and establishes jump-order edges between vertexes by connecting packets in different bursts with the same direction. It not only reflects the time characteristics of the packet but also strengthens the relationship between the client or server packets. According to FMG, a Traffic Mapping Classification model (TMC-GCN) is designed, which can automatically capture and learn the characteristics and structure information of the top vertex in FMG. The TMC-GCN model is used to classify the encrypted traffic. The encryption stream classification problem is transformed into a graph classification problem, which can effectively deal with data from different data sources and application scenarios. By comparing the performance of TMC-GCN with other classical models in four public datasets, including CICIOT2023, ISCXVPN2016, CICAAGM2017, and GraphDapp, the effectiveness of the FMG algorithm is verified. The experimental results show that the accuracy rate of the TMC-GCN model is 96.13%, the recall rate is 95.04%, and the F1 rate is 94.54%.
文摘The increasing popularity of the Internet and the widespread use of information technology have led to a rise in the number and sophistication of network attacks and security threats.Intrusion detection systems are crucial to network security,playing a pivotal role in safeguarding networks from potential threats.However,in the context of an evolving landscape of sophisticated and elusive attacks,existing intrusion detection methodologies often overlook critical aspects such as changes in network topology over time and interactions between hosts.To address these issues,this paper proposes a real-time network intrusion detection method based on graph neural networks.The proposedmethod leverages the advantages of graph neural networks and employs a straightforward graph construction method to represent network traffic as dynamic graph-structured data.Additionally,a graph convolution operation with a multi-head attention mechanism is utilized to enhance the model’s ability to capture the intricate relationships within the graph structure comprehensively.Furthermore,it uses an integrated graph neural network to address dynamic graphs’structural and topological changes at different time points and the challenges of edge embedding in intrusion detection data.The edge classification problem is effectively transformed into node classification by employing a line graph data representation,which facilitates fine-grained intrusion detection tasks on dynamic graph node feature representations.The efficacy of the proposed method is evaluated using two commonly used intrusion detection datasets,UNSW-NB15 and NF-ToN-IoT-v2,and results are compared with previous studies in this field.The experimental results demonstrate that our proposed method achieves 99.3%and 99.96%accuracy on the two datasets,respectively,and outperforms the benchmark model in several evaluation metrics.
基金funded by the Youth Fund of the National Natural Science Foundation of China(Grant No.42261070).
文摘Spectrum-based fault localization (SBFL) generates a ranked list of suspicious elements by using the program execution spectrum, but the excessive number of elements ranked in parallel results in low localization accuracy. Most researchers consider intra-class dependencies to improve localization accuracy. However, some studies show that inter-class method call type faults account for more than 20%, which means such methods still have certain limitations. To solve the above problems, this paper proposes a two-phase software fault localization based on relational graph convolutional neural networks (Two-RGCNFL). Firstly, in Phase 1, the method call dependence graph (MCDG) of the program is constructed, the intra-class and inter-class dependencies in MCDG are extracted by using the relational graph convolutional neural network, and the classifier is used to identify the faulty methods. Then, the GraphSMOTE algorithm is improved to alleviate the impact of class imbalance on classification accuracy. Aiming at the problem of parallel ranking of element suspicious values in traditional SBFL technology, in Phase 2, Doc2Vec is used to learn static features, while spectrum information serves as dynamic features. A RankNet model based on siamese multi-layer perceptron is constructed to score and rank statements in the faulty method. This work conducts experiments on 5 real projects of Defects4J benchmark. Experimental results show that, compared with the traditional SBFL technique and two baseline methods, our approach improves the Top-1 accuracy by 262.86%, 29.59% and 53.01%, respectively, which verifies the effectiveness of Two-RGCNFL. Furthermore, this work verifies the importance of inter-class dependencies through ablation experiments.
文摘The ability to accurately predict urban traffic flows is crucial for optimising city operations.Consequently,various methods for forecasting urban traffic have been developed,focusing on analysing historical data to understand complex mobility patterns.Deep learning techniques,such as graph neural networks(GNNs),are popular for their ability to capture spatio-temporal dependencies.However,these models often become overly complex due to the large number of hyper-parameters involved.In this study,we introduce Dynamic Multi-Graph Spatial-Temporal Graph Neural Ordinary Differential Equation Networks(DMST-GNODE),a framework based on ordinary differential equations(ODEs)that autonomously discovers effective spatial-temporal graph neural network(STGNN)architectures for traffic prediction tasks.The comparative analysis of DMST-GNODE and baseline models indicates that DMST-GNODE model demonstrates superior performance across multiple datasets,consistently achieving the lowest Root Mean Square Error(RMSE)and Mean Absolute Error(MAE)values,alongside the highest accuracy.On the BKK(Bangkok)dataset,it outperformed other models with an RMSE of 3.3165 and an accuracy of 0.9367 for a 20-min interval,maintaining this trend across 40 and 60 min.Similarly,on the PeMS08 dataset,DMST-GNODE achieved the best performance with an RMSE of 19.4863 and an accuracy of 0.9377 at 20 min,demonstrating its effectiveness over longer periods.The Los_Loop dataset results further emphasise this model’s advantage,with an RMSE of 3.3422 and an accuracy of 0.7643 at 20 min,consistently maintaining superiority across all time intervals.These numerical highlights indicate that DMST-GNODE not only outperforms baseline models but also achieves higher accuracy and lower errors across different time intervals and datasets.
基金supported by the National Natural Science Foundation of China(Grant No.:82230117).
文摘Traditional Chinese medicine(TCM)features complex compatibility mechanisms involving multicomponent,multi-target,and multi-pathway interactions.This study presents an interpretable graph artificial intelligence(GraphAI)framework to quantify such mechanisms in Chinese herbal formulas(CHFs).A multidimensional TCM knowledge graph(TCM-MKG;https://zenodo.org/records/13763953)was constructed,integrating seven standardized modules:TCM terminology,Chinese patent medicines(CPMs),Chinese herbal pieces(CHPs),pharmacognostic origins(POs),chemical compounds,biological targets,and diseases.A neighbor-diffusion strategy was used to address the sparsity of compound-target associations,increasing target coverage from 12.0%to 98.7%.Graph neural networks(GNNs)with attention mechanisms were applied to 6,080 CHFs,modeled as graphs with CHPs as nodes.To embed domain-specific semantics,virtual nodes medicinal properties,i.e.,therapeutic nature,flavor,and meridian tropism,were introduced,enabling interpretable modeling of inter-CHP relationships.The model quantitatively captured classical compatibility roles such as“monarch-minister-assistant-guide”,and uncovered TCM etiological types derived from diagnostic and efficacy patterns.Model validation using 215 CHFs used for coronavirus disease 2019(COVID-19)management highlighted Radix Astragali-Rhizoma Phragmitis as a high-attention herb pair.Mass spectrometry(MS)and target prediction identified three active compounds,i.e.,methylinissolin-3-O-glucoside,corydalin,and pingbeinine,which converge on pathways such as neuroactive ligand-receptor interaction,xenobiotic response,and neuronal function,supporting their neuroimmune and detoxification potential.Given their high safety and dietary compatibility,this herb pair may offer therapeutic value for managing long COVID-19.All data and code are openly available(https://github.com/ZENGJingqi/GraphAI-for-TCM),providing a scalable and interpretable platform for TCM mechanism research and discovery of bioactive herbal constituents.
基金supported by the National Natural Science Foundation of China(62272049,62236006,62172045)the Key Projects of Beijing Union University(ZKZD202301).
文摘In recent years,gait-based emotion recognition has been widely applied in the field of computer vision.However,existing gait emotion recognition methods typically rely on complete human skeleton data,and their accuracy significantly declines when the data is occluded.To enhance the accuracy of gait emotion recognition under occlusion,this paper proposes a Multi-scale Suppression Graph ConvolutionalNetwork(MS-GCN).TheMS-GCN consists of three main components:Joint Interpolation Module(JI Moudle),Multi-scale Temporal Convolution Network(MS-TCN),and Suppression Graph Convolutional Network(SGCN).The JI Module completes the spatially occluded skeletal joints using the(K-Nearest Neighbors)KNN interpolation method.The MS-TCN employs convolutional kernels of various sizes to comprehensively capture the emotional information embedded in the gait,compensating for the temporal occlusion of gait information.The SGCN extracts more non-prominent human gait features by suppressing the extraction of key body part features,thereby reducing the negative impact of occlusion on emotion recognition results.The proposed method is evaluated on two comprehensive datasets:Emotion-Gait,containing 4227 real gaits from sources like BML,ICT-Pollick,and ELMD,and 1000 synthetic gaits generated using STEP-Gen technology,and ELMB,consisting of 3924 gaits,with 1835 labeled with emotions such as“Happy,”“Sad,”“Angry,”and“Neutral.”On the standard datasets Emotion-Gait and ELMB,the proposed method achieved accuracies of 0.900 and 0.896,respectively,attaining performance comparable to other state-ofthe-artmethods.Furthermore,on occlusion datasets,the proposedmethod significantly mitigates the performance degradation caused by occlusion compared to other methods,the accuracy is significantly higher than that of other methods.
基金funded by the State Grid Hebei Electric Power Company(Project Number:KJ2023-093).
文摘Session-based recommendation systems(SBR)are pivotal in suggesting items by analyzing anonymized sequences of user interactions.Traditional methods,while competent,often fall short in two critical areas:they fail to address potential inter-session item transitions,which are behavioral dependencies that extend beyond individual session boundaries,and they rely on monolithic item aggregation to construct session representations.This approach does not capture the multi-scale and heterogeneous nature of user intent,leading to a decrease in modeling accuracy.To overcome these limitations,a novel approach called HMGS has been introduced.This system incorporates dual graph architectures to enhance the recommendation process.A global transition graph captures latent cross-session item dependencies,while a heterogeneous intra-session graph encodesmulti-scale item embeddings through localized feature propagation.Additionally,amulti-tier graphmatchingmechanism aligns user preference signals across different granularities,significantly improving interest localization accuracy.Empirical validation on benchmark datasets(Tmall and Diginetica)confirms HMGS’s efficacy against state-of-the-art baselines.Quantitative analysis reveals performance gains of 20.54%and 12.63%in Precision@10 on Tmall and Diginetica,respectively.Consistent improvements are observed across auxiliary metrics,with MRR@10,Precision@20,and MRR@20 exhibiting enhancements between 4.00%and 21.36%,underscoring the framework’s robustness in multi-faceted recommendation scenarios.
文摘Aspect-oriented sentiment analysis is a meticulous sentiment analysis task that aims to analyse the sentiment polarity of specific aspects. Most of the current research builds graph convolutional networks based on dependent syntactic trees, which improves the classification performance of the models to some extent. However, the technical limitations of dependent syntactic trees can introduce considerable noise into the model. Meanwhile, it is difficult for a single graph convolutional network to aggregate both semantic and syntactic structural information of nodes, which affects the final sentence classification. To cope with the above problems, this paper proposes a bi-channel graph convolutional network model. The model introduces a phrase structure tree and transforms it into a hierarchical phrase matrix. The adjacency matrix of the dependent syntactic tree and the hierarchical phrase matrix are combined as the initial matrix of the graph convolutional network to enhance the syntactic information. The semantic information feature representations of the sentences are obtained by the graph convolutional network with a multi-head attention mechanism and fused to achieve complementary learning of dual-channel features. Experimental results show that the model performs well and improves the accuracy of sentiment classification on three public benchmark datasets, namely Rest14, Lap14 and Twitter.
基金supported by National Natural Science Foundation of China(Nos.41872150,U2344209 and U19B6003)the PetroChina Southwest Oil and Gasfield Company(No.2020-54365)。
文摘Machine learning algorithms are widely used to interpret well logging data.To enhance the algorithms'robustness,shuffling the well logging data is an unavoidable feature engineering before training models.However,latent information stored between different well logging types and depth is destroyed during the shuffle.To investigate the influence of latent information,this study implements graph convolution networks(GCNs),long-short temporal memory models,recurrent neural networks,temporal convolution networks,and two artificial neural networks to predict the microbial lithology in the fourth member of the Dengying Formation,Moxi gas field,central Sichuan Basin.Results indicate that the GCN model outperforms other models.The accuracy,F1-score,and area under curve of the GCN model are 0.90,0.90,and 0.95,respectively.Experimental results indicate that the time-series data facilitates lithology prediction and helps determine lithological fluctuations in the vertical direction.All types of logs from the spectral in the GCN model and also facilitates lithology identification.Only on condition combined with latent information,the GCN model reaches excellent microbialite classification resolution at the centimeter scale.Ultimately,the two actual cases show tricks for using GCN models to predict potential microbialite in other formations and areas,proving that the GCN model can be adopted in the industry.
基金financial support from the National Natural Science Foundation of China(Grant Nos.71971079,72271087,and 71871088)the Major Projects of the National Social Science Foundation of China(Grant No.21ZDA114)+1 种基金the National Social Science Foundation of China(Grant No.19BTJ018)the Hunan Provincial Natural Science Foundation of China(Grant No.21JJ20019).
文摘Cryptocurrency is a remarkable financial innovation that has affected the financial system in fundamental ways.Its increasingly complex interactions with the conventional financial market make precisely forecasting its volatility increasingly challenging.To this end,we propose a novel framework based on the evolving multiscale graph neural network(EMGNN).Specifically,we embed a graph that depicts the interactions between the cryptocurrency and conventional financial markets into the predictive process.Furthermore,we employ hierarchical evolving graph structure learners to model the dynamic and scale-specific interactions.We also evaluate our framework’s robustness and discuss its interpretability by extracting the learned graph structure.The empirical results show that(i)cryptocurrency volatility is not isolated from the conventional market,and the embedded graph can provide effective information for prediction;(ii)the EMGNN-based forecasting framework generally yields outstanding and robust performance in terms of multiple volatility estimators,cryptocurrency samples,forecasting horizons,and evaluation criteria;and(iii)the graph structure in the predictive process varies over time and scales and is well captured by our framework.Overall,our work provides new insights into risk management for market participants and into policy formulation for authorities.
文摘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.
基金supported by Key Laboratory of Smart Earth(KF2023ZD03-05)CMA Innovative and Development Program(CXFZ.20231035)+2 种基金National Key R&D Program of China(No.2021ZD0111902)National Natural Science Foundation of China(Nos.62472014,U21B2038)the Scientific and Technological Project of China Meteorological Administration(CMAJBGS202505).
文摘Weather forecasting is crucial for agriculture,transportation,and industry.Deep Learning(DL)has greatly improved the prediction accuracy.Among them,Graph Neural Networks(GNNs)excel at processing weather data by establishing connections between regions.This allows them to understand complex patterns that traditional methods might miss.As a result,achieving more accurate predictions becomes possible.The paper reviews the role of GNNs in short-to medium-range weather forecasting.The methods are classified into three categories based on dataset differences.The paper also further identifies five promising research frontiers.These areas aim to boost forecasting precision and enhance computational efficiency.They offer valuable insights for future weather forecasting systems.
基金supported by the National Natural Science Foundation of China(62276049,61701078,61872068,and 62006038)the Natural Science Foundation of Sichuan Province(2025ZNSFSC0487)+3 种基金the Science and Technology Innovation 2030-Brain Science and Brain-Inspired Intelligence Project(2021ZD0200200)the National Key R&D Program of China(2023YFE0118600)Sichuan Province Science and Technology Support Program(2019YJ0193,2021YFG0126,2021YFG0366,and 2022YFS0180)Medico-Engineering Cooperation Funds from the University of Electronic Science and Technology of China(ZYGX2021YGLH014).
文摘Schizophrenia(SZ)stands as a severe psychiatric disorder.This study applied diffusion tensor imaging(DTI)data in conjunction with graph neural networks to distinguish SZ patients from normal controls(NCs)and showcases the superior performance of a graph neural network integrating combined fractional anisotropy and fiber number brain network features,achieving an accuracy of 73.79%in distinguishing SZ patients from NCs.Beyond mere discrimination,our study delved deeper into the advantages of utilizing white matter brain network features for identifying SZ patients through interpretable model analysis and gene expression analysis.These analyses uncovered intricate interrelationships between brain imaging markers and genetic biomarkers,providing novel insights into the neuropathological basis of SZ.In summary,our findings underscore the potential of graph neural networks applied to multimodal DTI data for enhancing SZ detection through an integrated analysis of neuroimaging and genetic features.
基金supported by the National Key R&D Program of China(2022YFA1305700 to Li J)the“Dawn”Program of Shanghai Education Commission,China(21SG33 to Li J)The National Natural Science Foundation of China(82272793 to Gao X).
文摘Objective:Prostate cancer(PCa)exhibits significant genomic differences between Western and Asian populations.This study aimed to design a predictive model applicable across diverse populations while selecting a limited set of genes suitable for clinical implementation.Methods:We utilized an integrated dataset of 1360 whole-exome and whole-genome sequences from Chinese and Western PCa cohorts to develop and evaluate the model.External validation was conducted using an independent cohort of patients.A graph neural network architecture,termed the pathway-aware multi-layered hierarchical network-Western and Asian(P-NETwa),was developed and trained on combined genomic profiles from Chinese and Western cohorts.The model employed a multilayer perceptron(MLP)to identify key signature genes from multiomics data,enabling precise prediction of PCa metastasis.Results:The model achieved an accuracy of 0.87 and an F1-score of 0.85 on Western population datasets.The application of integrated Chinese and Western population data improved the accuracy to 0.88,achieving an F1-score of 0.75.The analysis identified 18 signature genes implicated in PCa progression,including established markers(AR and TP53)and novel candidates(MUC16,MUC4,and ASB12).For clinical adoption,the model was optimized for commercially available gene panels while maintaining high classification accuracy.Additionally,a user-friendly web interface was developed to facilitate real-time prediction of primary versus metastatic status using the pre-trained P-NETwa-MLP model.Conclusion:The P-NETwa-MLP model integrates a query system that allows for efficient retrieval of prediction outcomes and associated genomic signatures via sample ID,enhancing its potential for seamless integration into clinical workflows.
基金supported by the National Natural Science Foundation of China(NSFC)(61821005).
文摘Metal–organic frameworks(MOFs)hold great potential for gas separation and storage,and graph neural networks have proven to be a powerful tool for exploring material structure–property relationships and discovering new materials.Unlike traditional molecular graphs,crystal graphs require consideration of periodic invariance and modes.In addition,MOF structures such as covalent bonds,functional groups,and global structures impact adsorption performance in different ways.However,redundant atomic interactions can disrupt training accuracy,potentially leading to overfitting.In this paper,we propose a multi-scale crystal graph for describing periodic crystal structures,modeling interatomic interactions at different scales while preserving periodicity invariance.We also propose a multi-head attention crystal graph network in multi-scale graphs(MHACGN-MS),which learns structural characteristics by focusing on interatomic interactions at different scales,thereby reducing interference from redundant interactions.Using MOF adsorption for gases as an example,we demonstrate that MHACGN-MS outperforms traditional graph neural networks in predicting multi-component gas adsorption.We also visualize attention scores to validate effective learning and demonstrate the model’s interpretability.
基金supported by the National Natural Science Foundation of China (No. 52274048)Beijing Natural Science Foundation (No. 3222037)。
文摘With the rapid development of deep learning neural networks,new solutions have emerged for addressing fluid flow problems in porous media.Combining data-driven approaches with physical constraints has become a hot research direction,with physics-informed neural networks(PINNs) being the most popular hybrid model.PINNs have gained widespread attention in subsurface fluid flow simulations due to their low computational resource requirements,fast training speeds,strong generalization capabilities,and broad applicability.Despite success in homogeneous settings,standard PINNs face challenges in accurately calculating flux between irregular Eulerian cells with disparate properties and capturing global field influences on local cells.This limits their suitability for heterogeneous reservoirs and the irregular Eulerian grids frequently used in reservoir.To address these challenges,this study proposes a physics-informed graph neural network(PIGNN) model.The PIGNN model treats the entire field as a whole,integrating information from neighboring grids and physical laws into the solution for the target grid,thereby improving the accuracy of solving partial differential equations in heterogeneous and Eulerian irregular grids.The optimized model was applied to pressure field prediction in a spatially heterogeneous reservoir,achieving an average L_(2) error and R_(2) score of 6.710×10^(-4)and 0.998,respectively,which confirms the effectiveness of model.Compared to the conventional PINN model,the average L_(2) error was reduced by 76.93%,the average R_(2) score increased by 3.56%.Moreover,evaluating robustness,training the PIGNN model using only 54% and 76% of the original data yielded average relative L_(2) error reductions of 58.63% and 56.22%,respectively,compared to the PINN model.These results confirm the superior performance of this approach compared to PINN.
基金funded by Soonchunhyang University,Grant Numbers 20241422BK21 FOUR(Fostering Outstanding Universities for Research,Grant Number 5199990914048).
文摘Recommendation systems(RSs)are crucial in personalizing user experiences in digital environments by suggesting relevant content or items.Collaborative filtering(CF)is a widely used personalization technique that leverages user-item interactions to generate recommendations.However,it struggles with challenges like the cold-start problem,scalability issues,and data sparsity.To address these limitations,we develop a Graph Convolutional Networks(GCNs)model that captures the complex network of interactions between users and items,identifying subtle patterns that traditional methods may overlook.We integrate this GCNs model into a federated learning(FL)framework,enabling themodel to learn fromdecentralized datasets.This not only significantly enhances user privacy—a significant improvement over conventionalmodels but also reassures users about the safety of their data.Additionally,by securely incorporating demographic information,our approach further personalizes recommendations and mitigates the coldstart issue without compromising user data.We validate our RSs model using the openMovieLens dataset and evaluate its performance across six key metrics:Precision,Recall,Area Under the Receiver Operating Characteristic Curve(ROC-AUC),F1 Score,Normalized Discounted Cumulative Gain(NDCG),and Mean Reciprocal Rank(MRR).The experimental results demonstrate significant enhancements in recommendation quality,underscoring that combining GCNs with CF in a federated setting provides a transformative solution for advanced recommendation systems.
