{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T06:58:25Z","timestamp":1775199505537,"version":"3.50.1"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T00:00:00Z","timestamp":1616716800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1907472"],"award-info":[{"award-number":["1907472"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071478, 11671400, 61972404, 61672524"],"award-info":[{"award-number":["12071478, 11671400, 61972404, 61672524"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2021,8,31]]},"abstract":"<jats:p>\n            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\n            <jats:italic>fighting against the cyberbullying<\/jats:italic>\n            problem, i.e., identify an initial witness set with 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\n            <jats:italic>Reverse Sampling Technique<\/jats:italic>\n            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 show our approach is superior to the comparison methods.\n          <\/jats:p>","DOI":"10.1145\/3441455","type":"journal-article","created":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T16:43:12Z","timestamp":1616776992000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["A Stochastic Algorithm\u00a0Based on Reverse Sampling Technique to Fight Against the Cyberbullying"],"prefix":"10.1145","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4825-5673","authenticated-orcid":false,"given":"Ruidong","family":"Yan","sequence":"first","affiliation":[{"name":"Inspur Electronic Information Industry Co., Ltd and Renmin University of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Li","sequence":"additional","affiliation":[{"name":"University of Texas at Tyler, Tyler, Texas, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deying","family":"Li","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongcai","family":"Wang","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuqing","family":"Zhu","sequence":"additional","affiliation":[{"name":"California State University at Los Angeles, Los Angeles, California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Texas at Dallas, Richardson, Texas"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,3,26]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-76941-7_11"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.70"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17572-5_48"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2007.11.001"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963499"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282100.1282167"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.118"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59065-9_20"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06483-3_25"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.34"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963217"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505571"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.40"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/01639620701457816"},{"key":"e_1_2_1_15_1","volume-title":"Patchin","author":"Hinduja Sameer","year":"2014","unstructured":"Sameer Hinduja and Justin W . Patchin . 2014 . Cyberbullying. Cyberbullying Research Center . Retrieved 7 September, 2015. --&gt; Sameer Hinduja and Justin W. Patchin. 2014. Cyberbullying. Cyberbullying Research Center. Retrieved 7 September, 2015. --&gt;"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/3099622.3099623"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623704"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the 23rd AAAI Conference on Artificial Intelligence.","volume":"8","author":"Kimura Masahiro","year":"2008","unstructured":"Masahiro Kimura , Kazumi Saito , and Hiroshi Motoda . 2008 . Minimizing the spread of contamination by blocking links in a network . In Proceedings of the 23rd AAAI Conference on Artificial Intelligence. Vol. 8 . 1175--1180. Masahiro Kimura, Kazumi Saito, and Hiroshi Motoda. 2008. Minimizing the spread of contamination by blocking links in a network. In Proceedings of the 23rd AAAI Conference on Artificial Intelligence. Vol. 8. 1175--1180."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850578.2850581"},{"key":"e_1_2_1_22_1","volume-title":"Identifying influential spreaders in complex networks based on gravity formula. Physica A: Statistical Mechanics and its Applications 451","author":"Ma Chuang","year":"2016","unstructured":"Ling-ling Ma, Chuang Ma , Hai-Feng Zhang , and Bing-Hong Wang . 2016. Identifying influential spreaders in complex networks based on gravity formula. Physica A: Statistical Mechanics and its Applications 451 ( 2016 ), 205--212. --&gt; Ling-ling Ma, Chuang Ma, Hai-Feng Zhang, and Bing-Hong Wang. 2016. Identifying influential spreaders in complex networks based on gravity formula. Physica A: Statistical Mechanics and its Applications 451 (2016), 205--212. --&gt;"},{"key":"e_1_2_1_23_1","volume-title":"Randomized Algorithms","author":"Motwani Rajeev","unstructured":"Rajeev Motwani and Prabhakar Raghavan . 1995. Randomized Algorithms . Cambridge University press . --&gt; Rajeev Motwani and Prabhakar Raghavan. 1995. Randomized Algorithms. Cambridge University press. --&gt;"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the 2016 International Conference on Management of Data. ACM, 695--710","author":"Nguyen Hung T.","unstructured":"Hung T. Nguyen , My T. Thai , and Thang N. Dinh . 2016. Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks . In Proceedings of the 2016 International Conference on Management of Data. ACM, 695--710 . Hung T. Nguyen, My T. Thai, and Thang N. Dinh. 2016. Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks. In Proceedings of the 2016 International Conference on Management of Data. ACM, 695--710."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of ASIS. 161--172","author":"Page Lawrence","year":"1998","unstructured":"Lawrence Page , Sergey Brin , Rajeev Motwani , and Terry Winograd . 1998 . The PageRank citation ranking: Bringing order to the web . In Proceedings of ASIS. 161--172 . --&gt; Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. 1998. The PageRank citation ranking: Bringing order to the web. In Proceedings of ASIS. 161--172. --&gt;"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1177\/1541204006286288"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2011.152"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.chb.2012.05.024"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983724"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593670"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8056957"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396795"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1099-0860.2009.00260.x"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/2908286.2908331"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2624734"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835935"},{"key":"e_1_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Chen Wei Laks V. S. Lakshmanan and Carlos Castillo. 2013. Information and Influence Propagation in Social Networks. Morgan & Claypool.  Chen Wei Laks V. S. Lakshmanan and Carlos Castillo. 2013. Information and Influence Propagation in Social Networks. Morgan & Claypool.","DOI":"10.2200\/S00527ED1V01Y201308DTM037"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1080\/15388220.2014.949377"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524472"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3441455","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3441455","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3441455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:03:05Z","timestamp":1750197785000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3441455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,26]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,8,31]]}},"alternative-id":["10.1145\/3441455"],"URL":"https:\/\/doi.org\/10.1145\/3441455","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,26]]},"assertion":[{"value":"2020-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}