Evidence map›Paper›PMID 41748701›Full record

ArticleScientific reports2026

Integrating machine learning techniques for critical node identification in complex networks.

Madupuri ReddyPriya, Murali Krishna Enduri, Koduru Hajarathaiah, Anamalamudi Satish, Narendra Bandaru

Abstract read
In one paragraph

Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Madupuri ReddyPriyaDepartment of Computer Science and Engineering, SRM University-AP, Andhra Pradesh, India.
Murali Krishna EnduriDepartment of Computer Science and Engineering, SRM University-AP, Andhra Pradesh, India. muralikrishna.e@srmap.edu.in.
Koduru HajarathaiahSchool of Computer Science and Engineering, VIT-AP University, Guntur, India.
Anamalamudi SatishDepartment of Computer Science and Engineering, SRM University-AP, Andhra Pradesh, India.
Narendra BandaruDepartment of Electrical and Computer Engineering, Aarhus University, Aarhus N, 8200, Denmark.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Identifying the most prominent nodes in complex networks becomes more critical for applications such as information propagation, epidemic control, and network robustness. In network structure analysis, centrality measures typically use the network's intrinsic topological structure and fail to capture the nonlinear dependencies between nodes structural features and their spreading ability under dynamic transmission scenarios. To overcome these limitations, this study proposes a machine learning based approach for efficiently identifying the most prominent in transmission scenarios. A feature vector is constructed for each node by integrating infection rate a crucial factor in spreading dynamics and various topological features. Later, the true spreading ability of each node, determined from propagation simulations using SIR and IC model is used for labelling. Several machine learning techniques, including Support Vector Machines, KNN, Random Forests, are evaluated as standalone classifiers. In addition, to better capture complex relationships between node features and spreading ability, we develop a hybrid clustering-classification approach that unifies K-means clustering with SVM (SVM+K-means), in which K-means is used to cluster nodes based on their feature similarity and SVM performs the final classification. Experimental results shows on multiple real world networks that our proposed frame work outperforms traditional centrality measures in accurately identifying influential nodes. The findings show that combining machine learning approaches with structural and dynamic network properties results in an effective and scalable strategy for identifying the most essential nodes. Our proposed frame work improves the accuracy of identifying influential nodes with minimum of 15% and maximum of 45% when compared with traditional centrality measures.

Indexed as

CentralityComplex networksMachine learningVital nodes

Identifiers

PMID41748701
PMCPMC12988216

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.