Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15] [ 16] [ 17] [ 18] [ 19] [ 20] [ 21]


Journal of Information Science and Engineering, Vol. 31 No. 3, pp. 763-785 (May 2015)

Discover the Misinformation Broadcasting in On-Line Social Networks*

1School of Computer Science and Technology
Shandong University of Finance and Economics
Jinan, 250014 P.R. China
2Department of Computer Science and Engineering
The Hong Kong University of Science and Technology
3Huawei Noah's Ark Lab
Shatin, 999077 Hong Kong

In recent years, more and more people join social networks to share information with others. At the same time, the information sharing/spreading becomes far more frequent and convenient due to the wide usage of mobile devices. As a result, the messages created are very arbitrary, which may contain a lot of misinformation. Proper actions must be taken to avoid the spreading of misinformation or rumors before it causes serious damages. Therefore, any misinformation should be discovered in time when it does not spread to a large group of people. All previous works studied either how the information is spread in the social network or how to inhibit the further pervasion of an observed misinformation. However, no works considered how to discover the broadcasting of misinformation in time. A possible solution is to set observers across the network to discover the suspects of misinformation. In this paper, we design a novel mechanism to select a set of observers in a social network with the minimum cost, where these observers guarantee any misinformation can be discovered with a high probability before it reaches a bounded number of users. Extensive experiment on real data sets verifies the effectiveness of our solution.

Keywords: social networks, random walk, propagation, misinformation, privacy

Full Text () Retrieve PDF document (201505_01.pdf)

Received July 8, 2014; revised September 1, 2014; accepted October 11, 2014.
Communicated by Shou-De Lin.