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.
![[img]](https://eprints.uet.vnu.edu.vn/eprints/style/images/fileicons/application_pdf.png) |
PDF
Download (665kB) |
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | Information Technology (IT) |
| Divisions: | Faculty of Information Technology (FIT) |
| Depositing User: | Hoàng Xuân Huấn |
| Date Deposited: | 16 Dec 2017 05:42 |
| Last Modified: | 18 Feb 2019 03:37 |
| URI: | http://eprints.uet.vnu.edu.vn/eprints/id/eprint/2790 |
Actions (login required)
 |
View Item |
