Next Article in Journal
An Improved Approach for Text Sentiment Classification Based on a Deep Neural Network via a Sentiment Attention Mechanism
Previous Article in Journal
A Review of Machine Learning and IoT in Smart Transportation
Article Menu
Issue 4 (April) cover image

Export Article

Open AccessArticle

Influence Maximization in Social Network Considering Memory Effect and Social Reinforcement Effect

1
Department of Information Science and Engineering, Shandong Normal University, Jinan 250357, China
2
Department of Information Science and Electrical Engineering, Shandong Jiaotong University, Jinan 250357, China
3
Department of Accounting, Shandong Institute of Management, Jinan 250357, China
*
Author to whom correspondence should be addressed.
Future Internet 2019, 11(4), 95; https://doi.org/10.3390/fi11040095
Received: 13 February 2019 / Revised: 31 March 2019 / Accepted: 8 April 2019 / Published: 11 April 2019
(This article belongs to the Special Issue Multi-Agent Systems for Social Media Analysis)
  |  
PDF [1979 KB, uploaded 25 April 2019]
  |  

Abstract

Social networks have attracted a lot of attention as novel information or advertisement diffusion media for viral marketing. Influence maximization describes the problem of finding a small subset of seed nodes in a social network that could maximize the spread of influence. A lot of algorithms have been proposed to solve this problem. Recently, in order to achieve more realistic viral marketing scenarios, some constrained versions of influence maximization, which consider time constraints, budget constraints and so on, have been proposed. However, none of them considers the memory effect and the social reinforcement effect, which are ubiquitous properties of social networks. In this paper, we define a new constrained version of the influence maximization problem that captures the social reinforcement and memory effects. We first propose a novel propagation model to capture the dynamics of the memory and social reinforcement effects. Then, we modify two baseline algorithms and design a new algorithm to solve the problem under the model. Experiments show that our algorithm achieves the best performance with relatively low time complexity. We also demonstrate that the new version captures some important properties of viral marketing in social networks, such as such as social reinforcements, and could explain some phenomena that cannot be explained by existing influence maximization problem definitions. View Full-Text
Keywords: influence maximization; viral marketing; social network analysis influence maximization; viral marketing; social network analysis
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Wang, F.; Zhu, Z.; Liu, P.; Wang, P. Influence Maximization in Social Network Considering Memory Effect and Social Reinforcement Effect. Future Internet 2019, 11, 95.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Future Internet EISSN 1999-5903 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top