Features Of Nodes Research Articles

Generalized load modeling approach considering multiple distributed generation integration

To solve the problem of node characteristic uncertainty caused by the connection of multiple distributed generations to the original load node, a new method for modeling the steady-state characteristics of generalized load nodes based on scene clustering was proposed. Scenario clustering takes into account three factors: wind farm output fluctuation, photovoltaic output fluctuation, and demand-side power load fluctuation, and extracts typical scenarios of generalized load data. According to the uncertainty change of node characteristics in different scenarios, the clustering data is segmented and refined, and its probability distribution is counted. Clustering information, probability information, and maximum value are used as three types of features of generalized load and are custom encoded as 12-dimensional feature vectors as neural network inputs. To improve the identification performance of generalized load features, the back propagation (BP) dichotomy neural network is used to build a unified model of node features. The simulation results show that the proposed method can not only model accurately but also introduce probability information through statistical data samples, which can provide an auxiliary reference for the prediction and regulation of generalized loads.

MSH-DTI: multi-graph convolution with self-supervised embedding and heterogeneous aggregation for drug-target interaction prediction

Background:The rise of network pharmacology has led to the widespread use of network-based computational methods in predicting drug target interaction (DTI). However, existing DTI prediction models typically rely on a limited amount of data to extract drug and target features, potentially affecting the comprehensiveness and robustness of features. In addition, although multiple networks are used for DTI prediction, the integration of heterogeneous information often involves simplistic aggregation and attention mechanisms, which may impose certain limitations.Results:MSH-DTI, a deep learning model for predicting drug-target interactions, is proposed in this paper. The model uses self-supervised learning methods to obtain drug and target structure features. A Heterogeneous Interaction-enhanced Feature Fusion Module is designed for multi-graph construction, and the graph convolutional networks are used to extract node features. With the help of an attention mechanism, the model focuses on the important parts of different features for prediction. Experimental results show that the AUROC and AUPR of MSH-DTI are 0.9620 and 0.9605 respectively, outperforming other models on the DTINet dataset.Conclusion:The proposed MSH-DTI is a helpful tool to discover drug-target interactions, which is also validated through case studies in predicting new DTIs.

Hybrid Quantum or Purely Classical? Assessing the Utility of Quantum Feature Embeddings

Background As graph datasets—including social networks, supply chains, and bioinformatics data—grow in size and complexity, researchers are driven to search for solutions enhancing model efficiency and speed. One avenue that may provide a solution is Quantum Graph Learning (QGL), a subfield of Quantum Machine Learning (QML) that applies machine learning inspired or powered by quantum computing to graph learning tasks. Methods We reevaluate Quantum Feature Embeddings (QFE), a QGL methodology published by Xu et al. earlier this year. QFE uses Variational Quantum Circuits to preprocess node features and then sends them to a classical Graph Neural Network (GNN), with the goal of increasing performance and/or decreasing total model size. Xu et al. evaluated this methodology by comparing its performance with the performance of variously-sized classical models on the benchmark datasets PROTEINS and ENZYMES, and they report success. Our core methodology and learning task remain unchanged. However, we have made several changes to the experimental design that enhance the rigor of the study: 1) we include the testing of models with no embedder; 2) we conduct a thorough hyperparameter search using a state-of-the-art optimization algorithm; and 3) we conduct stratified five-fold cross-validation, which mitigates the bias produced by our small datasets and provides multiple test statistics from which we can calculate a confidence interval. Results We produce classical models that perform comparably to QFE and significantly outperform the small classical models used in Xu et al.’s comparison. Notably, many of our classical models achieve this using fewer parameters than the QFE models we trained. Xu et al. do not report their total model sizes. Conclusion Our study sheds doubt on the efficacy of QFE by demonstrating that small, well-tuned classical models can perform just as well as QFE, highlighting the importance of hyperparameter tuning and rigorous experimental design.

Medium–Long-Term PV Output Forecasting Based on the Graph Attention Network with Amplitude-Aware Permutation Entropy

