Abstract

This paper focuses on the targeted influence maximization based on cloud computing in social networks. Most of existing influence maximization works assume that the influence diffusion probabilities on edges are fixed, and identify the Top-k users to maximize the spread of influence assuming the knowledge of the entire network graph. However, in real-world scenarios, edge probabilities are typically different based on various topics, and may be affected by information received. Meanwhile, obtaining complete network data is difficult due to privacy and computational considerations. Moreover, existing influence maximization algorithms considering target users do not discuss cloud computing which lead to low computational efficiency when dealing with big datasets in social networks. To this end, this paper proposes a targeted influence maximization solution based on cloud computing. First, a new topic-aware model called tag-aware IC model is presented, which takes into account users' interests, characteristics of the item being propagated, and the similarity between users and the related information. Then, efficient algorithms with approximation guarantee are provided using a bounded number of queries to the graph structure. These methods aim to find a seed set that maximizes the expected influence spread over target users who are relevant to given topics. Finally, empirical studies of the proposed algorithms are designed and performed on real datasets. The experimental results show that the techniques in this paper achieves speedup and savings in storage compared with the state-of-the-art methods.

Highlights

  • Online social networks play a critical role in the spread of information, ideas, and influence among people in their modern life [1]–[6]

  • This paper considers the targeted influence maximization based on cloud computing

  • As obtaining full knowledge of the network structure is very costly in practice, a targeted sketching technique is presented based on partial network information

Read more

Summary

INTRODUCTION

Online social networks play a critical role in the spread of information, ideas, and influence among people in their modern life [1]–[6]. With a fixed budget on the number of selections, a marketer aims to maximize the number of customers adopt the product This is the classical influence maximization problem [7]–[13]. In an online social network, e.g., Weibo, each user is associated with several tags, which represent one’s interests. These tags can be obtained based on hashtags and representative keywords from the contents. Motivated by the above observations, this paper focuses on targeted influence maximization with partial network information based on cloud computing.

RELATED WORK
IC MODEL
TAG-AWARE IC MODEL
ALGORITHMS FOR TARGETED INFLUENCE MAXIMIZATION
EXPERIMENTAL ANALYSIS
CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call