LIÊN KẾT WEBSITE
Minimizing the spread of misinformation on online social networks with time and budget constraint
Proceedings - 2017 9th International Conference on Knowledge and Systems Engineering, KSE 2017 Số , năm 2017 (Tập 2017-January, trang 160-165)
DOI: 10.1109/KSE.2017.8119452
Tài liệu thuộc danh mục: Scopus
Conference Paper
English
Từ khóa: Budget control; Systems engineering; Budget constraint; Greedy algorithms; Linear threshold models; Mis-information propagation; NP-hardness; On-line social networks; Partial knowledge; Social networking (online)
Tóm tắt tiếng anh
In this article, we propose a linear threshold model to the problem of minimizing the spread of misinformation for cases where partial knowledge of misinformation sources is available by using monitors, the misinformation propagation time and the budget for placing monitors are restricted, and proved it is NP-Hardness. At the same time, we also suggest two greedy algorithms to solve the problem. Experimental results show the dominant advantages of the algorithms in comparison with other commonly used algorithms. � 2017 IEEE.
