图 书 馆
网络中经济有效的暴发检测Cost-effective Outbreak Detection in Networks |
|
| 课程网址: | http://videolectures.net/kdd07_leskovec_ceod/ |
| 主讲教师: | Jure Leskovec |
| 开课单位: | 斯坦福大学 |
| 开课时间: | 2007-09-14 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | 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 that many realistic outbreak detection objectives (e.g., detection likelihood, population affected) exhibit the property of “submodularity”. We exploit submodularity to develop an efficient algorithm that scales to large problems, achieving near optimal placements, while being 700 times faster than a simple greedy algorithm. We also derive online bounds on the quality of the placements obtained by any algorithm. Our algorithms and bounds also handle cases where nodes (sensor locations, blogs) have different costs. We evaluate our approach on several large real-world problems, including a model of a water distribution network from the EPA, and real blog data. The obtained sensor placements are provably near optimal, providing a constant fraction of the optimal solution. We show that the approach scales, achieving speedups and savings in storage of several orders of magnitude. We also show how the approach leads to deeper insights in both applications, answering multicriteria trade-off, cost-sensitivity and generalization questions. |
| 关 键 词: | 配水网络; 传感器; 污染物 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2020-05-22：杨雨(课程编辑志愿者) |
| 阅读次数: | 93 |