Elsevier

Future Generation Computer Systems

Volume 86, September 2018, Pages 1491-1502
Future Generation Computer Systems

Maximizing positive influence spread in online social networks via fluid dynamics

https://doi.org/10.1016/j.future.2017.05.050Get rights and content

Highlights

  • This paper proposes a novel influence spread model via the fluid dynamics theory.

  • We formulate the Maximizing Positive Influenced Users problem.

  • The Fluidspread greedy algorithm is presented which attempts the MPIU problem.

  • The experimental results reveal the time evolving dynamic influence process.

  • The experimental results show the effectiveness and efficiency of our algorithm.

Abstract

In online social networks, many application problems can be generalized as influence maximization problem, which targets at finding the top-k influential users. Most of the existing influence spread models ignore user’s attitude and interaction and cannot model the dynamic influence process. We propose a novel influence spread model called Fluidspread, using the fluid dynamics theory to reveal the time-evolving influence spread process. In this paper, we model the influence spread process as the fluid update process in three dimensions: the fluid height difference, the fluid temperature and the temperature difference. To the best of our knowledge, this is first attempt of using the fluid dynamics theory in this field. Moreover, we formulate the Maximizing Positive Influenced Users (MPIU) problem and design the Fluidspread greedy algorithm to solve it. Through the experimental results, we demonstrate the effectiveness and efficiency of our Fluidspread model and Fluidspread greedy algorithm.

Introduction

With the development of web technology and network infrastructure, Online Social Networks (OSNs) have become an integral part of every user’s daily life [1], [2]. The wide spread researches in influence and information propagation pave the way for a large amount of applications such as viral marketing [3], [4], [5], community formation, evolution and detection [6], outbreak detection [7] and many more. The key problem in this field is Influence Maximization (IM), which aims at finding the top-k influential users (seed users) from the social network. Firstly, most existing influence spread models did not consider the attitude of user. These models suppose users believe both the positive and negative information. Any kind of information can active the users, but it is not in line with practical situation. Then the existing models suppose the user always perceives the information from others, but he may just perceive the information from another user three-tenths of the chance. Thus, we need consider different attitudes and interactions in the influence spread process. Moreover, the previous models cannot reflect the dynamic influence spread process.

In reality, due to users’ preference, product quality or other reasons, people may have different attitudes towards an entity (products, news, etc.). For example, the users may have different attitudes (positive/neutral/negative) towards a message when the message appears in social network. It will also lead different interactions between users. Then the process of influence spread will become complicated. To overcome these challenges, our goal is selecting the top-k influential users to maximize the active users with positive attitude, rather than the overall active users. To better simulate the attitude variation and interaction process, we emphasize the time-evolving spread process using the fluid dynamics theory.

In the existing models, the most obvious problem lies in the simulation process of influence spread. The problem is three fold - (1) Lack of attitude: The previous works lack the capability to incorporate the emergence and propagation of attitudes into the influence diffusion process. Each user is supposed to be positive contribute to the influence spread without the consideration of the user’s personal attitudes. But the user may be negative or neutral attitude towards the entity. (2) Lack of ability to capture interaction: The previous models ignore to distinguish which information can be perceived with the consideration of users’ interaction. Each user is supposed to perceive the information with the same probability, while the users may not perceive the information owing to the interaction between users. (3) Cannot model the dynamic process: The existing models suppose the active users have only one chance to activate the neighbor inactive users. And the users in active state cannot turn to inactive state, but these assumptions are not true in real situation. Actually the influence always exists, and the process of influence is a continuous process. To better illustrate these problems, we provide a sample example shown in Fig. 1.

Example 1

Fig. 1 shows a snapshot of social network consisting five nodes. The parameterpAB denotes the influence probability from node A to B. The parameterϕAB denotes the interaction probability between node A and B. We can obtain that node B and D follow node A, node A and node D follow node C, node B and D follow node E. The number in the node denotes the attitude (a) towards an entity, ranges in [−1, 1]. The value ofa greater than zero denotes the node has positive attitude, then less than zero means the node has negative attitude. The specific values denote the attitude strength. Thus,aA=0.6 means node A has positive attitude.aD=0 means node D has neutral attitude, andaE=0.3 denotes node E has negative attitude. The other nodes can be calculated in a similar way.