Medium–long-term photovoltaic (PV) output forecasting is of great significance to power grid planning, power market transactions, power dispatching operations, equipment maintenance and overhaul. However, PV output fluctuates greatly due to weather changes. Furthermore, it is frequently challenging to ensure the accuracy of forecasts for medium–long-term forecasting involving a long time span. In response to the above problems, this paper proposes a medium–long-term forecasting method for PV output based on amplitude-aware permutation entropy component reconstruction and the graph attention network. Firstly, the PV output sequence data are decomposed by ensemble empirical mode decomposition (EEMD), and the decomposed intrinsic mode function (IMF) subsequences are combined and reconstructed according to the amplitude-aware permutation entropy. Secondly, the graph node feature sequence is constructed from the reconstructed subsequences, and the mutual information of the node feature sequence is calculated to obtain the graph node adjacency matrix which is applied to generate a graph sequence. Thirdly, the graph attention network is utilized to forecast the graph sequence and separate the PV output forecasting results. Finally, an actual measurement system is used to experimentally verify the proposed method, and the outcomes indicate that the proposed method, which has certain promotion value, can improve the accuracy of medium–long-term forecasting of PV output.

Inter-object discriminative graph modeling for indoor scene recognition

Variable scene layouts and coexisting objects across scenes make indoor scene recognition still a challenging task. Leveraging object information within scenes to enhance the distinguishability of feature representations has emerged as a key approach in this domain. Currently, most object-assisted methods use a separate branch to process object information, combining object and scene features heuristically. However, few of them pay attention to interpretably handling the hidden discriminative knowledge within object information. In this paper, we propose to leverage discriminative object knowledge to enhance scene feature representations. Initially, we capture the object-scene discriminative relationships from a probabilistic perspective, which are transformed into an Inter-Object Discriminative Prototype (IODP). Given the abundant prior knowledge from IODP, we subsequently construct a Discriminative Graph Network (DGN), in which pixel-level scene features are defined as nodes and the discriminative relationships between node features are encoded as edges. DGN aims to incorporate inter-object discriminative knowledge into the image representation through graph convolution and mapping operations (GCN). With the proposed IODP and DGN, we obtain state-of-the-art results on several widely used scene datasets, demonstrating the effectiveness of the proposed approach.

Identification of microbe–disease signed associations via multi-scale variational graph autoencoder based on signed message propagation

BackgroundPlenty of clinical and biomedical research has unequivocally highlighted the tremendous significance of the human microbiome in relation to human health. Identifying microbes associated with diseases is crucial for early disease diagnosis and advancing precision medicine.ResultsConsidering that the information about changes in microbial quantities under fine-grained disease states helps to enhance a comprehensive understanding of the overall data distribution, this study introduces MSignVGAE, a framework for predicting microbe-disease sign associations using signed message propagation. MSignVGAE employs a graph variational autoencoder to model noisy signed association data and extends the multi-scale concept to enhance representation capabilities. A novel strategy for propagating signed message in signed networks addresses heterogeneity and consistency among nodes connected by signed edges. Additionally, we utilize the idea of denoising autoencoder to handle the noise in similarity feature information, which helps overcome biases in the fused similarity data. MSignVGAE represents microbe-disease associations as a heterogeneous graph using similarity information as node features. The multi-class classifier XGBoost is utilized to predict sign associations between diseases and microbes.ConclusionsMSignVGAE achieves AUROC and AUPR values of 0.9742 and 0.9601, respectively. Case studies on three diseases demonstrate that MSignVGAE can effectively capture a comprehensive distribution of associations by leveraging signed information.

Subject-independent auditory spatial attention detection based on brain topology modeling and feature distribution alignment

Auditory spatial attention detection (ASAD) seeks to determine which speaker in a surround sound field a listener is focusing on based on the one’s brain biosignals. Although existing studies have achieved ASAD from a single-trial electroencephalogram (EEG), the huge inter-subject variability makes them generally perform poorly in cross-subject scenarios. Besides, most ASAD methods do not take full advantage of topological relationships between EEG channels, which are crucial for high-quality ASAD. Recently, some advanced studies have introduced graph-based brain topology modeling into ASAD, but how to calculate edge weights in a graph to better capture actual brain connectivity is worthy of further investigation. To address these issues, we propose a new ASAD method in this paper. First, we model a multi-channel EEG segment as a graph, where differential entropy serves as the node feature, and a static adjacency matrix is generated based on inter-channel mutual information to quantify brain functional connectivity. Then, different subjects’ EEG graphs are encoded into a shared embedding space through a total variation graph neural network. Meanwhile, feature distribution alignment based on multi-kernel maximum mean discrepancy is adopted to learn subject-invariant patterns. Note that we align EEG embeddings of different subjects to reference distributions rather than align them to each other for the purpose of privacy preservation. A series of experiments on open datasets demonstrate that the proposed model outperforms state-of-the-art ASAD models in cross-subject scenarios with relatively low computational complexity, and feature distribution alignment improves the generalizability of the proposed model to a new subject.

