A Stochastic Algorithm Based on Reverse Sampling Technique to Fight Against the Cyberbullying

Cyberbullying has caused serious consequences especially for social network users in recent years. However, the challenge is how to fight against the cyberbullying effectively from the algorithmic perspective. In this article, we study the fighting against the cyberbullying problem, i.e., identify an initialwitness setwith a budget to spread the positive influence to protect the users in a specific target set such that the number of cybervictim users in the target set being activated by the seed set of cyberbullying is minimized. We first formulate this problem and show its NP-hardness. We further prove that the objective function is submodular with respect to the size of witnesses set when we convert the original problem into the maximal version. Then we propose a stochastic approach to solve this maximal version problem based on the Reverse Sampling Technique with a constant factor guarantee. In addition, we provide theoretical analysis and discuss the relationship between the optimal value and the value returned by the proposed algorithm. To evaluate the proposed approach, we implement extensive experiments on synthetic and real datasets. The experimental results showour approach is superior to the comparison methods.

Automated summary

The article explores how to effectively combat cyberbullying from an algorithmic perspective and proposes a stochastic approach to solve the problem. Theoretical analysis and experiments demonstrate that the proposed method is superior to comparison methods.