On the basis of above discussion, we propose a novel Fluidspread mechanism via the theory of fluid dynamics, which can model the time-evolving influence spread process. Our Fluidspread mechanism can capture attitude variation and the interaction between users, which matches the real situation better. We formulate the problem of Maximizing Positive Influenced Users (MPIU) and design an efficient algorithm to solve it. We try to maximize the active users with positive attitude in the process of influence spread, rather than the overall active users.

Based on the fluid dynamics theory, we model the influence spread process as a fluid dynamic system. We use a container with enough volume to denote each user. The volume of fluid in the container denotes the user’s influence strength. Each edge corresponds to the pipe that connects two containers. We install each pipe at the bottom of the container, and we set a valve in each pipe. The connectivity of each pipe is decided by the influence probability and interaction probability. We can capture the process of influence spread as the flowed fluid in three dimensions: the fluid height difference between two containers is taken as the influence probability, the temperature of fluid in each container is deemed as the user’s attitude, and the fluid temperature difference between two containers can be denoted as the interaction probability. Moreover, we set a plug at the bottom of the container, through which the fluid will leak a little. This reflects users’ influences will gradually discount over time. Fig. 2 illustrates the mapping relationship from the features of influence spread to the fluid dynamic system.

In the Fluidspread model, each container has some fluids, and the fluids flow originate from the seed containers. When the temperature difference and the height difference both satisfy the conditions of fluid flowing, then the fluids can flow from one container to another. And the fluids in the lower fluid height container will be mixed with the flowed fluids. Thus, the fluid temperature will be updated which reflects the time-evolving process of users’ attitude variation. But we should restore the volume of fluids in the containers to the previous situation at the end of each update round. Because the strength of users’ influences cannot be changed during influence propagation process in the real-world situation. We apply a discretized method to measure the variation of each container’s fluids over time. The results of influence spread are based on the collection of sampled fluid temperatures.

To summarize, we present our main contributions as follows.

  • We propose a novel Fluidspread mechanism to simulate the influence spread process using the fluid dynamics theory. This may be the first attempt in the field of influence spread. We emphasize the features of influence spread: the influence probability, the user’s attitude and the interaction probability. The influence spread process is modeled as the fluid update in three dimensions: the fluid height difference, the fluid temperature and the fluid temperature difference.

  • We formulate the problem of Maximizing Positive Influenced Users (MPIU) and design the Fluidspread greedy algorithm to solve it. We aim at identifying the seed users can maximize the spread of positive active state. Corresponding to the Fluidspread model, we apply the fluid update process to model the influence spread. In this way, the influence spread process can be modeled naturally and gracefully.

  • We conduct the experiments on four real world datasets. We calculate the range of influence spread with/without the consideration of user’s attitudes, compare the running time with other existing algorithms, and measure the variation of users’ attitudes and states. Through the experimental results, we demonstrate the effectiveness and efficiency of the Fluidspread model and algorithm. And the results reveal the time-evolving dynamic influence process.

The rest of this paper is organized as follows: we review the related works in Section 2. We present the statement of problem in Section 3. Section 4 shows the Fluidspread framework. We describe the details of Fluidspread mechanisms in Section 5. We present the experimental results in Section 6. Finally, we conclude our work and provide the future direction in Section 7.

Section snippets

Related work

The previous works have extensively studied the Influence Maximization (IM) problem over the past years. The typical solutions can be classified into two categories: the greedy algorithms [3], [4], [6], [8], [5], [9], [10], [11], [12] and the heuristic algorithms [13], [14], [15], [16], [17]. Our Fluidspread greedy algorithm can be taken as the hybrid of greedy and heuristic algorithm. We briefly review the related work in this section.

Problem statement

In this section, we introduce the definitions in the influence spread process. Then, we provide the statement of problem. We summary the primary notations used in this paper as Table 1.

Definition 1 Seed node

In the social networkG(V,E), the influence spread originates from the nodevV. The nodev is called the seed node, and we use the notationS to denote the set of seed node.

Definition 2 Attitude

In the social networkG(V,E), the nodevV holds different attitudes to an entity [27]. The different attitude should be considered in the

Fluidspread framework

First, we introduce the influence spread principles and the initialization process. Then we provide the solution overview of the Fluidspread model. Finally, we present the details of Fluidspread model setup.

Fluidspread mechanisms

In this section, we introduce the details of Fluidspread mechanisms, which contains three major parts: the dynamic updating process, the statistic updated results and the sample examples. The first part introduces the process of fluid update. Then, we can count the updated results of the fluid temperature. Finally, the sample example can be counted to obtain the final state of containers. Algorithm 2 shows the details of fluid update process. The Fluidspread model calculates the variation of