ST-TDCN: A two-channel tree-structure spatial–temporal convolutional network model for traffic velocity prediction

In the development of intelligent transport systems which aims to provide safe, convenient, and comfortable transport and effectively addresses issues with traffic congestion and pollution, accurate collection of spatial–temporal data is of great significance. Based on the study of the topology and spatial characteristics of the transportation network, data with spatial–temporal attributed can be predicted by relevant models. Thus, the purpose of providing additional information for decision making and labor cost saving is achieved. This study proposed a more accurate traffic velocity prediction model, named Spatial-Temporal Tree-structure Dual-channel Convolution Network. The model designs a spatial tree convolution module for capturing the spatial features of nodes in the traffic network represented by the tree structure and applies a dual-channel temporal convolutional network module to capture the temporal information of velocity data more accurately. Comparative tests have demonstrated that the model proposed in this study has the advantages of higher accuracy, better convergence and more flexibility in responding to dynamic changes of traffic velocity.

Subgraph autoencoder with bridge nodes

Subgraph representation learning is a burgeoning field within graph representation learning. However, current methods in this field face several issues, including the inability to facilitate information interaction between subgraphs, the destruction of original node feature information, and the detrimental effect of the structural information of the entire graph on the extracted subgraph structural information. To address these issues, this paper proposes a method named the subgraph autoencoder with bridge nodes (SAWBN). Specifically, first, SAWBN enhances the data interaction capability by adding a bridge node and connecting it to all nodes within a subgraph. The addition of the bridge node creates indirect connections between subgraphs, enabling them to interact and exchange information during the message-passing phase. To the best of our knowledge, this is the first paper to propose the concept of bridge nodes and to introduce bridge nodes into subgraph representation learning. Second, SAWBN utilizes a new message-passing paradigm called graph convolution with different weights (GDW). During the convolution process, GDW can assign different weights to nodes inside and outside a subgraph, effectively distinguishing the importance of nodes without compromising the original node feature information. Third, SAWBN uses an autoencoder to reconstruct subgraph node features. This reconstruction can eliminate the interference of the structural information of the entire graph and regenerate subgraph node features that are rich in subgraph structural information. Finally, these subgraph node features are aggregated to achieve a good representation of the subgraph structural information. Extensive results on four real-world subgraph datasets demonstrate that SAWBN outperforms state-of-the-art baselines. The source code of SAWBN is publicly available at https://github.com/denggaoqin/SAWBN.

GKE-TUNet: Geometry-Knowledge Embedded TransUNet Model for Retinal Vessel Segmentation Considering Anatomical Topology.

Automated retinal vessel segmentation is crucial for computer-aided clinical diagnosis and retinopathy screening. However, deep learning faces challenges in extracting complex intertwined structures and subtle small vessels from densely vascularized regions. To address these issues, we propose a novel segmentation model, called Geometry-Knowledge Embedded TransUNet (GKE-TUNet), which incorporates explicit embedding of topological features of retinal vessel anatomy. In the proposed GKE-TUNet model, a skeleton extraction network is pre-trained to extract the anatomical topology of retinal vessels from refined segmentation labels. During vessel segmentation, the dense skeleton graph is sampled as a graph of key-points and connections and is incorporated into the skip connection layer of TransUNet. The graph vertices are used as node features and correspond to positions in the low-level feature maps. The graph attention network (GAT) is used as the graph convolution backbone network to capture the shape semantics of vessels and the interaction of key locations along the topological direction. Finally, the node features obtained by graph convolution are read out as a sparse feature map based on their corresponding spatial coordinates. To address the problem of sparse feature maps, we employ convolution operators to fuse sparse feature maps with low-level dense feature maps. This fusion is weighted and connected to deep feature maps. Experimental results on the DRIVE, CHASE-DB1, and STARE datasets demonstrate the competitiveness of our proposed method compared to existing ones.

Drug repositioning based on residual attention network and free multiscale adversarial training

