Features Of Nodes Research Articles

Three-way graph convolutional network for multi-label classification in multi-label information system

The Graph Convolutional Neural Networks (GCNs) have demonstrated a powerful capacity for relation processing. To improve the representation learning capability of GCNs, numerous studies have begun to excavate latent topological graphs based on node features, aiming to obtain richer representations of nodes. However, these graph mining methods based on global metrics, such as Euclidean distance, lack descriptions of uncertainty and fine granularity, leading to the loss of structural information, which affects the final representation of nodes. Therefore, this paper proposes the Three-way Graph Convolutional Neural Network (TW-GCN), which is based on multi-granularity and three-way decision. First, from the perspective of multi-granularity, each attribute is analyzed as a granule, and we establish relations of advantage, disadvantage, and uncertainty for objects under each attribute granule. Three-way relation captures the complex connections between nodes from multiple perspectives, improves the comprehensive understanding of graph data, and avoids the information loss caused by traditional two-way processing. Second, a three-way graph convolutional layer is constructed to capture uncertainty and ambiguity by performing graph convolution on different topological graphs. The final node representation is obtained through message passing on the node’s neighbor graph, which considers not only the global structure, but also effectively captures local structural features. Finally, we employ the TW-GCN for multi-label classification within information systems to validate the model’s validity based on multiple indicators.

Evolutionary Digital Twin-Oriented Complex Networked Systems driven by node features and the mutation of feature preferences.

Accurate modelling of complex social systems, where people interact with each other and those interactions change over time, has been a research challenge for many years. This study proposes an evolutionary Digital Twin-Oriented Complex Networked System (DT-CNS) framework that considers heterogeneous node features and changeable connection preferences. We create heterogeneous preference mutation mechanisms to characterise nodes' adaptive decisions on preference mutation in response to interaction patterns and epidemic risks. In this space, we use nodes' interaction utilities to characterise the positive feedback from interactions and negative impact of epidemic risks. We also introduce social capital constraint to harness the density of social connections better. The nodes' heterogeneous preference mutation styles include the (i)inactive style that keeps initial social preferences, (ii) ignorant style that randomly mutates preferences, (iii) egocentric style that optimises individual interaction utility, (iv) cooperative style that optimises the total interaction utilities by group decisions and (v) collaborative style that further allows the cooperative nodes to transfer social capital. Our simulation experiments on evolutionary DT-CNSs reveal that heterogeneous preference mutation styles lead to various interaction and infection patterns. The results also show that (i) increasing social capital enables higher interactions but higher infection risks and uncertainty in decision-making; (ii) group decisions outperform individual decisions by eliminating the unawareness of the decisions of other nodes; (iii) the collaborative nodes under a strict social capital limit can promote interactions, reduce infection risks and achieve higher overall interaction utilities.

A landslide susceptibility assessment method considering the similarity of geographic environments based on graph neural network

Landslide susceptibility assessment (LSA) is vital for landslide mitigation and management. Existing LSA methods only consider local environmental characteristics associated with landslides, while neglecting the characteristics of remote yet interconnected geographic environments. In addition, the datasets for landslide samples do not consider the equilibrium among various geographic environmental characteristics. Ultimately, the landslide susceptibility mapping (LSM) generated is unreliable. We propose an LSA method based on the similarity of geographic environments and the equilibrium of landslide samples. We selected the Bailong River Basin (BRB) as the study area. Our proposed LSA method has four steps: (1) We constructed slope units using the curvature watershed method (CWM) based on the digital elevation model (DEM) to generate geographic nodes and selected 12 landslide influencing factors (LIFs) through multicollinearity analysis to extract geographic node features. (2) We constructed an association graph of geographic environment similarity constraints based on geographic node features using the cosine similarity method to correlate landslide and geographical environments. (3) We constructed sample datasets for an equal number of landslide and non-landslides based on various geographic environments. (4) We constructed a graph neural network (GNN) model based on the association graph to predict the susceptibility of unknown geographic nodes, obtaining a reliable LSM. Compared with random forest (RF), support vector machine (SVM), and multi-layer perceptron (MLP) models, our proposed model framework outperforms in the LSA. The area under the receiver operating characteristic curve (AUC) values improved by 6.2%, 5.7%, and 1.8%, respectively. Specifically, our model can predict landslides across space in areas with few samples. Our proposed model offers an effective approach and essential technical support for landslide disaster investigation and prevention.

