eprintid: 2790
rev_number: 8
eprint_status: archive
userid: 302
dir: disk0/00/00/27/90
datestamp: 2017-12-16 05:42:37
lastmod: 2019-02-18 03:37:48
status_changed: 2017-12-16 05:42:37
type: conference_item
metadata_visibility: show
creators_name: Pham, Canh V.
creators_name: Phu, Quat V.
creators_name: Hoang, Xuan Huan
creators_id: maicanhki@gmail.com
creators_id: quatphu97mdbg@gmail.com
creators_id: huanhx@vnu.edu.vn
title: Targeted Misinformation Blocking on Online Social Networks
ispublished: pub
subjects: IT
divisions: fac_fit
abstract: In this paper, we investigate a problem of finding smallest set of nodes to remove from a social network so that influence 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 influence 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 efficient heuristic algorithm, called STBM algorithm. Experiments were conducted on real world networks which showed the effectiveness of proposed algorithms in term of both effectiveness and efficiency.
date: 2018-03-19
date_type: published
full_text_status: public
pres_type: paper
event_title: 10th Asian Conference on Intelligent Information and Database Systems (AIIDS)
event_location: Dong Hoi City, Vietnam
event_dates: 19-21 March 2018
event_type: conference
refereed: TRUE
citation:   Pham, Canh V. and Phu, Quat V. and Hoang, Xuan Huan  (2018) Targeted Misinformation Blocking on Online Social Networks.  In: 10th Asian Conference on Intelligent Information and Database Systems (AIIDS), 19-21 March 2018, Dong Hoi City, Vietnam.     
document_url: https://eprints.uet.vnu.edu.vn/eprints/id/eprint/2790/1/TBM_correct.pdf