mlsanityData to 7 Oct 2026

Vital Node Identification in Complex Networks Using a Machine Learning-Based Approach

arXiv 2202.06229 ↗First posted 13 Feb 2022cs.SI cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Vital node identification is the problem of finding nodes of highest importance in complex networks. This problem has crucial applications in various contexts such as viral marketing or controlling the propagation of virus or rumours in real-world networks. Existing approaches for vital node identification mainly focus on capturing the importance of a node through a mathematical expression which directly relates structural properties of the node to its vitality. Although these heuristic approaches have achieved good performance in practice, they have weak adaptability, and their performance is limited to specific settings and certain dynamics. Inspired by the power of machine learning models for efficiently capturing different types of patterns and relations, we propose a machine learning-based, data driven approach for vital node identification. The main idea is to train the model with a small portion of the graph, say 0.5% of the nodes, and do the prediction on the rest of the nodes. The ground-truth vitality for the train data is computed by simulating the SIR diffusion method starting from the train nodes. We use collective feature engineering where each node in the network is represented by incorporating elements of its connectivity, degree and extended coreness. Several machine learning models are trained on the node representations, but the best results are achieved by a Support Vector Regression machine with RBF kernel. The empirical results confirms that the proposed model outperforms state-of-the-art models on a selection of datasets, while it also shows more adaptability to changes in the dynamics parameters.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 7 of its 57 references that are in the map. First posted on arXiv 13 Feb 2022.

Builds on

7 of 57 references.

References · 7

  1. 2015A Random Forest Guided Tourcited by 168
  2. 2020k-Nearest Neighbour Classifiers: 2nd Edition (with Python examples)cited by 56
  3. 2016Vital nodes identification in complex networkscited by 15
  4. 2020Adversarial Graph Embeddings for Fair Influence Maximization over Social Networkscited by 15
  5. 2015Locating influential nodes via dynamics-sensitive centralitycited by 4
  6. 2015Identifying influential spreaders in complex networks based on gravity formulacited by 4
  7. 2017Leveraging local h-index to identify and rank influential spreaders in networkscited by 3

Built on by

Cited by year

Citing papers per year: 2022: 1.

1 paper.