The inference of novel knowledge, the discovery of hidden patterns, and the uncovering of insights from large amounts of data from a multitude of sources make data science to an art rather than just a mere scientific discipline. The study and design of mathematical models and signal processing tools able to analyze information represents a central research topic within data science. In this work, we introduce and investigate a model for influence maximization (IM) on graphs using ideas from kernel-based signal approximation, Gaussian process regression, and the minimization of a corresponding variance term. Data-driven approaches can be applied to determine proper kernels for this IM model and machine learning methodologies are adopted to tune the model parameters. Compared to stochastic models for influence maximization that rely on Monte-Carlo simulations, our kernel-based model allows for a simple and cost-efficient update strategy to compute optimal influencing nodes on a graph. In several numerical experiments, we show the properties and benefits of this model.

Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization

Santin G.
Membro del Collaboration Group
2023-01-01

Abstract

The inference of novel knowledge, the discovery of hidden patterns, and the uncovering of insights from large amounts of data from a multitude of sources make data science to an art rather than just a mere scientific discipline. The study and design of mathematical models and signal processing tools able to analyze information represents a central research topic within data science. In this work, we introduce and investigate a model for influence maximization (IM) on graphs using ideas from kernel-based signal approximation, Gaussian process regression, and the minimization of a corresponding variance term. Data-driven approaches can be applied to determine proper kernels for this IM model and machine learning methodologies are adopted to tune the model parameters. Compared to stochastic models for influence maximization that rely on Monte-Carlo simulations, our kernel-based model allows for a simple and cost-efficient update strategy to compute optimal influencing nodes on a graph. In several numerical experiments, we show the properties and benefits of this model.
File in questo prodotto:
File Dimensione Formato  
Kernel-based models for influence maximization on graphs.pdf

non disponibili

Tipologia: Versione dell'editore
Licenza: Copyright dell'editore
Dimensione 1.46 MB
Formato Adobe PDF
1.46 MB Adobe PDF   Visualizza/Apri

I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10278/5035143
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 0
social impact