A Review on Models and Algorithms to Achieve Influence Maximization in Social Networks

H  Jayamangala    and Ananthi Sheshasaayee

doi:10.17485/ijst/2015/v8i29/86272

Article

A Review on Models and Algorithms to Achieve Influence Maximization in Social Networks

VIEWS 633
PDF 199

Abstract
Full-Text HTML
Full-Text PDF
How to Cite

Indian Journal of Science and Technology

DOI: 10.17485/ijst/2015/v8i29/86272

Year: 2015, Volume: 8, Issue: 29, Pages: 1-4

Original Article

A Review on Models and Algorithms to Achieve Influence Maximization in Social Networks

H. Jayamangala^{1 *} and Ananthi Sheshasaayee²

¹Periyar University, Salem – 636001, Tamil Nadu, India; [email protected]
² PG and Research Department of Computer Science, Quaid-e-Millath Government College for Women (Autonomous), Chennai – 600002, Tamil Nadu, India; [email protected]

This work is licensed under a Creative Commons Attribution 4.0 International License.

Abstract

A major research problem in online social network is Influential node identification which has large number of ties in the network. Influence maximization finds an influential node and maximizes information diffusion. Organizations started to use information diffusion feature in marketing to improve their product promotion. To achieve influence maximization approximation algorithms and diffusion models are widely used. The existing methods consider degree and structure of the network in influential node identification. Most of the existing works consider number of nearest neighbors, user’s connectivity based on user’s rating. Influential nodes are mainly used in marketing and also used in various applications such as public opinion, healthcare, communication, education, agriculture, and epidemiology.
Keywords: Influence Maximization, Influential Node, Social Networks