Generic placeholder image

Recent Advances in Computer Science and Communications

Editor-in-Chief

ISSN (Print): 2666-2558
ISSN (Online): 2666-2566

Review Article

Influence Maximization on Social Networks: A Study

Author(s): Shashank S. Singh*, Kuldeep Singh, Ajay Kumar and Bhaskar Biswas

Volume 14, Issue 1, 2021

Published on: 17 April, 2019

Page: [13 - 29] Pages: 17

DOI: 10.2174/2213275912666190417152547

Price: $65

Abstract

Influence Maximization, which selects a set of k users (called seed set) from a social network to maximize the expected number of influenced users (called influence spread), is a key algorithmic problem in social influence analysis. In this paper, we give recent studies on influence maximization algorithms. The main goal of this survey is to provide recent studies and future research opportunities. We give taxonomy of influence maximization algorithms with the comparative theoretical analysis. This paper provides a theoretical analysis of influence maximization problem based on algorithm design perspective and also provides the performance analysis of existing algorithms.

Keywords: Influence maximization, social networks, information diffusion, viral marketing, profit maximization, revenue maximization.

Graphical Abstract


Rights & Permissions Print Cite
© 2024 Bentham Science Publishers | Privacy Policy