Graph Convolutional Network-Based Rumor Blocking on Social Networks

ABSTRACT

Misinformation and rumors can spread rapidly and widely through online social networks, seriously endangering social stability. Therefore, rumor blocking on social networks has become a hot research topic. In the existing research, when users receive two opposing opinions, they tend to believe the one arrives first. In this article, we argue that users will dialectically trust the information based on their own opinions rather than the rule of first-come-first-listen. We propose a confidence-based opinion adoption (CBOA) model, which considers the opinion and confidence according to the traditional linear threshold (LT) model. Based on this model, we propose the directed graph convolutional network (DGCN) method to select the <inline-formula> <tex-math notation="LaTeX">$k$</tex-math> </inline-formula> most influential positive cascade nodes to suppress the propagation of rumors. Finally, we verify our method on four real network datasets. The experimental results show that our method can sufficiently suppress the propagation of rumors and obtains smaller number of rumor nodes than the baseline algorithms. IEEE