TY - JOUR
T1 - Grassroots VS elites
T2 - Which ones are better candidates for influence maximization in social networks?
AU - Li, Dong
AU - Wang, Wei
AU - LIU, Jiming
N1 - Funding Information:
This work is funded by the National Natural Science Foundation of China (No. 61702138 and No. 61602128 ), the Natural Science Foundation of Shandong Province (No. ZR2016FQ13 ), the China Postdoctoral Science Foundation (No. 2017M621275 and No. 2018T110301 ), the Young Scholars Program of Shandong University, Weihai (No. 1050501318006), the Hong Kong Scholar Project of China (No. ALGA4131016116).
PY - 2019/9/17
Y1 - 2019/9/17
N2 - How to select a set of seed users under a limited budget from the social networks to maximize information/influence diffusion is a critical task in the social computing filed, called as influence maximization (IM) problem. Existing studies usually seek users with high influence (“elites”) as seeds. Each selected elite user can take a large influence increment, however, s/he also consumes a high cost (e.g. money). In the time of Web 2.0, ordinary users (“grassroots”) become the main body of the internet and online society, instead of elites. Therefore, we consider whether allocating proportionally the cost of one elite to several grassroots to promote information diffusion can achieve a greater diffusion performance. Following this mind, we propose an alternative solution for the IM problem that attempts to select ordinary grassroots as seeds in this paper. Specifically, we first empirically prove that grassroots are better choices than elites in the IM problem from the aspects of relationship strengths and polarities, based on statistics and analysis of real datasets. Next, we develop a grassroots-oriented seed users seeking algorithm which fully explores the community information of the network structure. Comprehensive experiments on Epinions and Slashdot demonstrate the effectiveness and efficiency of our method.
AB - How to select a set of seed users under a limited budget from the social networks to maximize information/influence diffusion is a critical task in the social computing filed, called as influence maximization (IM) problem. Existing studies usually seek users with high influence (“elites”) as seeds. Each selected elite user can take a large influence increment, however, s/he also consumes a high cost (e.g. money). In the time of Web 2.0, ordinary users (“grassroots”) become the main body of the internet and online society, instead of elites. Therefore, we consider whether allocating proportionally the cost of one elite to several grassroots to promote information diffusion can achieve a greater diffusion performance. Following this mind, we propose an alternative solution for the IM problem that attempts to select ordinary grassroots as seeds in this paper. Specifically, we first empirically prove that grassroots are better choices than elites in the IM problem from the aspects of relationship strengths and polarities, based on statistics and analysis of real datasets. Next, we develop a grassroots-oriented seed users seeking algorithm which fully explores the community information of the network structure. Comprehensive experiments on Epinions and Slashdot demonstrate the effectiveness and efficiency of our method.
KW - Community
KW - Grassroots
KW - Influence maximization
KW - Polarity
KW - Strength
UR - http://www.scopus.com/inward/record.url?scp=85066248622&partnerID=8YFLogxK
U2 - 10.1016/j.neucom.2019.05.053
DO - 10.1016/j.neucom.2019.05.053
M3 - Journal article
AN - SCOPUS:85066248622
SN - 0925-2312
VL - 358
SP - 321
EP - 331
JO - Neurocomputing
JF - Neurocomputing
ER -