BackgroundConducting traditional wet experiments to guide drug development is an expensive, time-consuming and risky process. Analyzing drug function and repositioning plays a key role in identifying new therapeutic potential of approved drugs and discovering therapeutic approaches for untreated diseases. Exploring drug-disease associations has far-reaching implications for identifying disease pathogenesis and treatment. However, reliable detection of drug-disease relationships via traditional methods is costly and slow. Therefore, investigations into computational methods for predicting drug-disease associations are currently needed.ResultsThis paper presents a novel drug-disease association prediction method, RAFGAE. First, RAFGAE integrates known associations between diseases and drugs into a bipartite network. Second, RAFGAE designs the Re_GAT framework, which includes multilayer graph attention networks (GATs) and two residual networks. The multilayer GATs are utilized for learning the node embeddings, which is achieved by aggregating information from multihop neighbors. The two residual networks are used to alleviate the deep network oversmoothing problem, and an attention mechanism is introduced to combine the node embeddings from different attention layers. Third, two graph autoencoders (GAEs) with collaborative training are constructed to simulate label propagation to predict potential associations. On this basis, free multiscale adversarial training (FMAT) is introduced. FMAT enhances node feature quality through small gradient adversarial perturbation iterations, improving the prediction performance. Finally, tenfold cross-validations on two benchmark datasets show that RAFGAE outperforms current methods. In addition, case studies have confirmed that RAFGAE can detect novel drug-disease associations.ConclusionsThe comprehensive experimental results validate the utility and accuracy of RAFGAE. We believe that this method may serve as an excellent predictor for identifying unobserved disease-drug associations.

Predicting Disease-Metabolite Associations Based on the Metapath Aggregation of Tripartite Heterogeneous Networks.

The exploration of the interactions between diseases and metabolites holds significant implications for the diagnosis and treatment of diseases. However, traditional experimental methods are time-consuming and costly, and current computational methods often overlook the influence of other biological entities on both. In light of these limitations, we proposed a novel deep learning model based on metapath aggregation of tripartite heterogeneous networks (MAHN) to explore disease-related metabolites. Specifically, we introduced microbes to construct a tripartite heterogeneous network and employed graph convolutional network and enhanced GraphSAGE to learn node features with metapath length 3. Additionally, we utilized node-level and semantic-level attention mechanisms, a more granular approach, to aggregate node features with metapath length 2. Finally, the reconstructed association probability is obtained by fusing features from different metapaths into the bilinear decoder. The experiments demonstrate that the proposed MAHN model achieved superior performance in five-fold cross-validation with Acc (91.85%), Pre (90.48%), Recall (93.53%), F1 (91.94%), AUC (97.39%), and AUPR (97.47%), outperforming four state-of-the-art algorithms. Case studies on two complex diseases, irritable bowel syndrome and obesity, further validate the predictive results, and the MAHN model is a trustworthy prediction tool for discovering potential metabolites. Moreover, deep learning models integrating multi-omics data represent the future mainstream direction for predicting disease-related biological entities.

A Systematic Review of Occult Contralateral Neck Metastasis in Tonsillar Squamous Cell Carcinoma.

To determine the prevalence of occult contralateral nodal metastasis in tonsillar squamous cell carcinoma (TSCC) in patients who have undergone bilateral neck dissection. A systematic review of English articles identified from PubMed, Embase, and Web of Science databases. Search terms included "oropharynx," "carcinoma," "lymph node," and "neck dissection." Two reviewers independently screened abstracts, reviewed full texts, and extracted data from all studies that presented the prevalence of contralateral occult nodal metastasis in TSCC. The overall prevalence of occult contralateral nodal metastasis was 10%. The prevalence was 8% for cT1/T2 tumors, 19% for cT3/T4, 1% for N0 in the ipsilateral neck, and 12% for N+. Occult contralateral lymph nodes were most frequently found in neck level II (81%) and level III (19%). No metastatic nodes were found in level I. Elective neck dissection of the contralateral neck in TSCC is controversial due the historic morbidity caused by the surgery. A widely accepted recommendation suggests performing an elective neck dissection when the prevalence of occult metastasis is between 15% and 20%. The results of this study suggest that elective contralateral neck dissection will identify occult positivity in 19% of patients with T3/T4 tonsil cancer. In T1/T2 or N0 tumors, the diagnostic yield would be considerably lower at 8% and 1%, respectively. Contralateral nodal sampling could be considered based on patient preference after adequate counseling on the risks/benefits of occult nodal detection. More research is needed on other nodal features to formulate treatment guidelines. Laryngoscope, 2024.

