Information (Feb 2024)

A New Algorithm Framework for the Influence Maximization Problem Using Graph Clustering

  • Agostinho Agra,
  • Jose Maria Samuco

DOI
https://doi.org/10.3390/info15020112
Journal volume & issue
Vol. 15, no. 2
p. 112

Abstract

Read online

Given a social network modelled by a graph, the goal of the influence maximization problem is to find k vertices that maximize the number of active vertices through a process of diffusion. For this diffusion, the linear threshold model is considered. A new algorithm, called ClusterGreedy, is proposed to solve the influence maximization problem. The ClusterGreedy algorithm creates a partition of the original set of nodes into small subsets (the clusters), applies the SimpleGreedy algorithm to the subgraphs induced by each subset of nodes, and obtains the seed set from a combination of the seed set of each cluster by solving an integer linear program. This algorithm is further improved by exploring the submodularity property of the diffusion function. Experimental results show that the ClusterGreedy algorithm provides, on average, higher influence spread and lower running times than the SimpleGreedy algorithm on Watts–Strogatz random graphs.

Keywords