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.展开更多
Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)t...Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)techniques for DDoS attack diagnosis normally apply network traffic statistical features such as packet sizes and inter-arrival times.However,such techniques sometimes fail to capture complicated relations among various traffic flows.In this paper,we present a new multi-scale ensemble strategy given the Graph Neural Networks(GNNs)for improving DDoS detection.Our technique divides traffic into macro-and micro-level elements,letting various GNN models to get the two corase-scale anomalies and subtle,stealthy attack models.Through modeling network traffic as graph-structured data,GNNs efficiently learn intricate relations among network entities.The proposed ensemble learning algorithm combines the results of several GNNs to improve generalization,robustness,and scalability.Extensive experiments on three benchmark datasets—UNSW-NB15,CICIDS2017,and CICDDoS2019—show that our approach outperforms traditional machine learning and deep learning models in detecting both high-rate and low-rate(stealthy)DDoS attacks,with significant improvements in accuracy and recall.These findings demonstrate the suggested method’s applicability and robustness for real-world implementation in contexts where several DDoS patterns coexist.展开更多
With network attack technology continuing to develop,traditional anomaly traffic detection methods that rely on feature engineering are increasingly insufficient in efficiency and accuracy.Graph Neural Network(GNN),a ...With network attack technology continuing to develop,traditional anomaly traffic detection methods that rely on feature engineering are increasingly insufficient in efficiency and accuracy.Graph Neural Network(GNN),a promising Deep Learning(DL)approach,has proven to be highly effective in identifying intricate patterns in graph⁃structured data and has already found wide applications in the field of network security.In this paper,we propose a hybrid Graph Convolutional Network(GCN)⁃GraphSAGE model for Anomaly Traffic Detection,namely HGS⁃ATD,which aims to improve the accuracy of anomaly traffic detection by leveraging edge feature learning to better capture the relationships between network entities.We validate the HGS⁃ATD model on four publicly available datasets,including NF⁃UNSW⁃NB15⁃v2.The experimental results show that the enhanced hybrid model is 5.71%to 10.25%higher than the baseline model in terms of accuracy,and the F1⁃score is 5.53%to 11.63%higher than the baseline model,proving that the model can effectively distinguish normal traffic from attack traffic and accurately classify various types of attacks.展开更多
Skin diseases affect millions worldwide.Early detection is key to preventing disfigurement,lifelong disability,or death.Dermoscopic images acquired in primary-care settings show high intra-class visual similarity and ...Skin diseases affect millions worldwide.Early detection is key to preventing disfigurement,lifelong disability,or death.Dermoscopic images acquired in primary-care settings show high intra-class visual similarity and severe class imbalance,and occasional imaging artifacts can create ambiguity for state-of-the-art convolutional neural networks(CNNs).We frame skin lesion recognition as graph-based reasoning and,to ensure fair evaluation and avoid data leakage,adopt a strict lesion-level partitioning strategy.Each image is first over-segmented using SLIC(Simple Linear Iterative Clustering)to produce perceptually homogeneous superpixels.These superpixels form the nodes of a region-adjacency graph whose edges encode spatial continuity.Node attributes are 1280-dimensional embeddings extracted with a lightweight yet expressive EfficientNet-B0 backbone,providing strong representational power at modest computational cost.The resulting graphs are processed by a five-layer Graph Attention Network(GAT)that learns to weight inter-node relationships dynamically and aggregates multi-hop context before classifying lesions into seven classes with a log-softmax output.Extensive experiments on the DermaMNIST benchmark show the proposed pipeline achieves 88.35%accuracy and 98.04%AUC,outperforming contemporary CNNs,AutoML approaches,and alternative graph neural networks.An ablation study indicates EfficientNet-B0 produces superior node descriptors compared with ResNet-18 and DenseNet,and that roughly five GAT layers strike a good balance between being too shallow and over-deep while avoiding oversmoothing.The method requires no data augmentation or external metadata,making it a drop-in upgrade for clinical computer-aided diagnosis systems.展开更多
The node labels collected from real-world applications are often accompanied by the occurrence of in-distribution noise(seen class nodes with wrong labels) and out-of-distribution noise(unseen class nodes with seen cl...The node labels collected from real-world applications are often accompanied by the occurrence of in-distribution noise(seen class nodes with wrong labels) and out-of-distribution noise(unseen class nodes with seen class labels), which significantly degrade the superior performance of recently emerged open-set graph neural networks(GNN). Nowadays, only a few researchers have attempted to introduce sample selection strategies developed in non-graph areas to limit the influence of noisy node labels. These studies often neglect the impact of inaccurate graph structure relationships, invalid utilization of noisy nodes and unlabeled nodes self-supervision information for noisy node labels constraint. More importantly, simply enhancing the accuracy of graph structure relationships or the utilization of nodes' self-supervision information still cannot minimize the influence of noisy node labels for open-set GNN. In this paper, we propose a novel RT-OGNN(robust training of open-set GNN) framework to solve the above-mentioned issues. Specifically, an effective graph structure learning module is proposed to weaken the impact of structure noise and extend the receptive field of nodes. Then, the augmented graph is sent to a pair of peer GNNs to accurately distinguish noisy node labels of labeled nodes. Third, the label propagation and multilayer perceptron-based decoder modules are simultaneously introduced to discover more supervision information from remaining nodes apart from clean nodes. Finally, we jointly optimize the above modules and open-set GNN in an end-to-end way via consistency regularization loss and cross-entropy loss, which minimizes the influence of noisy node labels and provides more supervision guidance for open-set GNN optimization.Extensive experiments on three benchmarks and various noise rates validate the superiority of RT-OGNN over state-of-the-art models.展开更多
The adjoint method is widely used in gradient-based optimization with high-dimensional design variables.However,the cost of solving the adjoint equations in each iteration is comparable to that of solving the flow fie...The adjoint method is widely used in gradient-based optimization with high-dimensional design variables.However,the cost of solving the adjoint equations in each iteration is comparable to that of solving the flow field,resulting in expensive computational costs.To improve the efficiency of solving adjoint equations,we propose a physics-constrained graph neural networks for solving adjoint equations,named ADJ-PCGN.ADJ-PCGN establishes a mapping relationship between flow characteristics and adjoint vector based on data,serving as a replacement for the computationally expensive numerical solution of adjoint equations.A physics-based graph structure and message-passing mechanism are designed to endow its strong fitting and generalization capabilities.Taking transonic drag reduction and maximum lift-drag ratio of the airfoil as examples,results indicate that ADJ-PCGN attains a similar optimal shape as the classical direct adjoint loop method.In addition,ADJ-PCGN demonstrates strong generalization capabilities across different mesh topologies,mesh densities,and out-of-distribution conditions.It holds the potential to become a universal model for aerodynamic shape optimization involving states,geometries,and meshes.展开更多
Social bots are automated programs designed to spread rumors and misinformation,posing significant threats to online security.Existing research shows that the structure of a social network significantly affects the be...Social bots are automated programs designed to spread rumors and misinformation,posing significant threats to online security.Existing research shows that the structure of a social network significantly affects the behavioral patterns of social bots:a higher number of connected components weakens their collaborative capabilities,thereby reducing their proportion within the overall network.However,current social bot detection methods still make limited use of topological features.Furthermore,both graph neural network(GNN)-based methods that rely on local features and those that leverage global features suffer from their own limitations,and existing studies lack an effective fusion of multi-scale information.To address these issues,this paper proposes a topology-aware multi-scale social bot detection method,which jointly learns local and global representations through a co-training mechanism.At the local level,topological features are effectively embedded into node representations,enhancing expressiveness while alleviating the over-smoothing problem in GNNs.At the global level,a clustering attention mechanism is introduced to learn global node representations,mitigating the over-globalization problem.Experimental results demonstrate that our method effectively overcomes the limitations of single-scale approaches.Our code is publicly available at https://anonymous.4open.science/r/TopoMSG-2C41/(accessed on 27 October 2025).展开更多
This study proposes a novel forecasting framework that simultaneously captures the strong periodicity and irregular meteorological fluctuations inherent in solar radiation time series.Existing approaches typically def...This study proposes a novel forecasting framework that simultaneously captures the strong periodicity and irregular meteorological fluctuations inherent in solar radiation time series.Existing approaches typically define inter-regional correlations using either simple correlation coefficients or distance-based measures when applying spatio-temporal graph neural networks(STGNNs).However,such definitions are prone to generating spurious correlations due to the dominance of periodic structures.To address this limitation,we adopt the Elastic-Band Transform(EBT)to decompose solar radiation into periodic and amplitude-modulated components,which are then modeled independently with separate graph neural networks.The periodic component,characterized by strong nationwide correlations,is learned with a relatively simple architecture,whereas the amplitude-modulated component is modeled with more complex STGNNs that capture climatological similarities between regions.The predictions from the two components are subsequently recombined to yield final forecasts that integrate both periodic patterns and aperiodic variability.The proposed framework is validated with multiple STGNN architectures,and experimental results demonstrate improved predictive accuracy and interpretability compared to conventional methods.展开更多
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.展开更多
Accurate and efficient prediction of the distribution of surface loads on buildings subjected to explosive effects is crucial for rapidly calculating structural dynamic responses,establishing effective protective meas...Accurate and efficient prediction of the distribution of surface loads on buildings subjected to explosive effects is crucial for rapidly calculating structural dynamic responses,establishing effective protective measures,and designing civil defense engineering solutions.Current state-of-the-art methods face several issues:Experimental research is difficult and costly to implement,theoretical research is limited to simple geometries and lacks precision,and direct simulations require substantial computational resources.To address these challenges,this paper presents a data-driven method for predicting blast loads on building surfaces.This approach increases both the accuracy and computational efficiency of load predictions when the geometry of the building changes while the explosive yield remains constant,significantly improving its applicability in complex scenarios.This study introduces an innovative encoder-decoder graph neural network model named BlastGraphNet,which uses a message-passing mechanism to predict the overpressure and impulse load distributions on buildings with conventional and complex geometries during explosive events.The model also facilitates related downstream applications,such as damage mode identification and rapid assessment of virtual city explosions.The calculation results indicate that the prediction error of the model for conventional building tests is less than 2%,and its inference speed is 3-4 orders of magnitude faster than that of state-of-the-art numerical methods.In extreme test cases involving buildings with complex geometries and building clusters,the method achieved high accuracy and excellent generalizability.The strong adaptability and generalizability of BlastGraphNet confirm that this novel method enables precise real-time prediction of blast loads and provides a new paradigm for damage assessment in protective engineering.展开更多
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.展开更多
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.展开更多
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.展开更多
基金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.
文摘Distributed Denial of Service(DDoS)attacks are one of the severe threats to network infrastructure,sometimes bypassing traditional diagnosis algorithms because of their evolving complexity.PresentMachine Learning(ML)techniques for DDoS attack diagnosis normally apply network traffic statistical features such as packet sizes and inter-arrival times.However,such techniques sometimes fail to capture complicated relations among various traffic flows.In this paper,we present a new multi-scale ensemble strategy given the Graph Neural Networks(GNNs)for improving DDoS detection.Our technique divides traffic into macro-and micro-level elements,letting various GNN models to get the two corase-scale anomalies and subtle,stealthy attack models.Through modeling network traffic as graph-structured data,GNNs efficiently learn intricate relations among network entities.The proposed ensemble learning algorithm combines the results of several GNNs to improve generalization,robustness,and scalability.Extensive experiments on three benchmark datasets—UNSW-NB15,CICIDS2017,and CICDDoS2019—show that our approach outperforms traditional machine learning and deep learning models in detecting both high-rate and low-rate(stealthy)DDoS attacks,with significant improvements in accuracy and recall.These findings demonstrate the suggested method’s applicability and robustness for real-world implementation in contexts where several DDoS patterns coexist.
基金National Natural Science Foundation of China(Grant No.62103434)National Science Fund for Distinguished Young Scholars(Grant No.62176263).
文摘With network attack technology continuing to develop,traditional anomaly traffic detection methods that rely on feature engineering are increasingly insufficient in efficiency and accuracy.Graph Neural Network(GNN),a promising Deep Learning(DL)approach,has proven to be highly effective in identifying intricate patterns in graph⁃structured data and has already found wide applications in the field of network security.In this paper,we propose a hybrid Graph Convolutional Network(GCN)⁃GraphSAGE model for Anomaly Traffic Detection,namely HGS⁃ATD,which aims to improve the accuracy of anomaly traffic detection by leveraging edge feature learning to better capture the relationships between network entities.We validate the HGS⁃ATD model on four publicly available datasets,including NF⁃UNSW⁃NB15⁃v2.The experimental results show that the enhanced hybrid model is 5.71%to 10.25%higher than the baseline model in terms of accuracy,and the F1⁃score is 5.53%to 11.63%higher than the baseline model,proving that the model can effectively distinguish normal traffic from attack traffic and accurately classify various types of attacks.
基金funded by the Deanship of Graduate Studies and Scientific Research at Jouf University under grant No.(DGSSR-2025-02-01296).
文摘Skin diseases affect millions worldwide.Early detection is key to preventing disfigurement,lifelong disability,or death.Dermoscopic images acquired in primary-care settings show high intra-class visual similarity and severe class imbalance,and occasional imaging artifacts can create ambiguity for state-of-the-art convolutional neural networks(CNNs).We frame skin lesion recognition as graph-based reasoning and,to ensure fair evaluation and avoid data leakage,adopt a strict lesion-level partitioning strategy.Each image is first over-segmented using SLIC(Simple Linear Iterative Clustering)to produce perceptually homogeneous superpixels.These superpixels form the nodes of a region-adjacency graph whose edges encode spatial continuity.Node attributes are 1280-dimensional embeddings extracted with a lightweight yet expressive EfficientNet-B0 backbone,providing strong representational power at modest computational cost.The resulting graphs are processed by a five-layer Graph Attention Network(GAT)that learns to weight inter-node relationships dynamically and aggregates multi-hop context before classifying lesions into seven classes with a log-softmax output.Extensive experiments on the DermaMNIST benchmark show the proposed pipeline achieves 88.35%accuracy and 98.04%AUC,outperforming contemporary CNNs,AutoML approaches,and alternative graph neural networks.An ablation study indicates EfficientNet-B0 produces superior node descriptors compared with ResNet-18 and DenseNet,and that roughly five GAT layers strike a good balance between being too shallow and over-deep while avoiding oversmoothing.The method requires no data augmentation or external metadata,making it a drop-in upgrade for clinical computer-aided diagnosis systems.
基金supported by the General Program of the National Natural Science Foundation of China (Grant No.62575116)the National Natural Science Foundation of China (Grant No.62262005)+1 种基金the High-level Innovative Talents in Guizhou Province (Grant No.GCC[2023]033)the Open Project of the Text Computing and Cognitive Intelligence Ministry of Education Engineering Research Center(Grant No.TCCI250208)。
文摘The node labels collected from real-world applications are often accompanied by the occurrence of in-distribution noise(seen class nodes with wrong labels) and out-of-distribution noise(unseen class nodes with seen class labels), which significantly degrade the superior performance of recently emerged open-set graph neural networks(GNN). Nowadays, only a few researchers have attempted to introduce sample selection strategies developed in non-graph areas to limit the influence of noisy node labels. These studies often neglect the impact of inaccurate graph structure relationships, invalid utilization of noisy nodes and unlabeled nodes self-supervision information for noisy node labels constraint. More importantly, simply enhancing the accuracy of graph structure relationships or the utilization of nodes' self-supervision information still cannot minimize the influence of noisy node labels for open-set GNN. In this paper, we propose a novel RT-OGNN(robust training of open-set GNN) framework to solve the above-mentioned issues. Specifically, an effective graph structure learning module is proposed to weaken the impact of structure noise and extend the receptive field of nodes. Then, the augmented graph is sent to a pair of peer GNNs to accurately distinguish noisy node labels of labeled nodes. Third, the label propagation and multilayer perceptron-based decoder modules are simultaneously introduced to discover more supervision information from remaining nodes apart from clean nodes. Finally, we jointly optimize the above modules and open-set GNN in an end-to-end way via consistency regularization loss and cross-entropy loss, which minimizes the influence of noisy node labels and provides more supervision guidance for open-set GNN optimization.Extensive experiments on three benchmarks and various noise rates validate the superiority of RT-OGNN over state-of-the-art models.
基金supported by the National Natural Science Foundation of China(Grant No.12272316).
文摘The adjoint method is widely used in gradient-based optimization with high-dimensional design variables.However,the cost of solving the adjoint equations in each iteration is comparable to that of solving the flow field,resulting in expensive computational costs.To improve the efficiency of solving adjoint equations,we propose a physics-constrained graph neural networks for solving adjoint equations,named ADJ-PCGN.ADJ-PCGN establishes a mapping relationship between flow characteristics and adjoint vector based on data,serving as a replacement for the computationally expensive numerical solution of adjoint equations.A physics-based graph structure and message-passing mechanism are designed to endow its strong fitting and generalization capabilities.Taking transonic drag reduction and maximum lift-drag ratio of the airfoil as examples,results indicate that ADJ-PCGN attains a similar optimal shape as the classical direct adjoint loop method.In addition,ADJ-PCGN demonstrates strong generalization capabilities across different mesh topologies,mesh densities,and out-of-distribution conditions.It holds the potential to become a universal model for aerodynamic shape optimization involving states,geometries,and meshes.
基金supported by“the Fundamental Research Funds for the Central Universities”(Grant No.CUCAI2511).
文摘Social bots are automated programs designed to spread rumors and misinformation,posing significant threats to online security.Existing research shows that the structure of a social network significantly affects the behavioral patterns of social bots:a higher number of connected components weakens their collaborative capabilities,thereby reducing their proportion within the overall network.However,current social bot detection methods still make limited use of topological features.Furthermore,both graph neural network(GNN)-based methods that rely on local features and those that leverage global features suffer from their own limitations,and existing studies lack an effective fusion of multi-scale information.To address these issues,this paper proposes a topology-aware multi-scale social bot detection method,which jointly learns local and global representations through a co-training mechanism.At the local level,topological features are effectively embedded into node representations,enhancing expressiveness while alleviating the over-smoothing problem in GNNs.At the global level,a clustering attention mechanism is introduced to learn global node representations,mitigating the over-globalization problem.Experimental results demonstrate that our method effectively overcomes the limitations of single-scale approaches.Our code is publicly available at https://anonymous.4open.science/r/TopoMSG-2C41/(accessed on 27 October 2025).
基金supported by Basic Science Research Program through the National Research Foundation of Korea(NRF)funded by the Ministry of Education(RS-2023-00249743).
文摘This study proposes a novel forecasting framework that simultaneously captures the strong periodicity and irregular meteorological fluctuations inherent in solar radiation time series.Existing approaches typically define inter-regional correlations using either simple correlation coefficients or distance-based measures when applying spatio-temporal graph neural networks(STGNNs).However,such definitions are prone to generating spurious correlations due to the dominance of periodic structures.To address this limitation,we adopt the Elastic-Band Transform(EBT)to decompose solar radiation into periodic and amplitude-modulated components,which are then modeled independently with separate graph neural networks.The periodic component,characterized by strong nationwide correlations,is learned with a relatively simple architecture,whereas the amplitude-modulated component is modeled with more complex STGNNs that capture climatological similarities between regions.The predictions from the two components are subsequently recombined to yield final forecasts that integrate both periodic patterns and aperiodic variability.The proposed framework is validated with multiple STGNN architectures,and experimental results demonstrate improved predictive accuracy and interpretability compared to conventional methods.
基金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.
基金supported by the National Natural Science Founion of China(U2241285).
文摘Accurate and efficient prediction of the distribution of surface loads on buildings subjected to explosive effects is crucial for rapidly calculating structural dynamic responses,establishing effective protective measures,and designing civil defense engineering solutions.Current state-of-the-art methods face several issues:Experimental research is difficult and costly to implement,theoretical research is limited to simple geometries and lacks precision,and direct simulations require substantial computational resources.To address these challenges,this paper presents a data-driven method for predicting blast loads on building surfaces.This approach increases both the accuracy and computational efficiency of load predictions when the geometry of the building changes while the explosive yield remains constant,significantly improving its applicability in complex scenarios.This study introduces an innovative encoder-decoder graph neural network model named BlastGraphNet,which uses a message-passing mechanism to predict the overpressure and impulse load distributions on buildings with conventional and complex geometries during explosive events.The model also facilitates related downstream applications,such as damage mode identification and rapid assessment of virtual city explosions.The calculation results indicate that the prediction error of the model for conventional building tests is less than 2%,and its inference speed is 3-4 orders of magnitude faster than that of state-of-the-art numerical methods.In extreme test cases involving buildings with complex geometries and building clusters,the method achieved high accuracy and excellent generalizability.The strong adaptability and generalizability of BlastGraphNet confirm that this novel method enables precise real-time prediction of blast loads and provides a new paradigm for damage assessment in protective engineering.
基金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.
文摘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(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.
