Node ranking algorithm using Graph Convolutional Networks and mini-batch training
Wenjun Li,
Ting Li and
Elaheh Nikougoftar
Chaos, Solitons & Fractals, 2024, vol. 187, issue C
Abstract:
This paper presents a novel algorithm for ranking nodes in graph-structured data using Graph Convolutional Networks (GCNs) combined with mini-batch training. The proposed method integrates local and global structural information, enabling a comprehensive understanding of node importance within complex networks. By employing a multi-layer GCN architecture with residual connections and dropout regularization, our approach captures intricate graph patterns while mitigating common issues such as vanishing gradients and overfitting. The node importance scores are computed using a Multi-Layer Perceptron (MLP), with the entire model trained using Mean Squared Error (MSE) loss optimized via the Adam algorithm. We demonstrate the scalability and effectiveness of our method through extensive experiments on various benchmark datasets, showcasing its superior performance in node ranking tasks compared to existing approaches.
Keywords: Graph Convolutional Networks; Influential nodes; Complex networks; Mini-batch training (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077924009408
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:187:y:2024:i:c:s0960077924009408
DOI: 10.1016/j.chaos.2024.115388
Access Statistics for this article
Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros
More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().