Federated Graph Learning (FGL) enables model training without requiring each client to share local graph data, effectively breaking data silos by aggregating the training parameters from each terminal while safeguardi...Federated Graph Learning (FGL) enables model training without requiring each client to share local graph data, effectively breaking data silos by aggregating the training parameters from each terminal while safeguarding data privacy. Traditional FGL relies on a centralized server for model aggregation;however, this central server presents challenges such as a single point of failure and high communication overhead. Additionally, efficiently training a robust personalized local model for each client remains a significant objective in federated graph learning. To address these issues, we propose a decentralized Federated Graph Learning framework with efficient communication, termed Decentralized Federated Graph Learning via Surrogate Model (SD_FGL). In SD_FGL, each client is required to maintain two models: a private model and a surrogate model. The surrogate model is publicly shared and can exchange and update information directly with any client, eliminating the need for a central server and reducing communication overhead. The private model is independently trained by each client, allowing it to calculate similarity with other clients based on local data as well as information shared through the surrogate model. This enables the private model to better adjust its training strategy and selectively update its parameters. Additionally, local differential privacy is incorporated into the surrogate model training process to enhance privacy protection. Testing on three real-world graph datasets demonstrates that the proposed framework improves accuracy while achieving decentralized Federated Graph Learning with lower communication overhead and stronger privacy safeguards.展开更多
Federated learning is a classic of privacy-preserving learning, which enables collaborative learning without sharing data. Structured data has become the mainstream of current applications, where there is a correlatio...Federated learning is a classic of privacy-preserving learning, which enables collaborative learning without sharing data. Structured data has become the mainstream of current applications, where there is a correlation between samples in the same dataset, which can be represented by a graph. Federated graph learning (FGL) is the integration of structured data into federated learning, assuming that each user has structured graph representation data and uses graph learning models for training. This article proposes an FGL algorithm based on graph distance calculation, which determines the similarity of users in terms of graph distance, then clusters users, and aggregates local models of users in the same cluster. This algorithm can adjust the number of clusters by changing the threshold (the larger the threshold, the fewer clusters and the more users in each cluster, and vice versa), thereby controlling the scope of user collaboration.展开更多
Graph learning is an effective manner to analyze the intrinsic properties of data.It has been widely used in the fields of dimensionality reduction and classification for data.In this paper,we focus on the graph learn...Graph learning is an effective manner to analyze the intrinsic properties of data.It has been widely used in the fields of dimensionality reduction and classification for data.In this paper,we focus on the graph learning-based dimensionality reduction for a hyperspectral image.Firstly,we review the development of graph learning and its application in a hyperspectral image.Then,we mainly discuss several representative graph methods including two manifold learning methods,two sparse graph learning methods,and two hypergraph learning methods.For manifold learning,we analyze neighborhood preserving embedding and locality preserving projections which are two classic manifold learning methods and can be transformed into the form of a graph.For sparse graph,we introduce sparsity preserving graph embedding and sparse graph-based discriminant analysis which can adaptively reveal data structure to construct a graph.For hypergraph learning,we review binary hypergraph and discriminant hyper-Laplacian projection which can represent the high-order relationship of data.展开更多
Using resting-state functional magnetic resonance imaging (fMRI) technology to assist in identifying brain diseases has great potential. In the identification of brain diseases, graph-based models have been widely use...Using resting-state functional magnetic resonance imaging (fMRI) technology to assist in identifying brain diseases has great potential. In the identification of brain diseases, graph-based models have been widely used, where graph represents the similarity between patients or brain regions of interest. In these models, constructing high-quality graphs is of paramount importance. Researchers have proposed various methods for constructing graphs from different perspectives, among which the simplest and most popular one is Pearson Correlation (PC). Although existing methods have achieved significant results, these graphs are usually fixed once they are constructed, and are generally operated separately from downstream task. Such a separation may result in neither the constructed graph nor the extracted features being ideal. To solve this problem, we use the graph-optimized locality preserving projection algorithm to extract features and the population graph simultaneously, aiming in higher identification accuracy through a task-dependent automatic optimization of the graph. At the same time, we incorporate supervised information to enable more flexible modelling. Specifically, the proposed method first uses PC to construct graph as the initial feature for each subject. Then, the projection matrix and graph are iteratively optimized through graph-optimization locality preserving projections based on semi-supervised learning, which fully employs the knowledge in various transformation spaces. Finally, the obtained projection matrix is applied to construct the subject-level graph and perform classification using support vector machines. To verify the effectiveness of the proposed method, we conduct experiments to identify subjects with mild cognitive impairment (MCI) and Autism spectrum disorder (ASD) from normal controls (NCs), and the results showed that the classification performance of our method is better than that of the baseline method.展开更多
Accurately predicting the State of Health(SOH)of lithium-ion batteries is a critical challenge to ensure their reliability and safety in energy storage systems,such as electric vehicles and renewable energy grids.The ...Accurately predicting the State of Health(SOH)of lithium-ion batteries is a critical challenge to ensure their reliability and safety in energy storage systems,such as electric vehicles and renewable energy grids.The intricate battery degradation process is influenced by evolving spatial and temporal interactions among health indicators.Existing methods often fail to capture the dynamic interactions between health indicators over time,resulting in limited predictive accuracy.To address these challenges,we propose a novel framework,Dynamic Graph Learning with Spatial-Temporal Fusion Attention(DGL-STFA),which transforms health indicator series time-data into time-evolving graph representations.The framework employs multi-scale convolutional neural networks to capture diverse temporal patterns,a self-attention mechanism to construct dynamic adjacency matrices that adapt over time,and a temporal attention mechanism to identify and prioritize key moments that influence battery degradation.This combination enables DGL-STFA to effectively model both dynamic spatial relationships and long-term temporal dependencies,enhancing SOH prediction accuracy.Extensive experiments were conducted on the NASA and CALCE battery datasets,comparing this framework with traditional time-series prediction methods and other graph-based prediction methods.The results demonstrate that our framework significantly improves prediction accuracy,with a mean absolute error more than 30%lower than other methods.Further analysis demonstrated the robustness of DGL-STFA across various battery life stages,including early,mid,and end-of-life phases.These results highlight the capability of DGL-STFA to accurately predict SOH,addressing critical challenges in advancing battery health monitoring for energy storage applications.展开更多
Graph similarity learning aims to calculate the similarity between pairs of graphs.Existing unsupervised graph similarity learning methods based on contrastive learning encounter challenges related to random graph aug...Graph similarity learning aims to calculate the similarity between pairs of graphs.Existing unsupervised graph similarity learning methods based on contrastive learning encounter challenges related to random graph augmentation strategies,which can harm the semantic and structural information of graphs and overlook the rich structural information present in subgraphs.To address these issues,we propose a graph similarity learning model based on learnable augmentation and multi-level contrastive learning.First,to tackle the problem of random augmentation disrupting the semantics and structure of the graph,we design a learnable augmentation method to selectively choose nodes and edges within the graph.To enhance contrastive levels,we employ a biased random walk method to generate corresponding subgraphs,enriching the contrastive hierarchy.Second,to solve the issue of previous work not considering multi-level contrastive learning,we utilize graph convolutional networks to learn node representations of augmented views and the original graph and calculate the interaction information between the attribute-augmented and structure-augmented views and the original graph.The goal is to maximize node consistency between different views and learn node matching between different graphs,resulting in node-level representations for each graph.Subgraph representations are then obtained through pooling operations,and we conduct contrastive learning utilizing both node and subgraph representations.Finally,the graph similarity score is computed according to different downstream tasks.We conducted three sets of experiments across eight datasets,and the results demonstrate that the proposed model effectively mitigates the issues of random augmentation damaging the original graph’s semantics and structure,as well as the insufficiency of contrastive levels.Additionally,the model achieves the best overall performance.展开更多
Social media has significantly accelerated the rapid dissemination of information,but it also boosts propagation of fake news,posing serious challenges to public awareness and social stability.In real-world contexts,t...Social media has significantly accelerated the rapid dissemination of information,but it also boosts propagation of fake news,posing serious challenges to public awareness and social stability.In real-world contexts,the volume of trustable information far exceeds that of rumors,resulting in a class imbalance that leads models to prioritize the majority class during training.This focus diminishes the model’s ability to recognize minority class samples.Furthermore,models may experience overfitting when encountering these minority samples,further compromising their generalization capabilities.Unlike node-level classification tasks,fake news detection in social networks operates on graph-level samples,where traditional interpolation and oversampling methods struggle to effectively generate high-quality graph-level samples.This challenge complicates the identification of new instances of false information.To address this issue,this paper introduces the FHGraph(Fake News Hunting Graph)framework,which employs a generative data augmentation approach and a latent diffusion model to create graph structures that align with news communication patterns.Using the few-sample learning capabilities of large language models(LLMs),the framework generates diverse texts for minority class nodes.FHGraph comprises a hierarchical multiview graph contrastive learning module,in which two horizontal views and three vertical levels are utilized for self-supervised learning,resulting in more optimized representations.Experimental results show that FHGraph significantly outperforms state-of-the-art(SOTA)graph-level class imbalance methods and SOTA graph-level contrastive learning methods.Specifically,FHGraph has achieved a 2%increase in F1 Micro and a 2.5%increase in F1 Macro in the PHEME dataset,as well as a 3.5%improvement in F1 Micro and a 4.3%improvement in F1 Macro on RumorEval dataset.展开更多
The increase in population and vehicles exacerbates traffic congestion and management difficulties.Therefore,achieving accurate and efficient traffic flow prediction is crucial for urban transportation.For that reason...The increase in population and vehicles exacerbates traffic congestion and management difficulties.Therefore,achieving accurate and efficient traffic flow prediction is crucial for urban transportation.For that reason,we propose a graph federated learning-based digital twin traffic flow prediction method(GFLDT)by integrating the benefits of collaborative intelligence and computation of intelligent IoT.Specifically,we construct a digital twin network for predicting traffic flow,which is divided into client twin and global twin.Based on this,we adopt the concept of graph federated learning to learn the temporal dependence of traffic flow using local data from client twins,and the spatial dependence of traffic flow using global information from global twins.In addition,we validate on a real traffic dataset,and the results show that through collaborative training of the client twins and the global twins,GFLDT achieves accurate traffic flow prediction while protecting data security.展开更多
The remarkable success in graph neural networks(GNNs)promotes the explainable graph learning methods.Among them,the graph rationalization methods draw significant attentions,which aim to provide explanations to suppor...The remarkable success in graph neural networks(GNNs)promotes the explainable graph learning methods.Among them,the graph rationalization methods draw significant attentions,which aim to provide explanations to support the prediction results by identifying a small subset of the original graph(i.e.,rationale).Although existing methods have achieved promising results,recent studies have proved that these methods still suffer from exploiting shortcuts in the data to yield task results and compose rationales.Different from previous methods plagued by shortcuts,in this paper,we propose a Shortcut-guided Graph Rationalization(SGR)method,which identifies rationales by learning from shortcuts.Specifically,SGR consists of two training stages.In the first stage,we train a shortcut guider with an early stop strategy to obtain shortcut information.During the second stage,SGR separates the graph into the rationale and non-rationale subgraphs.Then SGR lets them learn from the shortcut information generated by the frozen shortcut guider to identify which information belongs to shortcuts and which does not.Finally,we employ the non-rationale subgraphs as environments and identify the invariant rationales which filter out the shortcuts under environment shifts.Extensive experiments conducted on synthetic and real-world datasets provide clear validation of the effectiveness of the proposed SGR method,underscoring its ability to provide faithful explanations.展开更多
With the rapid development of Internet of Things(IoT)technology,IoT systems have been widely applied in health-care,transportation,home,and other fields.However,with the continuous expansion of the scale and increasin...With the rapid development of Internet of Things(IoT)technology,IoT systems have been widely applied in health-care,transportation,home,and other fields.However,with the continuous expansion of the scale and increasing complexity of IoT systems,the stability and security issues of IoT systems have become increasingly prominent.Thus,it is crucial to detect anomalies in the collected IoT time series from various sensors.Recently,deep learning models have been leveraged for IoT anomaly detection.However,owing to the challenges associated with data labeling,most IoT anomaly detection methods resort to unsupervised learning techniques.Nevertheless,the absence of accurate abnormal information in unsupervised learning methods limits their performance.To address these problems,we propose AS-GCN-MTM,an adaptive structural Graph Convolutional Networks(GCN)-based framework using a mean-teacher mechanism(AS-GCN-MTM)for anomaly identification.It performs better than unsupervised methods using only a small amount of labeled data.Mean Teachers is an effective semi-supervised learning method that utilizes unlabeled data for training to improve the generalization ability and performance of the model.However,the dependencies between data are often unknown in time series data.To solve this problem,we designed a graph structure adaptive learning layer based on neural networks,which can automatically learn the graph structure from time series data.It not only better captures the relationships between nodes but also enhances the model’s performance by augmenting key data.Experiments have demonstrated that our method improves the baseline model with the highest F1 value by 10.4%,36.1%,and 5.6%,respectively,on three real datasets with a 10%data labeling rate.展开更多
Graph learning,when used as a semi-supervised learning(SSL)method,performs well for classification tasks with a low label rate.We provide a graph-based batch active learning pipeline for pixel/patch neighborhood multi...Graph learning,when used as a semi-supervised learning(SSL)method,performs well for classification tasks with a low label rate.We provide a graph-based batch active learning pipeline for pixel/patch neighborhood multi-or hyperspectral image segmentation.Our batch active learning approach selects a collection of unlabeled pixels that satisfy a graph local maximum constraint for the active learning acquisition function that determines the relative importance of each pixel to the classification.This work builds on recent advances in the design of novel active learning acquisition functions(e.g.,the Model Change approach in arXiv:2110.07739)while adding important further developments including patch-neighborhood image analysis and batch active learning methods to further increase the accuracy and greatly increase the computational efficiency of these methods.In addition to improvements in the accuracy,our approach can greatly reduce the number of labeled pixels needed to achieve the same level of the accuracy based on randomly selected labeled pixels.展开更多
An intelligent emotion recognition system based on electroencephalography(EEG)signals shows considerable potential in various domains such as healthcare,entertainment,and education,thanks to its portability,high tempo...An intelligent emotion recognition system based on electroencephalography(EEG)signals shows considerable potential in various domains such as healthcare,entertainment,and education,thanks to its portability,high temporal resolution,and real-time capabilities.However,the existing research in this field faces limitations stemming from the nonstationary nature and individual variability of EEG signals.In this study,we present a novel EEG emotion recognition model,named GraphEmotionNet,designed to enhance the accuracy of EEG-based emotion recognition through the incorporation of a spatiotemporal attention mechanism and transfer learning.The proposed GraphEmotionNet model can effectively learn the intrinsic connections between EEG channels and construct an adaptive graph.This graph’s adaptive nature is crucial in optimizing spatial-temporal graph convolutions,which in turn enhances spatial-temporal feature characterization and contributes to the process of emotion classification.Moreover,an integration of domain adaptation aligns the extracted features across different domains,further alleviating the impact of individual EEG variability.We evaluate the model performance on two benchmark databases,employing two types of cross-validation protocols:within-subject cross-validation and cross-subject cross-validation.The experimental results affirm the model’s efficacy in extracting EEG features linked to emotional semantics and demonstrate its promising performance in emotion recognition.展开更多
The accurate prediction of displacement is crucial for landslide deformation monitoring and early warning.This study focuses on a landslide in Wenzhou Belt Highway and proposes a novel multivariate landslide displacem...The accurate prediction of displacement is crucial for landslide deformation monitoring and early warning.This study focuses on a landslide in Wenzhou Belt Highway and proposes a novel multivariate landslide displacement prediction method that relies on graph deep learning and Global Navigation Satellite System(GNSS)positioning.First model the graph structure of the monitoring system based on the engineering positions of the GNSS monitoring points and build the adjacent matrix of graph nodes.Then construct the historical and predicted time series feature matrixes using the processed temporal data including GNSS displacement,rainfall,groundwater table and soil moisture content and the graph structure.Last introduce the state-of-the-art graph deep learning GTS(Graph for Time Series)model to improve the accuracy and reliability of landslide displacement prediction which utilizes the temporal-spatial dependency of the monitoring system.This approach outperforms previous studies that only learned temporal features from a single monitoring point and maximally weighs the prediction performance and the priori graph of the monitoring system.The proposed method performs better than SVM,XGBoost,LSTM and DCRNN models in terms of RMSE(1.35 mm),MAE(1.14 mm)and MAPE(0.25)evaluation metrics,which is provided to be effective in future landslide failure early warning.展开更多
Unsupervised learning methods such as graph contrastive learning have been used for dynamic graph represen-tation learning to eliminate the dependence of labels.However,existing studies neglect positional information ...Unsupervised learning methods such as graph contrastive learning have been used for dynamic graph represen-tation learning to eliminate the dependence of labels.However,existing studies neglect positional information when learning discrete snapshots,resulting in insufficient network topology learning.At the same time,due to the lack of appropriate data augmentation methods,it is difficult to capture the evolving patterns of the network effectively.To address the above problems,a position-aware and subgraph enhanced dynamic graph contrastive learning method is proposed for discrete-time dynamic graphs.Firstly,the global snapshot is built based on the historical snapshots to express the stable pattern of the dynamic graph,and the random walk is used to obtain the position representation by learning the positional information of the nodes.Secondly,a new data augmentation method is carried out from the perspectives of short-term changes and long-term stable structures of dynamic graphs.Specifically,subgraph sampling based on snapshots and global snapshots is used to obtain two structural augmentation views,and node structures and evolving patterns are learned by combining graph neural network,gated recurrent unit,and attention mechanism.Finally,the quality of node representation is improved by combining the contrastive learning between different structural augmentation views and between the two representations of structure and position.Experimental results on four real datasets show that the performance of the proposed method is better than the existing unsupervised methods,and it is more competitive than the supervised learning method under a semi-supervised setting.展开更多
The proliferation of internet traffic encryption has become a double-edged sword. While it significantly enhances user privacy, it also inadvertently shields cyber-attacks from detection, presenting a formidable chall...The proliferation of internet traffic encryption has become a double-edged sword. While it significantly enhances user privacy, it also inadvertently shields cyber-attacks from detection, presenting a formidable challenge to cybersecurity. Traditional machine learning and deep learning techniques often fall short in identifying encrypted malicious traffic due to their inability to fully extract and utilize the implicit relational and positional information embedded within data packets. This limitation has led to an unresolved challenge in the cybersecurity community: how to effectively extract valuable insights from the complex patterns of traffic packet transmission. Consequently, this paper introduces the TB-Graph model, an encrypted malicious traffic classification model based on a relational graph attention network. The model is a heterogeneous traffic burst graph that embeds side-channel features, which are unaffected by encryption, into the graph nodes and connects them with three different types of burst edges. Subsequently, we design a relational positional coding that prevents the loss of temporal relationships between the original traffic flows during graph transformation. Ultimately, TB-Graph leverages the powerful graph representation learning capabilities of Relational Graph Attention Network (RGAT) to extract latent behavioral features from the burst graph nodes and edge relationships. Experimental results show that TB-Graph outperforms various state-of-the-art methods in fine-grained encrypted malicious traffic classification tasks on two public datasets, indicating its enhanced capability for identifying encrypted malicious traffic.展开更多
Accurate and timely fault diagnosis is of great significance for the safe operation and power supply reliability of distribution systems.However,traditional intelligent methods limit the use of the physical structures...Accurate and timely fault diagnosis is of great significance for the safe operation and power supply reliability of distribution systems.However,traditional intelligent methods limit the use of the physical structures and data information of power networks.To this end,this study proposes a fault diagnostic model for distribution systems based on deep graph learning.This model considers the physical structure of the power network as a significant constraint during model training,which endows the model with stronger information perception to resist abnormal data input and unknown application conditions.In addition,a special spatiotemporal convolutional block is utilized to enhance the waveform feature extraction ability.This enables the proposed fault diagnostic model to be more effective in dealing with both fault waveform changes and the spatial effects of faults.In addition,a multi-task learning framework is constructed for fault location and fault type analysis,which improves the performance and generalization ability of the model.The IEEE 33-bus and IEEE 37-bus test systems are modeled to verify the effectiveness of the proposed fault diagnostic model.Finally,different fault conditions,topological changes,and interference factors are considered to evaluate the anti-interference and generalization performance of the proposed model.Experimental results demonstrate that the proposed model outperforms other state-of-the-art methods.展开更多
In this paper,we focus on inferring graph Laplacian matrix from the spatiotemporal signal which is defined as“time-vertex signal”.To realize this,we first represent the signals on a joint graph which is the Cartesia...In this paper,we focus on inferring graph Laplacian matrix from the spatiotemporal signal which is defined as“time-vertex signal”.To realize this,we first represent the signals on a joint graph which is the Cartesian product graph of the time-and vertex-graphs.By assuming the signals follow a Gaussian prior distribution on the joint graph,a meaningful representation that promotes the smoothness property of the joint graph signal is derived.Furthermore,by decoupling the joint graph,the graph learning framework is formulated as a joint optimization problem which includes signal denoising,timeand vertex-graphs learning together.Specifically,two algorithms are proposed to solve the optimization problem,where the discrete second-order difference operator with reversed sign(DSODO)in the time domain is used as the time-graph Laplacian operator to recover the signal and infer a vertex-graph in the first algorithm,and the time-graph,as well as the vertex-graph,is estimated by the other algorithm.Experiments on both synthetic and real-world datasets demonstrate that the proposed algorithms can effectively infer meaningful time-and vertex-graphs from noisy and incomplete data.展开更多
With the rapid development of the 5G communications,the edge intelligence enables Internet of Vehicles(IoV)to provide traffic forecasting to alleviate traffic congestion and improve quality of experience of users simu...With the rapid development of the 5G communications,the edge intelligence enables Internet of Vehicles(IoV)to provide traffic forecasting to alleviate traffic congestion and improve quality of experience of users simultaneously.To enhance the forecasting performance,a novel edge-enabled probabilistic graph structure learning model(PGSLM)is proposed,which learns the graph structure and parameters by the edge sensing information and discrete probability distribution on the edges of the traffic road network.To obtain the spatio-temporal dependencies of traffic data,the learned dynamic graphs are combined with a predefined static graph to generate the graph convolution part of the recurrent graph convolution module.During the training process,a new graph training loss is introduced,which is composed of the K nearest neighbor(KNN)graph constructed by the traffic feature tensors and the graph structure.Detailed experimental results show that,compared with existing models,the proposed PGSLM improves the traffic prediction performance in terms of average absolute error and root mean square error in IoV.展开更多
Contrastive self‐supervised representation learning on attributed graph networks with Graph Neural Networks has attracted considerable research interest recently.However,there are still two challenges.First,most of t...Contrastive self‐supervised representation learning on attributed graph networks with Graph Neural Networks has attracted considerable research interest recently.However,there are still two challenges.First,most of the real‐word system are multiple relations,where entities are linked by different types of relations,and each relation is a view of the graph network.Second,the rich multi‐scale information(structure‐level and feature‐level)of the graph network can be seen as self‐supervised signals,which are not fully exploited.A novel contrastive self‐supervised representation learning framework on attributed multiplex graph networks with multi‐scale(named CoLM^(2)S)information is presented in this study.It mainly contains two components:intra‐relation contrast learning and interrelation contrastive learning.Specifically,the contrastive self‐supervised representation learning framework on attributed single‐layer graph networks with multi‐scale information(CoLMS)framework with the graph convolutional network as encoder to capture the intra‐relation information with multi‐scale structure‐level and feature‐level selfsupervised signals is introduced first.The structure‐level information includes the edge structure and sub‐graph structure,and the feature‐level information represents the output of different graph convolutional layer.Second,according to the consensus assumption among inter‐relations,the CoLM^(2)S framework is proposed to jointly learn various graph relations in attributed multiplex graph network to achieve global consensus node embedding.The proposed method can fully distil the graph information.Extensive experiments on unsupervised node clustering and graph visualisation tasks demonstrate the effectiveness of our methods,and it outperforms existing competitive baselines.展开更多
The selection of chemical reactions is directly related to the quality of synthesis pathways,so a reasonable reaction evaluation metric plays a crucial role in the design and planning of synthesis pathways.Since react...The selection of chemical reactions is directly related to the quality of synthesis pathways,so a reasonable reaction evaluation metric plays a crucial role in the design and planning of synthesis pathways.Since reaction conditions also need to be considered in synthesis pathway design,a reaction metric that combines reaction time,temperature,and yield is required for chemical reactions of different reaction agents.In this study,a chemical reaction graph descriptor which includes the atom-atom mapping relationship is proposed to effectively describe reactions.Then,through pre-training using graph contrastive learning and fine-tuning through supervised learning,we establish a model for generating the probability of reaction superiority(RSscore).Finally,to validate the effectiveness of the current evaluation index,RSscore is applied in two applications,namely reaction evaluation and synthesis routes analysis,which proves that the RSscore provides an important agents-considered evaluation criterion for computer-aided synthesis planning(CASP).展开更多
基金supported by InnerMongolia Natural Science Foundation Project(2021LHMS06003)Inner Mongolia University Basic Research Business Fee Project(114).
文摘Federated Graph Learning (FGL) enables model training without requiring each client to share local graph data, effectively breaking data silos by aggregating the training parameters from each terminal while safeguarding data privacy. Traditional FGL relies on a centralized server for model aggregation;however, this central server presents challenges such as a single point of failure and high communication overhead. Additionally, efficiently training a robust personalized local model for each client remains a significant objective in federated graph learning. To address these issues, we propose a decentralized Federated Graph Learning framework with efficient communication, termed Decentralized Federated Graph Learning via Surrogate Model (SD_FGL). In SD_FGL, each client is required to maintain two models: a private model and a surrogate model. The surrogate model is publicly shared and can exchange and update information directly with any client, eliminating the need for a central server and reducing communication overhead. The private model is independently trained by each client, allowing it to calculate similarity with other clients based on local data as well as information shared through the surrogate model. This enables the private model to better adjust its training strategy and selectively update its parameters. Additionally, local differential privacy is incorporated into the surrogate model training process to enhance privacy protection. Testing on three real-world graph datasets demonstrates that the proposed framework improves accuracy while achieving decentralized Federated Graph Learning with lower communication overhead and stronger privacy safeguards.
文摘Federated learning is a classic of privacy-preserving learning, which enables collaborative learning without sharing data. Structured data has become the mainstream of current applications, where there is a correlation between samples in the same dataset, which can be represented by a graph. Federated graph learning (FGL) is the integration of structured data into federated learning, assuming that each user has structured graph representation data and uses graph learning models for training. This article proposes an FGL algorithm based on graph distance calculation, which determines the similarity of users in terms of graph distance, then clusters users, and aggregates local models of users in the same cluster. This algorithm can adjust the number of clusters by changing the threshold (the larger the threshold, the fewer clusters and the more users in each cluster, and vice versa), thereby controlling the scope of user collaboration.
基金This work is supported by the National Natural Science Foundation of China[grant number 61801336]the China Postdoctoral Science Foundation[grant number 2019M662717 and 2017M622521]the China Postdoctoral Program for Innovative Talent[grant number BX201700182].
文摘Graph learning is an effective manner to analyze the intrinsic properties of data.It has been widely used in the fields of dimensionality reduction and classification for data.In this paper,we focus on the graph learning-based dimensionality reduction for a hyperspectral image.Firstly,we review the development of graph learning and its application in a hyperspectral image.Then,we mainly discuss several representative graph methods including two manifold learning methods,two sparse graph learning methods,and two hypergraph learning methods.For manifold learning,we analyze neighborhood preserving embedding and locality preserving projections which are two classic manifold learning methods and can be transformed into the form of a graph.For sparse graph,we introduce sparsity preserving graph embedding and sparse graph-based discriminant analysis which can adaptively reveal data structure to construct a graph.For hypergraph learning,we review binary hypergraph and discriminant hyper-Laplacian projection which can represent the high-order relationship of data.
文摘Using resting-state functional magnetic resonance imaging (fMRI) technology to assist in identifying brain diseases has great potential. In the identification of brain diseases, graph-based models have been widely used, where graph represents the similarity between patients or brain regions of interest. In these models, constructing high-quality graphs is of paramount importance. Researchers have proposed various methods for constructing graphs from different perspectives, among which the simplest and most popular one is Pearson Correlation (PC). Although existing methods have achieved significant results, these graphs are usually fixed once they are constructed, and are generally operated separately from downstream task. Such a separation may result in neither the constructed graph nor the extracted features being ideal. To solve this problem, we use the graph-optimized locality preserving projection algorithm to extract features and the population graph simultaneously, aiming in higher identification accuracy through a task-dependent automatic optimization of the graph. At the same time, we incorporate supervised information to enable more flexible modelling. Specifically, the proposed method first uses PC to construct graph as the initial feature for each subject. Then, the projection matrix and graph are iteratively optimized through graph-optimization locality preserving projections based on semi-supervised learning, which fully employs the knowledge in various transformation spaces. Finally, the obtained projection matrix is applied to construct the subject-level graph and perform classification using support vector machines. To verify the effectiveness of the proposed method, we conduct experiments to identify subjects with mild cognitive impairment (MCI) and Autism spectrum disorder (ASD) from normal controls (NCs), and the results showed that the classification performance of our method is better than that of the baseline method.
基金sponsored by the National Key Research and Development Program of China(No.2023YFB4606200)Key Program of Science and Technology of Yunnan Province,China (No.202302AB080020)Key Project of Shanghai Zhangjiang National Independent hnovation Demonstration Zone,China(No.ZJ2021-2D-006).
文摘Accurately predicting the State of Health(SOH)of lithium-ion batteries is a critical challenge to ensure their reliability and safety in energy storage systems,such as electric vehicles and renewable energy grids.The intricate battery degradation process is influenced by evolving spatial and temporal interactions among health indicators.Existing methods often fail to capture the dynamic interactions between health indicators over time,resulting in limited predictive accuracy.To address these challenges,we propose a novel framework,Dynamic Graph Learning with Spatial-Temporal Fusion Attention(DGL-STFA),which transforms health indicator series time-data into time-evolving graph representations.The framework employs multi-scale convolutional neural networks to capture diverse temporal patterns,a self-attention mechanism to construct dynamic adjacency matrices that adapt over time,and a temporal attention mechanism to identify and prioritize key moments that influence battery degradation.This combination enables DGL-STFA to effectively model both dynamic spatial relationships and long-term temporal dependencies,enhancing SOH prediction accuracy.Extensive experiments were conducted on the NASA and CALCE battery datasets,comparing this framework with traditional time-series prediction methods and other graph-based prediction methods.The results demonstrate that our framework significantly improves prediction accuracy,with a mean absolute error more than 30%lower than other methods.Further analysis demonstrated the robustness of DGL-STFA across various battery life stages,including early,mid,and end-of-life phases.These results highlight the capability of DGL-STFA to accurately predict SOH,addressing critical challenges in advancing battery health monitoring for energy storage applications.
文摘Graph similarity learning aims to calculate the similarity between pairs of graphs.Existing unsupervised graph similarity learning methods based on contrastive learning encounter challenges related to random graph augmentation strategies,which can harm the semantic and structural information of graphs and overlook the rich structural information present in subgraphs.To address these issues,we propose a graph similarity learning model based on learnable augmentation and multi-level contrastive learning.First,to tackle the problem of random augmentation disrupting the semantics and structure of the graph,we design a learnable augmentation method to selectively choose nodes and edges within the graph.To enhance contrastive levels,we employ a biased random walk method to generate corresponding subgraphs,enriching the contrastive hierarchy.Second,to solve the issue of previous work not considering multi-level contrastive learning,we utilize graph convolutional networks to learn node representations of augmented views and the original graph and calculate the interaction information between the attribute-augmented and structure-augmented views and the original graph.The goal is to maximize node consistency between different views and learn node matching between different graphs,resulting in node-level representations for each graph.Subgraph representations are then obtained through pooling operations,and we conduct contrastive learning utilizing both node and subgraph representations.Finally,the graph similarity score is computed according to different downstream tasks.We conducted three sets of experiments across eight datasets,and the results demonstrate that the proposed model effectively mitigates the issues of random augmentation damaging the original graph’s semantics and structure,as well as the insufficiency of contrastive levels.Additionally,the model achieves the best overall performance.
基金supported by the National Key R&D Program of China(Grant No.2022YFB3104601)the Big Data Computing Center of Southeast University.
文摘Social media has significantly accelerated the rapid dissemination of information,but it also boosts propagation of fake news,posing serious challenges to public awareness and social stability.In real-world contexts,the volume of trustable information far exceeds that of rumors,resulting in a class imbalance that leads models to prioritize the majority class during training.This focus diminishes the model’s ability to recognize minority class samples.Furthermore,models may experience overfitting when encountering these minority samples,further compromising their generalization capabilities.Unlike node-level classification tasks,fake news detection in social networks operates on graph-level samples,where traditional interpolation and oversampling methods struggle to effectively generate high-quality graph-level samples.This challenge complicates the identification of new instances of false information.To address this issue,this paper introduces the FHGraph(Fake News Hunting Graph)framework,which employs a generative data augmentation approach and a latent diffusion model to create graph structures that align with news communication patterns.Using the few-sample learning capabilities of large language models(LLMs),the framework generates diverse texts for minority class nodes.FHGraph comprises a hierarchical multiview graph contrastive learning module,in which two horizontal views and three vertical levels are utilized for self-supervised learning,resulting in more optimized representations.Experimental results show that FHGraph significantly outperforms state-of-the-art(SOTA)graph-level class imbalance methods and SOTA graph-level contrastive learning methods.Specifically,FHGraph has achieved a 2%increase in F1 Micro and a 2.5%increase in F1 Macro in the PHEME dataset,as well as a 3.5%improvement in F1 Micro and a 4.3%improvement in F1 Macro on RumorEval dataset.
基金supported by the National Natural Science Foundation of China(U23A20272,U22A2069,62272146)Natural Science Foundation of Henan(252300421237).
文摘The increase in population and vehicles exacerbates traffic congestion and management difficulties.Therefore,achieving accurate and efficient traffic flow prediction is crucial for urban transportation.For that reason,we propose a graph federated learning-based digital twin traffic flow prediction method(GFLDT)by integrating the benefits of collaborative intelligence and computation of intelligent IoT.Specifically,we construct a digital twin network for predicting traffic flow,which is divided into client twin and global twin.Based on this,we adopt the concept of graph federated learning to learn the temporal dependence of traffic flow using local data from client twins,and the spatial dependence of traffic flow using global information from global twins.In addition,we validate on a real traffic dataset,and the results show that through collaborative training of the client twins and the global twins,GFLDT achieves accurate traffic flow prediction while protecting data security.
基金supported by grants from the Joint Research Project of the Science and Technology Innovation Community in Yangtze River Delta(No.2023CSJZN0200)the National Natural Science Foundation of China(Grant No.62337001)and the Fundamental Research Funds for the Central Universities.
文摘The remarkable success in graph neural networks(GNNs)promotes the explainable graph learning methods.Among them,the graph rationalization methods draw significant attentions,which aim to provide explanations to support the prediction results by identifying a small subset of the original graph(i.e.,rationale).Although existing methods have achieved promising results,recent studies have proved that these methods still suffer from exploiting shortcuts in the data to yield task results and compose rationales.Different from previous methods plagued by shortcuts,in this paper,we propose a Shortcut-guided Graph Rationalization(SGR)method,which identifies rationales by learning from shortcuts.Specifically,SGR consists of two training stages.In the first stage,we train a shortcut guider with an early stop strategy to obtain shortcut information.During the second stage,SGR separates the graph into the rationale and non-rationale subgraphs.Then SGR lets them learn from the shortcut information generated by the frozen shortcut guider to identify which information belongs to shortcuts and which does not.Finally,we employ the non-rationale subgraphs as environments and identify the invariant rationales which filter out the shortcuts under environment shifts.Extensive experiments conducted on synthetic and real-world datasets provide clear validation of the effectiveness of the proposed SGR method,underscoring its ability to provide faithful explanations.
基金This research is partially supported by the National Natural Science Foundation of China under Grant No.62376043Science and Technology Program of Sichuan Province under Grant Nos.2020JDRC0067,2023JDRC0087,and 24NSFTD0025.
文摘With the rapid development of Internet of Things(IoT)technology,IoT systems have been widely applied in health-care,transportation,home,and other fields.However,with the continuous expansion of the scale and increasing complexity of IoT systems,the stability and security issues of IoT systems have become increasingly prominent.Thus,it is crucial to detect anomalies in the collected IoT time series from various sensors.Recently,deep learning models have been leveraged for IoT anomaly detection.However,owing to the challenges associated with data labeling,most IoT anomaly detection methods resort to unsupervised learning techniques.Nevertheless,the absence of accurate abnormal information in unsupervised learning methods limits their performance.To address these problems,we propose AS-GCN-MTM,an adaptive structural Graph Convolutional Networks(GCN)-based framework using a mean-teacher mechanism(AS-GCN-MTM)for anomaly identification.It performs better than unsupervised methods using only a small amount of labeled data.Mean Teachers is an effective semi-supervised learning method that utilizes unlabeled data for training to improve the generalization ability and performance of the model.However,the dependencies between data are often unknown in time series data.To solve this problem,we designed a graph structure adaptive learning layer based on neural networks,which can automatically learn the graph structure from time series data.It not only better captures the relationships between nodes but also enhances the model’s performance by augmenting key data.Experiments have demonstrated that our method improves the baseline model with the highest F1 value by 10.4%,36.1%,and 5.6%,respectively,on three real datasets with a 10%data labeling rate.
基金supported by the UC-National Lab In-Residence Graduate Fellowship Grant L21GF3606supported by a DOD National Defense Science and Engineering Graduate(NDSEG)Research Fellowship+1 种基金supported by the Laboratory Directed Research and Development program of Los Alamos National Laboratory under project numbers 20170668PRD1 and 20210213ERsupported by the NGA under Contract No.HM04762110003.
文摘Graph learning,when used as a semi-supervised learning(SSL)method,performs well for classification tasks with a low label rate.We provide a graph-based batch active learning pipeline for pixel/patch neighborhood multi-or hyperspectral image segmentation.Our batch active learning approach selects a collection of unlabeled pixels that satisfy a graph local maximum constraint for the active learning acquisition function that determines the relative importance of each pixel to the classification.This work builds on recent advances in the design of novel active learning acquisition functions(e.g.,the Model Change approach in arXiv:2110.07739)while adding important further developments including patch-neighborhood image analysis and batch active learning methods to further increase the accuracy and greatly increase the computational efficiency of these methods.In addition to improvements in the accuracy,our approach can greatly reduce the number of labeled pixels needed to achieve the same level of the accuracy based on randomly selected labeled pixels.
基金supported in part by the National Natural Science Foundation of China under grants 62276169,62071310,and 82272114in part by the Medical-Engineering Interdisciplinary Research Foundation of Shenzhen University+2 种基金in part by the Shenzhen University-Lingnan University Joint Research Programmein part by the Shenzhen-Hong Kong Institute of Brain Science-Shenzhen Fundamental Research Institutions under grant 2022SHIBS0003in part by Shenzhen Science and Technology Research and Development Fund for Sustainable Development Project under grant KCXFZ202012211736130.
文摘An intelligent emotion recognition system based on electroencephalography(EEG)signals shows considerable potential in various domains such as healthcare,entertainment,and education,thanks to its portability,high temporal resolution,and real-time capabilities.However,the existing research in this field faces limitations stemming from the nonstationary nature and individual variability of EEG signals.In this study,we present a novel EEG emotion recognition model,named GraphEmotionNet,designed to enhance the accuracy of EEG-based emotion recognition through the incorporation of a spatiotemporal attention mechanism and transfer learning.The proposed GraphEmotionNet model can effectively learn the intrinsic connections between EEG channels and construct an adaptive graph.This graph’s adaptive nature is crucial in optimizing spatial-temporal graph convolutions,which in turn enhances spatial-temporal feature characterization and contributes to the process of emotion classification.Moreover,an integration of domain adaptation aligns the extracted features across different domains,further alleviating the impact of individual EEG variability.We evaluate the model performance on two benchmark databases,employing two types of cross-validation protocols:within-subject cross-validation and cross-subject cross-validation.The experimental results affirm the model’s efficacy in extracting EEG features linked to emotional semantics and demonstrate its promising performance in emotion recognition.
基金funded by the National Natural Science Foundation of China (Grant No.41902240).
文摘The accurate prediction of displacement is crucial for landslide deformation monitoring and early warning.This study focuses on a landslide in Wenzhou Belt Highway and proposes a novel multivariate landslide displacement prediction method that relies on graph deep learning and Global Navigation Satellite System(GNSS)positioning.First model the graph structure of the monitoring system based on the engineering positions of the GNSS monitoring points and build the adjacent matrix of graph nodes.Then construct the historical and predicted time series feature matrixes using the processed temporal data including GNSS displacement,rainfall,groundwater table and soil moisture content and the graph structure.Last introduce the state-of-the-art graph deep learning GTS(Graph for Time Series)model to improve the accuracy and reliability of landslide displacement prediction which utilizes the temporal-spatial dependency of the monitoring system.This approach outperforms previous studies that only learned temporal features from a single monitoring point and maximally weighs the prediction performance and the priori graph of the monitoring system.The proposed method performs better than SVM,XGBoost,LSTM and DCRNN models in terms of RMSE(1.35 mm),MAE(1.14 mm)and MAPE(0.25)evaluation metrics,which is provided to be effective in future landslide failure early warning.
文摘Unsupervised learning methods such as graph contrastive learning have been used for dynamic graph represen-tation learning to eliminate the dependence of labels.However,existing studies neglect positional information when learning discrete snapshots,resulting in insufficient network topology learning.At the same time,due to the lack of appropriate data augmentation methods,it is difficult to capture the evolving patterns of the network effectively.To address the above problems,a position-aware and subgraph enhanced dynamic graph contrastive learning method is proposed for discrete-time dynamic graphs.Firstly,the global snapshot is built based on the historical snapshots to express the stable pattern of the dynamic graph,and the random walk is used to obtain the position representation by learning the positional information of the nodes.Secondly,a new data augmentation method is carried out from the perspectives of short-term changes and long-term stable structures of dynamic graphs.Specifically,subgraph sampling based on snapshots and global snapshots is used to obtain two structural augmentation views,and node structures and evolving patterns are learned by combining graph neural network,gated recurrent unit,and attention mechanism.Finally,the quality of node representation is improved by combining the contrastive learning between different structural augmentation views and between the two representations of structure and position.Experimental results on four real datasets show that the performance of the proposed method is better than the existing unsupervised methods,and it is more competitive than the supervised learning method under a semi-supervised setting.
文摘The proliferation of internet traffic encryption has become a double-edged sword. While it significantly enhances user privacy, it also inadvertently shields cyber-attacks from detection, presenting a formidable challenge to cybersecurity. Traditional machine learning and deep learning techniques often fall short in identifying encrypted malicious traffic due to their inability to fully extract and utilize the implicit relational and positional information embedded within data packets. This limitation has led to an unresolved challenge in the cybersecurity community: how to effectively extract valuable insights from the complex patterns of traffic packet transmission. Consequently, this paper introduces the TB-Graph model, an encrypted malicious traffic classification model based on a relational graph attention network. The model is a heterogeneous traffic burst graph that embeds side-channel features, which are unaffected by encryption, into the graph nodes and connects them with three different types of burst edges. Subsequently, we design a relational positional coding that prevents the loss of temporal relationships between the original traffic flows during graph transformation. Ultimately, TB-Graph leverages the powerful graph representation learning capabilities of Relational Graph Attention Network (RGAT) to extract latent behavioral features from the burst graph nodes and edge relationships. Experimental results show that TB-Graph outperforms various state-of-the-art methods in fine-grained encrypted malicious traffic classification tasks on two public datasets, indicating its enhanced capability for identifying encrypted malicious traffic.
基金supported by National Natural Science Foundation of China(No.52277083)。
文摘Accurate and timely fault diagnosis is of great significance for the safe operation and power supply reliability of distribution systems.However,traditional intelligent methods limit the use of the physical structures and data information of power networks.To this end,this study proposes a fault diagnostic model for distribution systems based on deep graph learning.This model considers the physical structure of the power network as a significant constraint during model training,which endows the model with stronger information perception to resist abnormal data input and unknown application conditions.In addition,a special spatiotemporal convolutional block is utilized to enhance the waveform feature extraction ability.This enables the proposed fault diagnostic model to be more effective in dealing with both fault waveform changes and the spatial effects of faults.In addition,a multi-task learning framework is constructed for fault location and fault type analysis,which improves the performance and generalization ability of the model.The IEEE 33-bus and IEEE 37-bus test systems are modeled to verify the effectiveness of the proposed fault diagnostic model.Finally,different fault conditions,topological changes,and interference factors are considered to evaluate the anti-interference and generalization performance of the proposed model.Experimental results demonstrate that the proposed model outperforms other state-of-the-art methods.
基金supported by the National Natural Science Foundation of China(Grant No.61966007)Key Laboratory of Cognitive Radio and Information Processing,Ministry of Education(No.CRKL180106,No.CRKL180201)+1 种基金Guangxi Key Laboratory of Wireless Wideband Communication and Signal Processing,Guilin University of Electronic Technology(No.GXKL06180107,No.GXKL06190117)Guangxi Colleges and Universities Key Laboratory of Satellite Navigation and Position Sensing.
文摘In this paper,we focus on inferring graph Laplacian matrix from the spatiotemporal signal which is defined as“time-vertex signal”.To realize this,we first represent the signals on a joint graph which is the Cartesian product graph of the time-and vertex-graphs.By assuming the signals follow a Gaussian prior distribution on the joint graph,a meaningful representation that promotes the smoothness property of the joint graph signal is derived.Furthermore,by decoupling the joint graph,the graph learning framework is formulated as a joint optimization problem which includes signal denoising,timeand vertex-graphs learning together.Specifically,two algorithms are proposed to solve the optimization problem,where the discrete second-order difference operator with reversed sign(DSODO)in the time domain is used as the time-graph Laplacian operator to recover the signal and infer a vertex-graph in the first algorithm,and the time-graph,as well as the vertex-graph,is estimated by the other algorithm.Experiments on both synthetic and real-world datasets demonstrate that the proposed algorithms can effectively infer meaningful time-and vertex-graphs from noisy and incomplete data.
基金supported by the project of the National Natural Science Foundation of China(No.61772562)the Knowledge Innovation Program of Wuhan-Basic Research(No.2022010801010225)the Fundamental Research Funds for the Central Universities(No.2662022YJ012)。
文摘With the rapid development of the 5G communications,the edge intelligence enables Internet of Vehicles(IoV)to provide traffic forecasting to alleviate traffic congestion and improve quality of experience of users simultaneously.To enhance the forecasting performance,a novel edge-enabled probabilistic graph structure learning model(PGSLM)is proposed,which learns the graph structure and parameters by the edge sensing information and discrete probability distribution on the edges of the traffic road network.To obtain the spatio-temporal dependencies of traffic data,the learned dynamic graphs are combined with a predefined static graph to generate the graph convolution part of the recurrent graph convolution module.During the training process,a new graph training loss is introduced,which is composed of the K nearest neighbor(KNN)graph constructed by the traffic feature tensors and the graph structure.Detailed experimental results show that,compared with existing models,the proposed PGSLM improves the traffic prediction performance in terms of average absolute error and root mean square error in IoV.
基金support by the National Natural Science Foundation of China(NSFC)under grant number 61873274.
文摘Contrastive self‐supervised representation learning on attributed graph networks with Graph Neural Networks has attracted considerable research interest recently.However,there are still two challenges.First,most of the real‐word system are multiple relations,where entities are linked by different types of relations,and each relation is a view of the graph network.Second,the rich multi‐scale information(structure‐level and feature‐level)of the graph network can be seen as self‐supervised signals,which are not fully exploited.A novel contrastive self‐supervised representation learning framework on attributed multiplex graph networks with multi‐scale(named CoLM^(2)S)information is presented in this study.It mainly contains two components:intra‐relation contrast learning and interrelation contrastive learning.Specifically,the contrastive self‐supervised representation learning framework on attributed single‐layer graph networks with multi‐scale information(CoLMS)framework with the graph convolutional network as encoder to capture the intra‐relation information with multi‐scale structure‐level and feature‐level selfsupervised signals is introduced first.The structure‐level information includes the edge structure and sub‐graph structure,and the feature‐level information represents the output of different graph convolutional layer.Second,according to the consensus assumption among inter‐relations,the CoLM^(2)S framework is proposed to jointly learn various graph relations in attributed multiplex graph network to achieve global consensus node embedding.The proposed method can fully distil the graph information.Extensive experiments on unsupervised node clustering and graph visualisation tasks demonstrate the effectiveness of our methods,and it outperforms existing competitive baselines.
基金the financial support of the National Natural Science Foundation of China(22078041,22278053)Dalian High-level Talents Innovation Support Program(2021RQ105)the Fundamental Research Funds for China Central Universities(DUT22QN209,DUT22LAB608).
文摘The selection of chemical reactions is directly related to the quality of synthesis pathways,so a reasonable reaction evaluation metric plays a crucial role in the design and planning of synthesis pathways.Since reaction conditions also need to be considered in synthesis pathway design,a reaction metric that combines reaction time,temperature,and yield is required for chemical reactions of different reaction agents.In this study,a chemical reaction graph descriptor which includes the atom-atom mapping relationship is proposed to effectively describe reactions.Then,through pre-training using graph contrastive learning and fine-tuning through supervised learning,we establish a model for generating the probability of reaction superiority(RSscore).Finally,to validate the effectiveness of the current evaluation index,RSscore is applied in two applications,namely reaction evaluation and synthesis routes analysis,which proves that the RSscore provides an important agents-considered evaluation criterion for computer-aided synthesis planning(CASP).