HTFSMMA: Higher-Order Topological Guided Small Molecule-MicroRNA Associations Prediction.

Small molecules (SMs) play a pivotal role in regulating microRNAs (miRNAs). Existing prediction methods for associations between SM-miRNA have overlooked crucial aspects: the incorporation of local topological features between nodes, which represent either SMs or miRNAs, and the effective fusion of node features with topological features. This study introduces a novel approach, termed high-order topological features for SM-miRNA association prediction (HTFSMMA), which specifically addresses these limitations. Initially, an association graph is formed by integrating SM-miRNA association data, SM similarity, and miRNA similarity. Subsequently, we focus on the local information of links and propose target neighborhood graph convolutional network for extracting local topological features. Then, HTFSMMA employs graph attention networks to amalgamate these local features, thereby establishing a platform for the acquisition of high-order features through random walks. Finally, the extracted features are integrated into the multilayer perceptron to derive the association prediction scores. To demonstrate the performance of HTFSMMA, we conducted comprehensive evaluations including five-fold cross-validation, leave-one-out cross-validation (LOOCV), SM-fixed local LOOCV, and miRNA-fixed local LOOCV. The area under receiver operating characteristic curve values were 0.9958 ± 0.0024 (0.8722 ± 0.0021), 0.9986 (0.9504), 0.9974 (0.9111), and 0.9977 (0.9074), respectively. Our findings demonstrate the superior performance of HTFSMMA over existing approaches. In addition, three case studies and the DeLong test have confirmed the effectiveness of the proposed method. These results collectively underscore the significance of HTFSMMA in facilitating the inference of associations between SMs and miRNAs.

AdpSTGCN: Adaptive spatial–temporal graph convolutional network for traffic forecasting

Traffic flow forecasting plays a crucial role in applications such as intelligent transportation systems. Despite significant research in this field, the current methods have limitations that hinder the realization of highly accurate predictions. Existing GCN-based approaches typically rely on a definite graph structure derived from a physical topology or learned from node features, which is insufficient for building intricate spatial relationships among nodes. To address this challenge, we propose an adaptive spatial–temporal graph convolutional network for traffic forecasting. Our approach exploits a multi-head attention mechanism to construct multi-view feature graphs. We then introduce an adaptive graph convolution method to dynamically aggregate and propagate information from both the topology graph and multi-view feature graphs, which are capable of capturing complex spatial correlations across diverse proximity ranges. Furthermore, we designed a cascaded structural framework that combines temporal information with node features using gated dilated causal convolution to ensure the integrated modeling of spatial–temporal dynamics in traffic flow. Experiments on real-world datasets demonstrate that our proposed method outperforms the current mainstream methods, achieving better performance in traffic flow forecasting. The code is available at https://github.com/dhxdla/AdpSTGCN.git.

Backdoor attacks on unsupervised graph representation learning

Unsupervised graph learning techniques have garnered increasing interest among researchers. These methods employ the technique of maximizing mutual information to generate representations of nodes and graphs. We show that these methods are susceptible to backdoor attacks, wherein the adversary can poison a small portion of unlabeled graph data (e.g., node features and graph structure) by introducing triggers into the graph. This tampering disrupts the representations and increases the risk to various downstream applications. Previous backdoor attacks in supervised learning primarily operate directly on the label space and may not be suitable for unlabeled graph data. To tackle this challenge, we introduce GRBA,11https://github.com/fbd3/GRBA.git. a gradient-based first-order backdoor attack method. To the best of our knowledge, this constitutes a pioneering endeavor in investigating backdoor attacks within the domain of unsupervised graph learning. The initiation of this method doesn’t necessitate prior knowledge of downstream tasks, as it directly focuses on representations. Furthermore, it is versatile and can be applied to various downstream tasks, including node classification, node clustering and graph classification. We evaluate GRBA on state-of-the-art unsupervised learning models, and the experimental results substantiate the effectiveness and evasiveness of GRBA in both node-level and graph-level tasks.

Towards Inductive and Efficient Explanations for Graph Neural Networks.

