TY - GEN
T1 - Influence maximization in social networks with user attitude modification
AU - Li, Songsong
AU - Zhu, Yuqing
AU - Li, Deying
AU - Kim, Donghyun
AU - Ma, Huan
AU - Huang, Hejiao
PY - 2014
Y1 - 2014
N2 - The aim of influence maximization problem is to find a fc-size seed set that has the maximum influence. In previous works the modification of user's attitude is seldom paid attention to. However from the psychology research, we know that people's opinions are affected by their friends. Base on this, we present a new Linear Threshold model with Instant Opinions (LT-IO). We devise an attitude function Atu that describes node u's attitude at time t, and the broadcast attitude which is the attitude when a node becomes active. To simulate information propagation in real world, we define a trust threshold η to justify whether a node follows or opposes the influence from its neighbor. We propose a heuristic algorithm IMLT-IOA to solve our problem, prove its submodularity and monotonicity and then obtain its approximation ratio which is (1 - 1/e). To the best of our knowledge, this is the first work that focuses on the influence maximization with user's attitude modification. To verify our IMLT-IOA algorithm, we conduct extensive experiments on a large data collection obtained from real social networks, the results show that IMLT-IOA reduces the running time and meanwhile keeps effectiveness comparing to other algorithms.
AB - The aim of influence maximization problem is to find a fc-size seed set that has the maximum influence. In previous works the modification of user's attitude is seldom paid attention to. However from the psychology research, we know that people's opinions are affected by their friends. Base on this, we present a new Linear Threshold model with Instant Opinions (LT-IO). We devise an attitude function Atu that describes node u's attitude at time t, and the broadcast attitude which is the attitude when a node becomes active. To simulate information propagation in real world, we define a trust threshold η to justify whether a node follows or opposes the influence from its neighbor. We propose a heuristic algorithm IMLT-IOA to solve our problem, prove its submodularity and monotonicity and then obtain its approximation ratio which is (1 - 1/e). To the best of our knowledge, this is the first work that focuses on the influence maximization with user's attitude modification. To verify our IMLT-IOA algorithm, we conduct extensive experiments on a large data collection obtained from real social networks, the results show that IMLT-IOA reduces the running time and meanwhile keeps effectiveness comparing to other algorithms.
KW - Approximation algorithm
KW - Attitude modification
KW - Influence maximization
UR - https://www.scopus.com/pages/publications/84907005515
U2 - 10.1109/ICC.2014.6883932
DO - 10.1109/ICC.2014.6883932
M3 - 会议稿件
AN - SCOPUS:84907005515
SN - 9781479920037
T3 - 2014 IEEE International Conference on Communications, ICC 2014
SP - 3913
EP - 3918
BT - 2014 IEEE International Conference on Communications, ICC 2014
PB - IEEE Computer Society
T2 - 2014 1st IEEE International Conference on Communications, ICC 2014
Y2 - 10 June 2014 through 14 June 2014
ER -