DPMGCDA: Deciphering circRNA-Drug Sensitivity Associations with Dual Perspective Learning and Path-Masked Graph Autoencoder.

Accumulating evidence has indicated that the expression of circular RNAs (circRNAs) can affect the cellular sensitivity to drugs and significantly influence drug efficacy. However, traditional experimental approaches for validating these associations are resource-intensive and time-consuming. To address this challenge, we propose a computational framework termed DPMGCDA leveraging dual perspective learning and path-masked graph autoencoder to predict circRNA-drug sensitivity associations. Initially, we construct circRNA-circRNA fusion similarity networks and drug-drug fusion similarity networks using similarity network fusion, ensuring a comprehensive integration of information. Based on the above, we built the circRNA homogeneous graph, the drug homogeneous graph, and the circRNA-drug heterogeneous graph. Next, we form the initial node features in the circRNA-drug heterogeneous graph from the homogeneous graph-level perspective and the combined feature-level perspective and complete the prediction of potential associations using the path-masked graph autoencoder in both perspectives. The predictions under both perspectives are finally combined to obtain the final prediction score. Transductive setting experiments and inductive setting experiments all demonstrate that our method, DPMGCDA, outperforms state-of-the-art approaches. Additionally, we verify the necessity of employing dual perspective learning through ablation tests and analyze the effective encoding capability of the path-masked graph autoencoder for features through embedding visualization. Moreover, case studies on four drugs corroborate DPMGCDA's ability to identify potential circRNAs associated with new drugs.

Link prediction in protein–protein interaction network: A similarity multiplied similarity algorithm with paths of length three

Protein–protein interactions (PPIs) are crucial for various biological processes, and predicting PPIs is a major challenge. To solve this issue, the most common method is link prediction. Currently, the link prediction methods based on network Paths of Length Three (L3) have been proven to be highly effective. In this paper, we propose a novel link prediction algorithm, named SMS, which is based on L3 and protein similarities. We first design a mixed similarity that combines the topological structure and attribute features of nodes. Then, we compute the predicted value by summing the product of all similarities along the L3. Furthermore, we propose the Max Similarity Multiplied Similarity (maxSMS) algorithm from the perspective of maximum impact. Our computational prediction results show that on six datasets, including S. cerevisiae, H. sapiens, and others, the maxSMS algorithm improves the precision of the top 500, area under the precision–recall curve, and normalized discounted cumulative gain by an average of 26.99%, 53.67%, and 6.7%, respectively, compared to other optimal methods.

Method for Generating Indoor 3D Scene Graphs Based on Instance Features and Relationship Encoding

Abstract. A 3D scene graph is a compact and explicit representation in scene analysis. In today’s 3D scene graph prediction methods, the feature encoding method of nodes and edges is relatively simple, which essentially hinders the network from fully learning 3D point cloud features. In this paper, we propose a 3D scene graph task framework that fully expresses node and edge features, trying to meet the requirements of fully utilizing point cloud features to achieve high-precision prediction. Experimental results show that with the help of the new representation method, the prediction performance of 3D scene graphs has been significantly improved.

Research on power generation prediction of hydropower in river basin based on multi-head attention graph convolutional neural network

For the power generation prediction of traditional hydropower stations, most of them only use time series prediction and neglect to study the spatial topological relationship of hydropower stations in the river basin, so that it is difficult to fully explore the characteristic relationship of space power stations. In this paper, a research method for power generation prediction of hydropower in river basin hydropower stations based on multi-head attention map convolutional neural network is proposed. This method establishes a first-level node neighborhood feature map based on the spatial geographic distribution information of hydropower stations in the basin, and uses the method of graph convolution to carry out node feature mining and feature learning, so as to transform the power generation capacity evaluation problem of the hydropower station in the basin into the node prediction problem in the graph, which is different from the global normalization rule. the multi-head attention mechanism introduced further improves the information aggregation quality of the graph node, and uses the historical temperature, power generation, electricity price, unit status and other data of each hydropower station in the basin for training. The reasoning results show that the proposed method achieves higher accuracy than other schemes, and the power prediction method is conducive to the formulation of power plans of hydropower stations in the basin, and can also play a positive role in guiding the site selection of hydropower plants.

