Scalable Rumor Source Detection under Independent Cascade Model in Online Social Networks
Authors:
- Wen XuWXWen Xu
- He ChenHCHe Chen
- 1 December 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 236-242
Abstract
This paper studies the problem of identifying rumor source in online social networks in which the spread of information follows the popular Independent Cascade model. In the absence of text information, we develop a monitor based approach to evaluate how likely that a piece of information is actually a rumor. Given the underlying social network structure, a number of monitor nodes are injected into the network whose job is to report the data they receive. Based on observing which of monitors received the information and which did not, we propose a polynomial time algorithm to compute rumor quantifier, a reachability based score for ranking the importance of nodes as the rumor source. Extensive simulation results have shown that, with a reasonable number of monitor nodes and appropriate monitor deployment, our rumor source detection algorithm can recognize rumor source effectively and efficiently.Keywords
This publication has 18 references indexed in Scilit:
- A novel approach to online social influence maximizationSocial Network Analysis and Mining, 2014
- Maximizing product adoption in social networks2012
- Information credibility on twitter2011
- Twitter under crisis2010
- What is disputed on the web?2010
- Meme-tracking and the dynamics of the news cycle2009
- Rumor, Gossip and Urban LegendsDiogenes, 2007
- Problem Solving in Social Interactions on the Internet: Rumor As Social CognitionSocial Psychology Quarterly, 2004
- Maximizing the spread of influence through a social network2003
- Rumor and Public OpinionAmerican Journal of Sociology, 1951