VNU-UET Repository: No conditions. Results ordered -Date Deposited. 2024-04-12T23:19:51ZEPrintshttp://eprints.uet.vnu.edu.vn/images/sitelogo.pnghttps://eprints.uet.vnu.edu.vn/eprints/2017-12-16T05:42:37Z2019-02-18T03:37:48Zhttp://eprints.uet.vnu.edu.vn/eprints/id/eprint/2790This item is in the repository with the URL: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/27902017-12-16T05:42:37ZTargeted Misinformation Blocking on Online Social NetworksIn this paper, we investigate a problem of ﬁnding smallest set of nodes to remove from a social network so that inﬂuence reduction of misinformation sources at least given threshold γ, called Targeted Misinformation Blocking (TMB) problem. We prove that TBM is #P-hard under LT model. For any parameter � ∈ (0,γ), we designed Greedy algorithm which return the solution A with the expected inﬂuence reduction greater than γ−�, and the size of A is within factor 1+ln(γ/�) of the optimal size. To speed-up Greedy algorithm, we designed an eﬃcient heuristic algorithm, called STBM algorithm. Experiments were conducted on real world networks which showed the eﬀectiveness of proposed algorithms in term of both eﬀectiveness and eﬃciency.Canh V. Phammaicanhki@gmail.comQuat V. Phuquatphu97mdbg@gmail.comXuan Huan Hoanghuanhx@vnu.edu.vn