Learning dynamic graph representations through timespan view contrasts

The rich information underlying graphs has inspired further investigation of unsupervised graph representation. Existing studies mainly depend on node features and topological properties within static graphs to create self-supervised signals, neglecting the temporal components carried by real-world graph data, such as timestamps of edges. To overcome this limitation, this paper explores how to model temporal evolution on dynamic graphs elegantly. Specifically, we introduce a new inductive bias, namely temporal translation invariance, which illustrates the tendency of the identical node to keep similar labels across different timespans. Based on this assumption, we develop a dynamic graph representation framework CLDG that encourages the node to maintain locally consistent temporal translation invariance through contrastive learning on different timespans. Except for standard CLDG which only considers explicit topological links, our further proposed CLDG＋＋additionally employs graph diffusion to uncover global contextual correlations between nodes, and designs a multi-scale contrastive learning objective composed of local–local, local–global, and global–global contrasts to enhance representation capabilities. Interestingly, by measuring the consistency between different timespans to shape anomaly indicators, CLDG and CLDG＋＋are seamlessly integrated with the task of spotting anomalies on dynamic graphs, which has broad applications in many high-impact domains, such as finance, cybersecurity, and healthcare. Experiments demonstrate that CLDG and CLDG＋＋both exhibit desirable performance in downstream tasks including node classification and dynamic graph anomaly detection. Moreover, CLDG significantly reduces time and space complexity by implicitly exploiting temporal cues instead of complicated sequence models. The code and data are available at https://github.com/yimingxu24/CLDG.

Identification of key nodes in complex networks by using a joint technique of nonnegative matrix factorization and regularization

Identifying key nodes in complex networks is essential to deeply understand and fully utilize the properties and functions of complex systems. Currently, existing traditional methods perform critical nodes identification by manually selecting important attribute features of nodes, but there are limitations in this approach. Manual selection of attribute features may overlook non-obvious features related to nodes criticality and correlations between attribute features. To compensate for the shortcomings of traditional methods, a Joint Technique for identifying critical nodes, called JTNMFR, is presented based on Nonnegative Matrix Factorization and Regularization. Factorization of weighted adjacency matrix is performed to obtain potential attribute features of nodes, and communicability network matrix and similarity matrix are introduced as regularization terms to control sparsity of the decomposition results. Ultimately, the importance of nodes is assessed by constructing an objective function that integrates these two aspects and utilizing alternative iteration to obtain the attribute matrix. To validate the accuracy and reliability of JTNMFR, we compare it with nine other identification approaches on eight real networks. Experimental results show that JTNMFR not only significantly outperforms the other algorithms in terms of accuracy of node importance, monotonicity, and node spreading ability but also provides a more accurate means of assessing node importance.

Self-attention empowered graph convolutional network for structure learning and node embedding

In representation learning on graph-structured data, many popular graph neural networks (GNNs) fail to capture long-range dependencies, leading to performance degradation. Furthermore, this weakness is magnified when the concerned graph is characterized by heterophily (low homophily). To solve this issue, this paper proposes a novel graph representation learning framework called the graph convolutional network with self-attention (GCN-SA). The proposed scheme exhibits an exceptional generalization capability in node-level representation learning. The proposed GCN-SA contains two enhancements corresponding to edges and node features. For edges, we utilize a self-attention mechanism to design a stable and effective graph-structure-learning module that can capture the internal correlation between any pair of nodes. This graph-structure-learning module can identify reliable neighbors for each node from the entire graph. Regarding the node features, we modify the transformer block to enable it to assist the GCN in integrating valuable information from the entire graph. These two enhancements work in distinct ways to help our GCN-SA capture long-range dependencies, enabling it to perform representation learning on graphs with varying levels of homophily. The experimental results on real-world benchmark datasets demonstrate the effectiveness of the proposed GCN-SA. Compared to other outstanding GNN counterparts, the proposed GCN-SA is competitive. The source code is available at https://github.com/mengyingjiang/GCN-SA.

Key Vulnerable Nodes Discovery Based on Bayesian Attack Subgraphs and Improved Fuzzy C-Means Clustering