Experiment design

We introduce the details of experiments includes the dataset, the experimental method, the comparison models and the experimental setup.

Conclusion

Modeling the influence spread process aims to find the most influential users. To precisely capture users’ attitude, interactions, and dynamic influence process, we proposed a novel Fluidspread model using the fluid dynamics theory in this paper. The fluid bears three dimensions of the influence spread: the fluid height difference is taken as the influence probability, the fluid temperature is deemed as the user’s attitude, and the fluid temperature difference can be denoted as the interaction

Acknowledgments

This work is supported in part by the National Natural Science Foundation of China under Grant Numbers 61632009, 61472451 and 61502161, and the High Level Talents Program of Higher Education in Guang dong Province under Funding Support Number 2016ZJ01.

Feng Wang is currently a Ph.D. student of School Computer Science and Technology from School of Information Science and Engineering, Central South University. His research interests include social network analysis, social influence evaluation models and algorithms, recommendation systems.

References (33)

  • Facebook Stats, 2016....
  • Twitter Usage, 2016....
  • ChenW. et al.

    Efficient influence maximization in social networks

  • ChenW. et al.

    Scalable influence maximization in social networks under the linear threshold model

  • ChenW. et al.

    Scalable influence maximization for prevalent viral marketing in large scale social networks

  • WangY. et al.

    Community-based greedy algorithm for mining top-k influential nodes in mobile social networks

  • LeskovecJ. et al.

    Cost-effective outbreak detection in networks

  • KempeD. et al.

    Maximizing the spread of influence through a social network

  • WangF. et al.

    Maximizing the spread of positive influence under LT-MLA model

  • ZhangH. et al.

    Maximizing the spread of positive influence in online social networks

  • Hosseini-PozvehM. et al.

    Maximizing the spread of positive influence in signed social networks

    Intell. Data Anal.

    (2016)
  • HeJ.S. et al.

    Positive opinion influential node set selection for social networks: considering both positive and negative relationships

  • A. Goyal, W. Lu, L.V.S. Lakshmanan, SIMPATH: An efficient algorithm for influence maximization under the linear...
  • C. Zhou, P. Zhang, et al., UBLF: An upper bound based approach to discover influential nodes in social networks, in:...
  • PalS.K. et al.

    Centrality measures, upper bound, and influence maximization in large scale directed social networks

    Fund. Inform.

    (2014)
  • K. Jung, W. Heo, W. Chen, IRIE: Scalable and robust influence maximization in social networks, in: ICDM, 2011, pp....
  • Cited by (0)

    Feng Wang is currently a Ph.D. student of School Computer Science and Technology from School of Information Science and Engineering, Central South University. His research interests include social network analysis, social influence evaluation models and algorithms, recommendation systems.

    Wenjun Jiang received the bachelor’s degree in computer science from Hunan University, PR China, in 2004, the master’s degree in computer software and theory from the Huazhong University of Science and Technology, PR China, in 2007, and the doctorate degree in computer software and theory from Central South University, PR China, in 2014. She has been a visiting Ph.D. student at Temple University for two years. Currently, she is an assistant professor at Hunan University. Her research interests include trust and social influence evaluation models and algorithms in online social networks, recommendation systems, and social network analysis.

    Xiaolin Li received the Ph.D. degree in computer engineering from Rutgers University. He is an associate professor in the Department of Electrical and Computer Engineering, University of Florida. His research interests include parallel and distributed systems, cyber–physical systems, and security & privacy. He is directing the Scalable Software Systems Laboratory (S3Lab). He received the US National Science Foundation (NSF) Career Award in 2010, Internet2 Innovative Application Award in 2013, and Best Paper Awards in ACM CAC 2013 and IEEE UbiSafe 2007. He is a member of the IEEE.

    Guojun Wang received the B.Sc. degree in geophysics, in 1992, the M.Sc. degree in computer science, in 1996, and the PhD degree in computer science, in 2002, all from Central South University, Changsha, China. He is a Pearl River Scholar Distinguished Professor of the School of Computer Science and Educational Software at Guangzhou University. He was a Professor at Central South University, China, an Adjunct Professor at Temple University, USA, a Visiting Scholar at Florida Atlantic University, USA, a Visiting Researcher at the University of Aizu, Japan, and a Research Fellow at the Hong Kong Polytechnic University. His research interests include network and information security, Internet of things, and cloud computing. He is a Distinguished Member of CCF and a member of IEEE, ACM, and IEICE.

    View full text