Detection and Minimization Influence of Rumor in Social Network

Abstract

With the fast development of big scale on-line social networks, on-line data sharing is becoming omnipresent daily. Numerous info is propagating through on-line social networks similarly as every the positive and negative. Throughout this paper, we tend to tend to focus on the negative data problems just like the on-line rumors. Rumor block may well be a significant drawback in large-scale social networks. Malicious rumours might cause chaos in society and sought to be blocked as soon as potential once being detected. during this paper, we tend to propose a model of dynamic rumor influence reduction with user expertise (DRIMUX).Our goal is to cut back the influence of the rumor (i.e., the number of users that have accepted and sent the rumor) by block an exact set of nodes. A dynamic Ising propagation model considering every the worldwide quality and individual attraction of the rumor is given supported realistic state of affairs. To boot, altogether completely different from existing problems with influence reduction, we tend to tend to require into thought the constraint of user experience utility. Specifically, each node is assigned a tolerance time threshold. If the block time of each user exceeds that threshold, the utility of the network will decrease. Underneath this constraint, we tend to tend to then formulate draw back as a network abstract thought drawback with survival theory, and propose solutions supported most probability principle. Experiments area unit implemented supported large-scale world networks and validate the effectiveness of our methodology.