Aiming at the problem that the search efficiency of key vulnerable nodes in large-scale networks is not high and the consideration factors are not comprehensive enough, in order to improve the time and space efficiency of search and the accuracy of results, a key vulnerable node discovery method based on Bayesian attack subgraphs and improved fuzzy C-means clustering is proposed. Firstly, the attack graph is divided into Bayesian attack subgraphs, and the analysis results of the complete attack graph are quickly obtained by aggregating the information of the attack path analysis in the subgraph to improve the time and space efficiency. Then, the actual threat features of the vulnerability nodes are extracted from the analysis results, and the threat features of the vulnerability itself in the common vulnerability scoring standard are considered to form the clustering features together. Next, the optimal number of clusters is adaptively adjusted according to the variance idea, and fuzzy clustering is performed based on the extracted clustering features. Finally, the key vulnerable nodes are determined by setting the feature priority. Experiments show that the proposed method can optimize the time and space efficiency of analysis, and the fuzzy clustering considering multiple features can improve the accuracy of analysis results.

Self-supervised graph representations with generative adversarial learning

Graph Neural Networks (GNNs) are powerful neural models for representation learning on graphs. In this work we study a self-supervised learning GNN method GraphSSGAN (Graph Self-Supervised Generative Adversarial Network) that learns generalized node representations using only unlabeled data. The core idea lies in learning representations that capture both the local information of the links and the global information of the plausibility of the subgraph samples. Specifically, node features of the original graph are first encoded into latent representations by optimizing a link prediction objective. Then the generator converts noise vectors to node representations in the latent space and predicts the link probabilities from the generated node representations. The discriminator leverages the graph convolutional network (GCN) architecture to produce permutation-invariant graph-level embeddings, and the intermediate node representations are used by simple classifiers in the downstream tasks. In addition, we introduce several technical tricks including Gumbel-Top-k trick, Gumbel-Softmax trick and mini-batch training via subgraph sampling to improve the training process. Through extensive experiments on node classification and link prediction tasks, we demonstrate the effectiveness of the proposed model and the contribution of GAN framework on graph representation learning.

AI-Empowered Multimodal Hierarchical Graph-Based Learning for Situation Awareness on Enhancing Disaster Responses

Situational awareness (SA) is crucial in disaster response, enhancing the understanding of the environment. Social media, with its extensive user base, offers valuable real-time information for such scenarios. Although SA systems excel in extracting disaster-related details from user-generated content, a common limitation in prior approaches is their emphasis on single-modal extraction rather than embracing multi-modalities. This paper proposed a multimodal hierarchical graph-based situational awareness (MHGSA) system for comprehensive disaster event classification. Specifically, the proposed multimodal hierarchical graph contains nodes representing different disaster events and the features of the event nodes are extracted from the corresponding images and acoustic features. The proposed feature extraction modules with multi-branches for vision and audio features provide hierarchical node features for disaster events of different granularities, aiming to build a coarse-granularity classification task to constrain the model and enhance fine-granularity classification. The relationships between different disaster events in multi-modalities are learned by graph convolutional neural networks to enhance the system’s ability to recognize disaster events, thus enabling the system to fuse complex features of vision and audio. Experimental results illustrate the effectiveness of the proposed visual and audio feature extraction modules in single-modal scenarios. Furthermore, the MHGSA successfully fuses visual and audio features, yielding promising results in disaster event classification tasks.

Predicting associations between CircRNA and diseases through structure-aware graph transformer and path-integral convolution

A series of biological experiments has demonstrated that circular RNAs play a crucial regulatory role in cellular processes and may be potentially associated with diseases. Uncovering these connections helps in understanding potential disease mechanisms and advancing the development of treatment strategies. However, in biology, traditional experiments face limitations in terms of efficiency and cost, especially when enumerating possible associations. To address these limitations, several computational methods have been proposed, but existing methods only measure from a nodal perspective and cannot capture structural similarities between edges. In this study, we introduce an advanced computational method called SATPIC2CD for analyzing potential associations between circular RNAs and diseases. Specifically, we first employ an Structure-Aware Graph Transformer (SAT), which extracts five predefined metapath representations before calculating attention. This adaptive network integrates structural information into the original self-attention by aggregating information within and between paths. Subsequently, we use Path Integral Convolutional Networks (PACN) to integrate feature information for all path weights between two nodes. Afterward, we complement the network node features with feature loss and feature smoothing using Gated Recurrent Units (GRU) and node centrality. Finally, a Multi-Layer Perceptron (MLP) is employed to obtain the ultimate prediction scores for each circular RNA-disease pair. SATPIC2CD performs remarkably well, with an accuracy of up to 0.9715 measured by the Area Under the Curve (AUC) in a 5-fold cross-validation, surpassing other comparative models. Case studies further emphasize the high precision of our method in identifying circular RNA-disease associations, laying a solid foundation for guiding future biological research efforts.

