Information source detection via maximum a posteriori estimation

The problem of information source detection, whose goal is to identify the source of a piece of information from a diffusion process (e.g., computer virus, rumor, epidemic, and so on), has attracted ever-increasing attention from research community in recent years. Although various methods have been...

Full description

Saved in:
Bibliographic Details
Main Authors: CHANG, Biao, ZHU, Feida, CHEN, Enhong, LIU, Qi.
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2016
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/3137
https://ink.library.smu.edu.sg/context/sis_research/article/4137/viewcontent/information_source_detection.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-4137
record_format dspace
spelling sg-smu-ink.sis_research-41372017-03-31T07:54:05Z Information source detection via maximum a posteriori estimation CHANG, Biao ZHU, Feida CHEN, Enhong LIU, Qi. The problem of information source detection, whose goal is to identify the source of a piece of information from a diffusion process (e.g., computer virus, rumor, epidemic, and so on), has attracted ever-increasing attention from research community in recent years. Although various methods have been proposed, such as those based on centrality, spectral and belief propagation, the existing solutions still suffer from high time complexity and inadequate effectiveness. To this end, we revisit this problem in the paper and present a comprehensive study from the perspective of likelihood approximation. Different from many previous works, we consider both infected and uninfected nodes to estimate the likelihood for the detection. Specifically, we propose a Maximum A Posteriori (MAP) estimator to detect the information source for general graphs with rumor centrality as the prior. To further improve the efficiency, we design two approximate estimators, namely Brute Force Search Approximation (BFSA) and Greedy Search Bound Approximation (GSBA). BFSA tries to traverse the permitted permutations and directly computes the likelihood, while GSBA exploits a strategy of greedy search to find a surrogate upper bound of the probabilities of permitted permutations for a given node, and derives an approximate MAP estimator. Extensive experiments on several network data sets clearly demonstrate the effectiveness of our methods in detecting the single information source. 2016-01-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/3137 info:doi/10.1109/ICDM.2015.116 https://ink.library.smu.edu.sg/context/sis_research/article/4137/viewcontent/information_source_detection.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Greedy search Information source detection Likelihood approximation Maximum a posteriori Databases and Information Systems
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Greedy search
Information source detection
Likelihood approximation
Maximum a posteriori
Databases and Information Systems
spellingShingle Greedy search
Information source detection
Likelihood approximation
Maximum a posteriori
Databases and Information Systems
CHANG, Biao
ZHU, Feida
CHEN, Enhong
LIU, Qi.
Information source detection via maximum a posteriori estimation
description The problem of information source detection, whose goal is to identify the source of a piece of information from a diffusion process (e.g., computer virus, rumor, epidemic, and so on), has attracted ever-increasing attention from research community in recent years. Although various methods have been proposed, such as those based on centrality, spectral and belief propagation, the existing solutions still suffer from high time complexity and inadequate effectiveness. To this end, we revisit this problem in the paper and present a comprehensive study from the perspective of likelihood approximation. Different from many previous works, we consider both infected and uninfected nodes to estimate the likelihood for the detection. Specifically, we propose a Maximum A Posteriori (MAP) estimator to detect the information source for general graphs with rumor centrality as the prior. To further improve the efficiency, we design two approximate estimators, namely Brute Force Search Approximation (BFSA) and Greedy Search Bound Approximation (GSBA). BFSA tries to traverse the permitted permutations and directly computes the likelihood, while GSBA exploits a strategy of greedy search to find a surrogate upper bound of the probabilities of permitted permutations for a given node, and derives an approximate MAP estimator. Extensive experiments on several network data sets clearly demonstrate the effectiveness of our methods in detecting the single information source.
format text
author CHANG, Biao
ZHU, Feida
CHEN, Enhong
LIU, Qi.
author_facet CHANG, Biao
ZHU, Feida
CHEN, Enhong
LIU, Qi.
author_sort CHANG, Biao
title Information source detection via maximum a posteriori estimation
title_short Information source detection via maximum a posteriori estimation
title_full Information source detection via maximum a posteriori estimation
title_fullStr Information source detection via maximum a posteriori estimation
title_full_unstemmed Information source detection via maximum a posteriori estimation
title_sort information source detection via maximum a posteriori estimation
publisher Institutional Knowledge at Singapore Management University
publishDate 2016
url https://ink.library.smu.edu.sg/sis_research/3137
https://ink.library.smu.edu.sg/context/sis_research/article/4137/viewcontent/information_source_detection.pdf
_version_ 1770572823668981760