No Thumbnail Available

Influence Maximization through social networks and its Applications

(2018)

Files

Montoisy_59111000_2018.pdf
  • Open access
  • Adobe PDF
  • 932.31 KB

Details

Supervisors
Faculty
Degree label
Abstract
The present master thesis firstly describes the spread maximization problem and its computational complexity. Due to this hardness, the best seed set of nodes cannot be found directly, especially for huge networks. Hence heuristics have to be created and used. The goal of our thesis is to compare the performances (in terms of effectiveness and efficiency) of different heuristics on finding the best seed set of nodes in order to maximize the final influence spread on real social networks. Based on our findings, further applications are discussed at the end of this paper.