2026· passer of basic and applied sciences· Vol 8· 0 citations· 47 references
TL;DR
CNNG, a novel hybrid deep learning model combining Convolutional Neural Networks and Graph Attention Networks for predicting node influence, is proposed, which achieves the best average Kendall’s Tau coefficient and the highest average Monotonicity Index over ten networks.
Abstract
The influential nodes in complex network are the key of high effective information spreading. Several techniques have been developed for the discovery of such nodes, including centrality-based approaches, machine learning-based approaches, and deep learning-based approaches. This paper proposes CNNG, a novel hybrid deep learning model combining Convolutional Neural Networks (CNN) and Graph Attention Networks (GAT) for predicting node influence. CNNG processes each node’s local subgraph through parallel CNN and GAT components to capture both structural patterns and relational dependencies. The model is trained in a supervised regression setting, using node influence scores generated via SIR simulations. Experiments on twelve real networks show that CNNG achieves the best average Kendall’s Tau coefficient of 0.7510, outperforming the second-best method by 2.85% as well as the highest average Monotonicity Index of 0.9954 and the highest average Jaccard Similarity of 0.7298 over ten networks. Further, CNNG provides these results in a reasonable amount of computing time, which demonstrates the practicability, efficiency and generality of CNNG for the complex network analysis.
Identifying influential nodes is a fundamental task in complex network analysis, with applications in epidemic control, information diffusion, and network robustness. Existing centrality-based and learning-based methods often provide limited integration of structural information across different network scales. To addr...
Rihab Boukheche, Mohammed Lalou, Nardjes Bouchemal· 0 citations
Identifying influential nodes in complex networks is a fundamental challenge in network science. This problem involves measuring the influence of nodes and identifying those that exert the greatest impact on network dynamics and information dissemination. Existing approaches can be broadly divided into two categories:...
Amir Sheikhahmadi, L. Tafakori, M. Jalili· ACM Computing Surveys· 0 citations
It is indicated that structural information remains important for link prediction in contemporary learning-based models and future work will continue to improve the scalability, robustness, temporal adaptation and interpretability of link prediction models for large-scale, dynamic real-world networks.
Кай Ли· Theoretical and Natural Scie...· 0 citations
A graph neural network model for predicting probabilistic links with network embedding via generalized graph convolutional networks, referred to as LPNE2GGCN for graph network datasets, has been proposed and initial results suggest that this methodology produces excellent results compared to conventional methods across...
Riju Bhattacharya, N. K. Nagwani, Deepak Suresh Asudani et al.· IEEE Access· 0 citations
Traditional centrality measures normally rely on a single topological scale, which limits their ability to comprehensively characterize the roles of nodes across local, semi-local, and global network structures. Moreover, their generalization capability across different network types is often weak, leading to low accur...
Graph neural networks have shown strong potential for learning structural representations of biological networks. However, repeated message passing may blur local structural signals that are relevant for motif- and graphlet-based analysis. This paper investigates multilabel graphlet classification in protein–protein in...
Lidija Kunst, Friedhelm Schwenker, H. Kestler· Entropy· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.