Postoperative Lymph Node Recurrence in Esophageal Cancer After Surgery and Prognosis of Chemoradiotherapy.

This study aimed to evaluate the long-term prognosis of definitive chemoradiotherapy and clinical features of postoperative lymph node (LN) recurrence after curative resection of thoracic esophageal squamous cell cancer (ESCC). A total of 586 patients who underwent radical resection of ESCC at the Hiroshima University Hospital from January 2000 to December 2019 were reviewed retrospectively. This study analyzed the clinical characteristics of 54 patients who developed recurrence in a solitary LN by comparing them to 182 patients who experienced total recurrence. Additionally, we analyzed the prognostic factors of 50 patients who received chemo-radiotherapy (CRT). The results revealed a tendency for a higher incidence of solitary LN recurrence in cases of early esophageal cancer and upper thoracic esophageal cancer among all recurrence cases. The 3-, 5-, and 7-year overall survival (OS) rates were 40.5%, 37.8% and 34.6%, respectively, with a median survival time of 27.9 months. Univariate analysis of OS factors, such as age, depth of the primary tumor at the initial surgery, time to LN recurrence after surgery, site of LN recurrence, and the number of the regional LNs with recurrence showed no significant impact on OS. Approximately 35% of patients with ESCC who experienced LN recurrence after curative resection achieved long-term survival through CRT. Despite the absence of identifiable prognostic factors, CRT proves to be a valuable initial treatment option for LN recurrence.

DeepGCN based on variable multi‐graph and multimodal data for ASD diagnosis

AbstractDiagnosing individuals with autism spectrum disorder (ASD) accurately faces great challenges in clinical practice, primarily due to the data's high heterogeneity and limited sample size. To tackle this issue, the authors constructed a deep graph convolutional network (GCN) based on variable multi‐graph and multimodal data (VMM‐DGCN) for ASD diagnosis. Firstly, the functional connectivity matrix was constructed to extract primary features. Then, the authors constructed a variable multi‐graph construction strategy to capture the multi‐scale feature representations of each subject by utilising convolutional filters with varying kernel sizes. Furthermore, the authors brought the non‐imaging information into the feature representation at each scale and constructed multiple population graphs based on multimodal data by fully considering the correlation between subjects. After extracting the deeper features of population graphs using the deep GCN(DeepGCN), the authors fused the node features of multiple subgraphs to perform node classification tasks for typical control and ASD patients. The proposed algorithm was evaluated on the Autism Brain Imaging Data Exchange I (ABIDE I) dataset, achieving an accuracy of 91.62% and an area under the curve value of 95.74%. These results demonstrated its outstanding performance compared to other ASD diagnostic algorithms.

SA-GNN: Prediction of material properties using graph neural network based on multi-head self-attention optimization

With the development of science and technology and the improvement of hardware computing power, the application of large models in the field of artificial intelligence (AI) has become a current research hotspot Among the focal points in the field of deep learning, AI for science is one of the highlighted areas, utilizing deep learning methods for pattern recognition, anomaly detection, predictive analysis, and more on a large scale of scientific data. In the realm of materials science, the structure of crystals is composed of edges and nodes, making it readily representable as a graph. In previous research, some typical models, such as the MEGNet model, utilized their graph neural network features to fit computational results based on density functional theory for predicting various material properties. Building on this concept, the authors propose a novel graph neural network (GNN) model, optimized with a Multi-Head Self-Attention (MHSA) mechanism, for predicting materials data with crystal structures. This model is named self-attention enhanced graph neural network. The model segments the input data into three parts: edges, nodes, and global features. The graph convolutional layer module is primarily used for aggregating node, edge, and global features, learning node representations, and capturing higher-order neighborhood information through multiple layers of GNN. The MHSA component allows nodes to learn global dependencies, providing different representation subspaces for the nodes. In comparison with other machine learning and deep learning models, the results indicate an improvement in the predictive accuracy of this model. A new graph neural network (GNN) model called Self-Attention Enhanced Graph Neural Network (SA-GNN) is proposed for predicting the properties of materials with crystal structures. This model incorporates multi-head self-attention to allow nodes to learn global dependencies and generate different representational subspaces. Compared to other machine learning and deep learning models, the results show improved predictive accuracy, demonstrating the potential of graph networks combined with self-attention for modeling crystal material data.

