Competitive Influence Minimization in Multi-Group Social Networks: An Opinion-Based Solution

Abstract

Misinformation control has been a vibrant subject of research in online social networks (OSNs). With the diversity of OSNs, we observe that the emergence of group has also notably increased the exposure rate of misinformation. In the process of misinformation dissemination, the opinions adopted by an individual not only depend on the choices made by individuals’ peers, but also highly depend on the individuals’ own knowledge. However, we find that individuals’ opinions are not consistent in the misinformation dissemination, and they are transferred dynamically. Motivated by these facts, we do some novel works on the problem of competitive influence minimization in multi-group OSNs. Firstly, we propose a novel dynamic competitive diffusion model. Secondly, a spontaneous mechanism and a contact mechanism are introduced to analyze users’ opinion transfer processes, based on probabilistic discrete-time Markov chains. Thirdly, in order to make negative opinions be minimized, we use this model to work on a new Opinion Minimization (OM) problem. To quantitatively analyze this problem, a greedy algorithm of Equilibrium Opinion Minimization (EOM) is performed to select seed nodes. Furthermore, the experiments show that our proposed EOM algorithm outperforms the state of the arts, e.g., classical heuristic algorithms and local greedy algorithms of Influence Minimization in terms of minimizing opinion in steady-state opinion distribution.