Despite recent progress in Graph Neural Networks (GNNs), explaining predictions made by GNNs remains a challenging and nascent problem. The leading method mainly considers the local explanations, i.e., important subgraph structure and node features, to interpret why a GNN model makes the prediction for a single instance, e.g. a node or a graph. As a result, the explanation generated is painstakingly customized at the instance level. The unique explanation interpreting each instance independently is not sufficient to provide a global understanding of the learned GNN model, leading to the lack of generalizability and hindering it from being used in the inductive setting. Besides, training the explanation model explaining for each instance is time-consuming for large-scale real-life datasets. In this study, we address these key challenges and propose PGExplainer, a parameterized explainer for GNNs. PGExplainer adopts a deep neural network to parameterize the generation process of explanations, which renders PGExplainer a natural approach to multi-instance explanations. Compared to the existing work, PGExplainer has better generalization ability and can be utilized in an inductive setting without training the model for new instances. Thus, PGExplainer is much more efficient than the leading method with significant speed-up. In addition, the explanation networks can also be utilized as a regularizer to improve the generalization power of existing GNNs when jointly trained with downstream tasks. Experiments on both synthetic and real-life datasets show highly competitive performance with up to 24.7% relative improvement in AUC on explaining graph classification over the leading baseline.

Dual Contrastive Learning Network for Graph Clustering.

Graph representation is an important part of graph clustering. Recently, contrastive learning, which maximizes the mutual information between augmented graph views that share the same semantics, has become a popular and powerful paradigm for graph representation. However, in the process of patch contrasting, existing literature tends to learn all features into similar variables, i.e., representation collapse, leading to less discriminative graph representations. To tackle this problem, we propose a novel self-supervised learning method called dual contrastive learning network (DCLN), which aims to reduce the redundant information of learned latent variables in a dual manner. Specifically, the dual curriculum contrastive module (DCCM) is proposed, which approximates the node similarity matrix and feature similarity matrix to a high-order adjacency matrix and an identity matrix, respectively. By doing this, the informative information in high-order neighbors could be well collected and preserved while the irrelevant redundant features among representations could be eliminated, hence improving the discriminative capacity of the graph representation. Moreover, to alleviate the problem of sample imbalance during the contrastive process, we design a curriculum learning strategy, which enables the network to simultaneously learn reliable information from two levels. Extensive experiments on six benchmark datasets have demonstrated the effectiveness and superiority of the proposed algorithm compared with state-of-the-art methods.

Breast Cancer Classification From Digital Pathology Images via Connectivity-Aware Graph Transformer.

Automated classification of breast cancer subtypes from digital pathology images has been an extremely challenging task due to the complicated spatial patterns of cells in the tissue micro-environment. While newly proposed graph transformers are able to capture more long-range dependencies to enhance accuracy, they largely ignore the topological connectivity between graph nodes, which is nevertheless critical to extract more representative features to address this difficult task. In this paper, we propose a novel connectivity-aware graph transformer (CGT) for phenotyping the topology connectivity of the tissue graph constructed from digital pathology images for breast cancer classification. Our CGT seamlessly integrates connectivity embedding to node feature at every graph transformer layer by using local connectivity aggregation, in order to yield more comprehensive graph representations to distinguish different breast cancer subtypes. In light of the realistic intercellular communication mode, we then encode the spatial distance between two arbitrary nodes as connectivity bias in self-attention calculation, thereby allowing the CGT to distinctively harness the connectivity embedding based on the distance of two nodes. We extensively evaluate the proposed CGT on a large cohort of breast carcinoma digital pathology images stained by Haematoxylin & Eosin. Experimental results demonstrate the effectiveness of our CGT, which outperforms state-of-the-art methods by a large margin. Codes are released on https://github.com/wang-kang-6/CGT.

Research on group decision optimization and influence analysis in social network based on machine learning

With the rapid development of online social networks, the research on group decision-making in social networks has attracted extensive attention. Social networks facilitate interaction and behavior between individuals, businesses, and organizations. However, traditional group decision-making methods often ignore the social relationships between group members and fail to fully consider the impact of these relationships on subgroup division. In this work, we propose a novel model approach that combines graph neural networks and deep learning techniques to capture and analyze complex relational structures in social networks. The model uses node features and edge features to optimize the group decision-making process and effectively evaluate the influence between individuals through multi-layer network embedding and aggregation operations. Experimental analysis results show that the proposed method performs well in improving the accuracy and efficiency of decision-making, and significantly improves the quality of decision-making.