An Intrusion Detection System against RPL-based Routing Attacks for IoT Networks

<span lang="EN-US">The significant improvement in the Internet, Internet of Things (IoT), communication, and cloud computing have created considerable challenges in providing security for data and devices. In IoT networks, “Routing Protocol for Low power and Lossy networks”- (RPL) is a communication protocol that enables devices to exchange information and communicate with limited resources like low processing capabilities, less memory and energy. Through the Internet, unauthorised users can access RPL-based IoT networks, making these networks susceptible to routing attacks. Therefore, it is crucial to design Intrusion Detection System-(IDS) to address attacks from IoT communication devices. In this paper, we have proposed GCNConv, a Graph Neural Network (GNN) method that allows capturing the edge and node features of a graph to identify routing attacks. The proposed system has experimented on the RADAR dataset and experimental findings proved that, our approach performs well compared to state-of-the-art method with reference to precision, F1-score, accuracy and recall.</span>

PPRTGI: A Personalized PageRank Graph Neural Network for TF-Target Gene Interaction Detection.

Transcription factors (TFs) regulation is required for the vast majority of biological processes in living organisms. Some diseases may be caused by improper transcriptional regulation. Identifying the target genes of TFs is thus critical for understanding cellular processes and analyzing disease molecular mechanisms. Computational approaches can be challenging to employ when attempting to predict potential interactions between TFs and target genes. In this paper, we present a novel graph model (PPRTGI) for detecting TF-target gene interactions using DNA sequence features. Feature representations of TFs and target genes are extracted from sequence embeddings and biological associations. Then, by combining the aggregated node feature with graph structure, PPRTGI uses a graph neural network with personalized PageRank to learn interaction patterns. Finally, a bilinear decoder is applied to predict interaction scores between TF and target gene nodes. We designed experiments on six datasets from different species. The experimental results show that PPRTGI is effective in regulatory interaction inference, with our proposed model achieving an area under receiver operating characteristic score of 93.87% and an area under precision-recall curves score of 88.79% on the human dataset. This paper proposes a new method for predicting TF-target gene interactions, which provides new insights into modeling molecular networks and can thus be used to gain a better understanding of complex biological systems.

Optimizing energy storage plant discrete system dynamics analysis with graph convolutional networks

Addressing the challenges of suboptimal model performance and excessive parameters and operations in the optimization of energy storage power plants utilizing Graph Convolutional Network (GCN), this paper introduces a novel approach – the packet-switched graph convolutional network. Initially, a GCN extreme learning machine is established. Drawing inspiration from this solid foundation, we have innovatively crafted a group exchange graph convolution module. This module leverages group graph convolution techniques to amalgamate unique node feature information, tailored to diverse topology graph matrices based on various groupings. This innovative approach ensures that information flows freely and effectively among distinct groupings. Furthermore, we have designed a cutting-edge timing depth separation convolution module, comprising two innovative components. The first component introduces timing depth separation convolution, revolutionizing the original timing convolution module. The second component, the packet-switching graph convolutional network, revolutionizes the time sequence depth separation convolution process. It achieves this by employing 1 × 1 convolutional layers between different feature fusion packets, enabling seamless information exchange between distinct packets. Experimental results demonstrate the efficacy of the proposed model, with root mean square error (RMSE) metrics and root mean square error (MAE) metrics for single-step prediction reaching 46.08 and 26.22 at 60 min, respectively. In multi-step testing, the proposed model exhibits a 14.71 % reduction in RMSE error at the 15-min scale and a 9.29 % reduction at the 60-min scale compared to the benchmark model. This performance improvement enhances the operational efficiency and reliability of the energy storage plant, particularly under dynamic changes in the time series.