TY - GEN
T1 - An Efficient Algorithm for Clarification of Rumors with Limited Costs in Social Networks
AU - Yao, Xiaopeng
AU - Liang, Guangxian
AU - Huang, Hejiao
AU - Gu, Chonglin
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/12
Y1 - 2020/12
N2 - Nowadays, the information about COVID-19 is spreading widely on social networks while rumors about it are also propagating quickly. When users receive two opposing opinions, they are more likely to accept the information with greater impact. Therefore, there is an urgent need to clarify rumors. Given the cost Ctotal, the rumor clarifying problem aims to find a seed set with at most k users such that the total number of the users influenced by positive information can be maximized. In this paper, we propose a Cost-Randomized Greedy algorithm called CRG to solve the rumor clarifying problem. It runs in O((n-r)mC{total}), where n, m and r are the number of nodes, edges and the initial rumor nodes, respectively. Extensive contrast experiments on online networks show that our algorithm is much more efficient than the state-of-The art methods.
AB - Nowadays, the information about COVID-19 is spreading widely on social networks while rumors about it are also propagating quickly. When users receive two opposing opinions, they are more likely to accept the information with greater impact. Therefore, there is an urgent need to clarify rumors. Given the cost Ctotal, the rumor clarifying problem aims to find a seed set with at most k users such that the total number of the users influenced by positive information can be maximized. In this paper, we propose a Cost-Randomized Greedy algorithm called CRG to solve the rumor clarifying problem. It runs in O((n-r)mC{total}), where n, m and r are the number of nodes, edges and the initial rumor nodes, respectively. Extensive contrast experiments on online networks show that our algorithm is much more efficient than the state-of-The art methods.
KW - Clarify
KW - Negative credibility
KW - Positive credibility
KW - Rumor
KW - Social network
UR - https://www.scopus.com/pages/publications/85105290558
U2 - 10.1109/HPCC-SmartCity-DSS50907.2020.00048
DO - 10.1109/HPCC-SmartCity-DSS50907.2020.00048
M3 - 会议稿件
AN - SCOPUS:85105290558
T3 - Proceedings - 2020 IEEE 22nd International Conference on High Performance Computing and Communications, IEEE 18th International Conference on Smart City and IEEE 6th International Conference on Data Science and Systems, HPCC-SmartCity-DSS 2020
SP - 393
EP - 400
BT - Proceedings - 2020 IEEE 22nd International Conference on High Performance Computing and Communications, IEEE 18th International Conference on Smart City and IEEE 6th International Conference on Data Science and Systems, HPCC-SmartCity-DSS 2020
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 22nd IEEE International Conference on High Performance Computing and Communications, 18th IEEE International Conference on Smart City and 6th IEEE International Conference on Data Science and Systems, HPCC-SmartCity-DSS 2020
Y2 - 14 December 2020 through 16 December 2020
ER -