mlsanityData to 7 Oct 2026

Identifying Key Nodes for the Influence Spread using a Machine Learning Approach

arXiv 2412.01949 ↗First posted 2 Dec 2024cs.SI cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

The identification of key nodes in complex networks is an important topic in many network science areas. It is vital to a variety of real-world applications, including viral marketing, epidemic spreading and influence maximization. In recent years, machine learning algorithms have proven to outperform the conventional, centrality-based methods in accuracy and consistency, but this approach still requires further refinement. What information about the influencers can be extracted from the network? How can we precisely obtain the labels required for training? Can these models generalize well? In this paper, we answer these questions by presenting an enhanced machine learning-based framework for the influence spread problem. We focus on identifying key nodes for the Independent Cascade model, which is a popular reference method. Our main contribution is an improved process of obtaining the labels required for training by introducing 'Smart Bins' and proving their advantage over known methods. Next, we show that our methodology allows ML models to not only predict the influence of a given node, but to also determine other characteristics of the spreading process-which is another novelty to the relevant literature. Finally, we extensively test our framework and its ability to generalize beyond complex networks of different types and sizes, gaining important insight into the properties of these methods.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 10 of its 42 references that are in the map. First posted on arXiv 2 Dec 2024.

Builds on

10 of 42 references.

References · 10

  1. 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
  2. 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
  3. 2019Multi-scale Attributed Node Embeddingcited by 543
  4. 2013Axioms for Centralitycited by 15
  5. 2016Identifying a set of influential spreaders in complex networkscited by 10
  6. 2017Quantifying layer similarity in multiplex networks: a systematic studycited by 5
  7. 2020Top influencers can be identified universally by combining classical centralitiescited by 4
  8. 2022Influencer Detection with Dynamic Graph Neural Networkscited by 3
  9. 2018Perturb and Combine to Identify Influential Spreaders in Real-World Networkscited by 1
  10. 2023Finding Influencers in Complex Networks: An Effective Deep Reinforcement Learning Approachcited by 1

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.