Rumor source detection in networks based on the SEIR model

Zhou, Yousheng, Wu, Chujun, Zhu, Qingyi, Xiang, Yong and Loke, Seng 2019, Rumor source detection in networks based on the SEIR model, IEEE access, vol. 7, pp. 45240-45258, doi: 10.1109/ACCESS.2019.2909552.

Attached Files
Name Description MIMEType Size Downloads

Title Rumor source detection in networks based on the SEIR model
Author(s) Zhou, Yousheng
Wu, Chujun
Zhu, Qingyi
Xiang, YongORCID iD for Xiang, Yong orcid.org/0000-0003-3545-7863
Loke, SengORCID iD for Loke, Seng orcid.org/0000-0001-9568-5230
Journal name IEEE access
Volume number 7
Start page 45240
End page 45258
Total pages 19
Publisher Institute of Electrical and Electronics Engineers
Place of publication Piscataway, N.J.
Publication date 2019
ISSN 2169-3536
Keyword(s) Rumor source detection
Optimal infection process
Susceptible-exposed-infected-recovered (SEIR) model
Information security
Science & Technology
Technology
Computer Science, Information Systems
Engineering, Electrical & Electronic
Telecommunications
Computer Science
Engineering
Summary Online social networks have become extremely important in daily life and can be used to influence lives in dramatic ways. Two issues are the veracity and provenance of posted information, including rumors. There is a need for methods for tracing rumors (or any piece of information) to their most likely source in such networks. We consider the detection problem of single rumor source based on observed snapshots based on the susceptible-exposed-infected-recovered (SEIR) model. According to the SEIR model, all nodes in the network are formulated into four possible states: susceptible (S), exposed (E), infected (I), and recovered (R). Given an observed snapshot in the network, from which we can know the relevant graph topology and all infected nodes, but where nodes in susceptible, exposed, or recovered status cannot be distinguished, the purpose of our research is to identify the rumor source based on the observed snapshot and graph topology. We propose the concept of the optimal infection process and derive an estimator for the rumor source based on this optimal infection process. Subsequently, we prove that this estimator matches the rumor source with a high probability. The effectiveness of the proposed scheme is validated using experiments based on regular tree networks with different degrees. We further evaluate the performance of our scheme on two well-known synthetic complex networks and four real-world networks; the results suggest that our proposed scheme outperforms the traditional rumor centrality heuristics. The performance analysis on computational complexity demonstrates that our scheme has advantages in efficiency compared with other rumor centrality heuristics used in rumor detection methods.
Language eng
DOI 10.1109/ACCESS.2019.2909552
HERDC Research category C1 Refereed article in a scholarly journal
Copyright notice ©2019, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30121298

Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 0 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 67 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Mon, 06 May 2019, 12:02:22 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.