MATI: An efficient algorithm for influence maximization in social networks

Abstract : Influence maximization has attracted a lot of attention due to its numerous applications, including diffusion of social movements, the spread of news, viral marketing and outbreak of diseases. The objective is to discover a group of users that are able to maximize the spread of influence across a network. The greedy algorithm gives a solution to the Influence Maxi-mization problem while having a good approximation ratio. Nevertheless it does not scale well for large scale datasets. In this paper, we propose Matrix Influence, MATI, an efficient algorithm that can be used under both the Linear Threshold and Independent Cascade diffusion models. MATI is based on the precalculation of the influence by taking advantage of the simple paths in the node's neighborhood. An extensive empirical analysis has been performed on multiple real-world datasets showing that MATI has competitive performance when compared to other well-known algorithms with regards to running time and expected influence spread.
Complete list of metadatas

Cited literature [37 references]  Display  Hide  Download

https://hal-centralesupelec.archives-ouvertes.fr/hal-01950273
Contributor : Fragkiskos Malliaros <>
Submitted on : Monday, December 10, 2018 - 4:26:02 PM
Last modification on : Thursday, July 11, 2019 - 2:10:08 PM
Long-term archiving on : Monday, March 11, 2019 - 3:50:20 PM

File

MATI_Plos_One_2018.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01950273, version 1

Citation

Maria Evgenia G. Rossi, Bowen Shi, Nikolaos Tziortziotis, Fragkiskos Malliaros, Christos Giatsidis, et al.. MATI: An efficient algorithm for influence maximization in social networks. PLoS ONE, Public Library of Science, 2018. ⟨hal-01950273⟩

Share

Metrics

Record views

85

Files downloads

92