Misinformation Blocking Problem in Virtual and Real Interconversion Social Networks

7Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

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ász 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.

Cite

CITATION STYLE

APA

Ni, P., Zhu, J., & Wang, G. (2023). Misinformation Blocking Problem in Virtual and Real Interconversion Social Networks. ACM Transactions on Knowledge Discovery from Data, 17(6). https://doi.org/10.1145/3578936

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free