Please use this identifier to cite or link to this item:
Title: Influence maximisation in social networks
Authors: Tejaswi, V.
Bindu, P.V.
Santhi Thilagam, P.
Issue Date: 2019
Citation: International Journal of Computational Science and Engineering, 2019, Vol.18, 2, pp.103-117
Abstract: Influence maximisation is one of the significant research areas in social network analysis. It helps in identifying influential entities from social networks that can be used in marketing, election campaigns, outbreak detection and so on. Influence maximisation deals with the problem of finding a subset of nodes called seeds in the social network such that these nodes will eventually spread maximum influence in the network. This is an NP-hard problem. The aim of this paper is to provide a complete understanding of the influence maximisation problem. This paper focuses on providing an overview on the influence maximisation problem, and covers three major aspects: 1) different types of inputs required; 2) influence propagation models that map the spread of influence in the network; 3) the approximation algorithms proposed for seed set selection. In addition, we provide the state of the art and describe the open problems in this domain. Copyright 2019 Inderscience Enterprises Ltd.
Appears in Collections:1. Journal Articles

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.