TY - JOUR
T1 - User recommendation for promoting information diffusion in social networks
AU - Li, Dong
AU - Wang, Wei
AU - Jin, Changlong
AU - Ma, Jun
AU - Sun, Xin
AU - Xu, Zhiming
AU - Li, S.
AU - LIU, Jiming
N1 - Funding Information:
This work is funded by the National Natural Science Foundation of China (No. 61702138 and No. 61602128 and No. 61672322 and No. 61672185 ), the Natural Science Foundation of Shandong Province, China (No. ZR2016FQ13 and No. ZR2014FM004 ), the China Postdoctoral Science Foundation (No. 2017M621275 and No. 2018T110301 ), the Young Scholars Program of Shandong University, Weihai, China (No. 1050501318006 ), the Hong Kong Scholar Project of China (No. ALGA4131016116 ).
PY - 2019/11/15
Y1 - 2019/11/15
N2 - Online social networks mainly hold two functions: social interaction and information diffusion. Most of existing user recommendation studies only focused on enhancing the social interaction function, but ignored the problem of how to strengthen the information diffusion function. Aiming at this drawback, this paper introduces the concept of user diffusion degree, then combines it with traditional recommendation methods for reranking recommended users. Specifically, we propose two user diffusion degree calculation methods, node granularity algorithm and community granularity algorithm, which fully exploit the community attributes of users. Experimental results on Email and Amazon datasets under Independent Cascade Model illustrate that our methods noticeably outperform traditional recommendation methods in terms of promoting information diffusion. We also find that node granularity algorithm performs better in spares networks, while community granularity algorithm is more suitable for dense networks.
AB - Online social networks mainly hold two functions: social interaction and information diffusion. Most of existing user recommendation studies only focused on enhancing the social interaction function, but ignored the problem of how to strengthen the information diffusion function. Aiming at this drawback, this paper introduces the concept of user diffusion degree, then combines it with traditional recommendation methods for reranking recommended users. Specifically, we propose two user diffusion degree calculation methods, node granularity algorithm and community granularity algorithm, which fully exploit the community attributes of users. Experimental results on Email and Amazon datasets under Independent Cascade Model illustrate that our methods noticeably outperform traditional recommendation methods in terms of promoting information diffusion. We also find that node granularity algorithm performs better in spares networks, while community granularity algorithm is more suitable for dense networks.
KW - Diffusion degree
KW - Information diffusion
KW - Social network
KW - User recommendation
UR - http://www.scopus.com/inward/record.url?scp=85070684604&partnerID=8YFLogxK
U2 - 10.1016/j.physa.2019.121536
DO - 10.1016/j.physa.2019.121536
M3 - Journal article
AN - SCOPUS:85070684604
SN - 0378-4371
VL - 534
JO - Physica A: Statistical Mechanics and its Applications
JF - Physica A: Statistical Mechanics and its Applications
M1 - 121536
ER -