{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:15:03Z","timestamp":1775229303434,"version":"3.50.1"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["72074203"],"award-info":[{"award-number":["72074203"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2023,12,31]]},"abstract":"<jats:p>With the in-depth development of intelligent media technology, online and offline fusion, reality and virtual entanglement, information content generalization, the boundary between positive and negative information is blurred, all kinds of misinformation in the social network fission spread, and cyberspace governance has become a global consensus. In this article, we comprehensively consider the spread of misinformation in location-based interpersonal social network and online social network, and systematically tackle the novel problem of minimizing the influence of misinformation under individual protection strategies. We first analyze the complexity and modularity of the problem. Then, we leverage the Lov\u00e1sz extension to devise a nonsubmodular set function continuity approximate convex relaxation method, and develop an approximate projected subgradient procedure to obtain a solution with a factor approximate guarantee. Finally, experiments on three assembled real-world datasets demonstrate the effectiveness and feasibility of our designed method and developed the algorithm.<\/jats:p>","DOI":"10.1145\/3578936","type":"journal-article","created":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T13:54:10Z","timestamp":1672754050000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Misinformation Blocking Problem in Virtual and Real Interconversion Social Networks"],"prefix":"10.1145","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0054-2323","authenticated-orcid":false,"given":"Peikun","family":"Ni","sequence":"first","affiliation":[{"name":"University of Chinese Academy of Sciences, Shijingshan Qu, Beijing Shi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8147-8254","authenticated-orcid":false,"given":"Jianming","family":"Zhu","sequence":"additional","affiliation":[{"name":"University of Chinese Academy of Sciences, Shijingshan Qu, Beijing Shi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5584-6164","authenticated-orcid":false,"given":"Guoqing","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Chinese Academy of Sciences, Shijingshan Qu, Beijing Shi, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,3]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/KBEI.2019.8734920"},{"key":"e_1_3_2_3_2","unstructured":"Foundations and Trends\u00ae in Machine Learning"},{"key":"e_1_3_2_4_2","article-title":"Greed is still good: Maximizing monotone submodular+supermodular functions","author":"Bai Wenruo","year":"2018","unstructured":"Wenruo Bai and Jeffrey A. Bilmes. 2018. Greed is still good: Maximizing monotone submodular+supermodular functions. International Conference on Machine Learning. PMLR, (2018), 304--313.","journal-title":"International Conference on Machine Learning"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1121\/1.1906679"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1509\/jmkr.48.5.869"},{"key":"e_1_3_2_7_2","unstructured":"Llenas Bryan. 2019. CDC: Record measles outbreak fueled by anti-vaccination propaganda. Retrieved from https:\/\/www.foxnews.com\/health\/cdc-record-measles-outbreak-fueled-by-anti-vaccination-propaganda."},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963499"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2019.2944120"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020579"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797315306"},{"issue":"3","key":"e_1_3_2_12_2","first-page":"1","article-title":"Approximate submodularity and its applications: Subset selection, sparse approximation and dictionary selection","volume":"19","author":"Das Abhimanyu","year":"2018","unstructured":"Abhimanyu Das and David Kempe. 2018. Approximate submodularity and its applications: Subset selection, sparse approximation and dictionary selection. Journal of Machine Learning Research 19, 3 (2018), 1\u201334.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/ANTS.2017.8384117"},{"key":"e_1_3_2_14_2","unstructured":"Shaddin Dughmi. 2009. Submodular functions: Extensions distributions and algorithms. A survey. arXiv:0912.0322. Retrieved from https:\/\/arxiv.org\/abs\/0912.0322."},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1002\/poi3.239"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106693"},{"key":"e_1_3_2_17_2","first-page":"3961","volume-title":"Proceedings of the 37th International Conference on Machine Learning","volume":"119","author":"Halabi Marwa El","year":"2020","unstructured":"Marwa El Halabi and Stefanie Jegelka. 2020. Optimal approximation for unconstrained non-submodular minimization. In Proceedings of the 37th International Conference on Machine Learning. Hal Daum\u00e9 III and Aarti Singh (Eds.), Proceedings of Machine Learning Research, Vol. 119, PMLR, 3961\u20133972."},{"key":"e_1_3_2_18_2","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/978-3-030-36711-4_52","volume-title":"Neural Information Processing","author":"Hosni Adil Imad Eddine","year":"2019","unstructured":"Adil Imad Eddine Hosni, Kan Li, and Sadique Ahmad. 2019. DARIM: Dynamic approach for rumor influence minimization in online social networks. In Neural Information Processing. T. Gedeon, K. Wong, and M. Lee (Eds.), Springer International Publishing, Cham, 619\u2013630."},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.10.063"},{"key":"e_1_3_2_20_2","doi-asserted-by":"crossref","unstructured":"Adil Imad Eddine Hosni Kan Li Cangfeng Ding and Sadique Ahmed. 2018. Least cost rumor influence minimization in multiplex social networks. In Neural Information Processing . L. Cheng A. Leung and S. Ozawa (Eds.) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) Vol. 11306. LNCS Springer Cham 93\u2013105. DOI: 10.1007\/978-3-030-04224-0_9","DOI":"10.1007\/978-3-030-04224-0_9"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-150801"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_23_2","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/978-3-642-37210-0_40","volume-title":"Social Computing, Behavioral-Cultural Modeling and Prediction","author":"Lesser Ofrit","year":"2013","unstructured":"Ofrit Lesser, Lena Tenenboim-Chekina, Lior Rokach, and Yuval Elovici. 2013. Intruder or welcome friend: Inferring group membership in online social networks. In Social Computing, Behavioral-Cultural Modeling and Prediction. A. M. Greenberg, W. G. Kennedy, and N. D. Bos (Eds.), Springer Berlin Heidelberg, Berlin, 368\u2013376."},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/1463434.1463477"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2021.3059430"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-022-03798-5"},{"key":"e_1_3_2_28_2","volume-title":"The PageRank Citation Ranking: Bringing Order to the Web.","author":"Page Lawrence","year":"1999","unstructured":"Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. 1999. The PageRank Citation Ranking: Bringing Order to the Web. Technical Report 1999-66. Stanford InfoLab. Previous number = SIDL-WP-1999-0120."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-019-00439-5"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1089\/cyber.2010.0161"},{"key":"e_1_3_2_31_2","unstructured":"Complexity of Computer Computations 1972"},{"key":"e_1_3_2_32_2","first-page":"363","article-title":"Mitigating Misinformation in online social network with top-k debunkers and evolving user opinions","author":"Saxena Akrati","year":"2020","unstructured":"Akrati Saxena, Wynne Hsu, Mong Li Lee, Hai Leong Chieu, Lynette Ng, and Loo Nin Teow. 2020. Mitigating Misinformation in online social network with top-k debunkers and evolving user opinions. In Proceedings of the Companion of the World Wide Web Conference. 363\u2013370.","journal-title":"Proceedings of the Companion of the World Wide Web Conference"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1177\/0038038588022001007"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.5555\/3585"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-0111-1_18"},{"key":"e_1_3_2_36_2","first-page":"463","article-title":"On adaptive influence maximization under general feedback models","author":"Tong Guangmo","year":"2020","unstructured":"Guangmo Tong and Ruiqi Wang. 2020. On adaptive influence maximization under general feedback models. IEEE Transactions on Emerging Topics in Computing 10, 1 (2020), 463\u2013475.","journal-title":"IEEE Transactions on Emerging Topics in Computing"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.122240"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2019.2903272"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3301302"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47401-3_9"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2015.2394793"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2021.3073064"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.04.086"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3578936","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3578936","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:53Z","timestamp":1750183733000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3578936"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3]]},"references-count":42,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12,31]]}},"alternative-id":["10.1145\/3578936"],"URL":"https:\/\/doi.org\/10.1145\/3578936","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3]]},"assertion":[{"value":"2022-06-20","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-12-27","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}