Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2007
DOI: 10.1145/1281192.1281239
|View full text |Cite
|
Sign up to set email alerts
|

Cost-effective outbreak detection in networks

Abstract: Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingly different problems share common structure: Outbreak detection can be modeled as selecting nodes (sensor locations, blogs) in a network, in order to detect the spreading of a virus or information as quickly as possible. We present a general methodology for near optimal sensor placement in these and related problems. We demonstrate th… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

15
1,610
0
9

Year Published

2013
2013
2021
2021

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 2,125 publications
(1,634 citation statements)
references
References 26 publications
15
1,610
0
9
Order By: Relevance
“…The simpler case, where the network topology alone dictates activation spread, has been examined by multiple research groups, seeking to improve on Kempe's early work on greedy approaches for influence maximization [14]. Examples of possible speedups include innovations such as the use of a shortest-path based influence cascade model [16] or a lazy-forward optimization algorithm [19] to reduce the number of evaluations on the influence spread of nodes. Clever heuristics have been used very successfully to speed computation in both the LT model (e.g., the PMIA algorithm [8]) and also the IC model [25].…”
Section: Related Workmentioning
confidence: 99%
“…The simpler case, where the network topology alone dictates activation spread, has been examined by multiple research groups, seeking to improve on Kempe's early work on greedy approaches for influence maximization [14]. Examples of possible speedups include innovations such as the use of a shortest-path based influence cascade model [16] or a lazy-forward optimization algorithm [19] to reduce the number of evaluations on the influence spread of nodes. Clever heuristics have been used very successfully to speed computation in both the LT model (e.g., the PMIA algorithm [8]) and also the IC model [25].…”
Section: Related Workmentioning
confidence: 99%
“…The objective of [8,9] is to ensure that the expected impact of a contamination event is within a pre-specified level, and [8] introduced a formulation based on set cover and solved the problem using genetic algorithm while [9] use a MIP based solution. In order to achieve the objective defined in [10], [11][12][13][14][15][16][17][18][19][20][21] adopted multi-objective optimization by different methods such as heuristic, predator-prey model or local search method and [22] used the submodular property to achieve an approximation guarantee.…”
Section: Related Workmentioning
confidence: 99%
“…Submodularity was widely used in sensor placement optimization [22,25]. But these solutions are mostlybuilt for static water network.…”
Section: Related Workmentioning
confidence: 99%
“…For the LT model, we compare our two algorithms (DAGIS and Sampling) with the CELFGreedy [4] algorithm. For the IC model, we compare our algorithm DDH with CELFGreedy [4] and Degree [2] and Distance [2]. We provide the experimental results of different algorithms for two influence cascade models.…”
Section: A Experiments Setupmentioning
confidence: 99%
“…So we can use this idea to update the influence spread of nodes lazily. In [4], Chen etc. present NewGreedyIC algorithm which is based on the greedy algorithm.…”
Section: Introductionmentioning
confidence: 99%