4.8 Article

Active Surveillance via Group Sparse Bayesian Learning

Journal

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TPAMI.2020.3023092

Keywords

Epidemic dynamics; diffusion; sensor deployment; dynamical systems; automatic relevance determination

Funding

  1. National Natural Science Foundation of China [61876069]
  2. Jilin Province Key Scientific and Technological Research and Development Project [20180201067GX, 20180201044GX]
  3. Jilin Province Natural Science Foundation [20200201036JC]
  4. University Science and Technology Research Plan Project of Jilin Province [JJKH20190156KJ]
  5. Research Grants Council of Hong Kong Special Administrative Region [RGC/HKBU12201318, RGC/HKBU12202220]
  6. National Science Foundation [IIS 16-19302, IIS 16-33755]
  7. Zhejiang University ZJU Research [083650]
  8. Futurewei Technologies [HF2017060011, 094013]
  9. UIUC OVCR CCIL Planning [434S34]
  10. UIUC CSBS Small Grant [434C8U]
  11. IBM-Illinois Center for Cognitive Computing Systems Research (C3SR)
  12. China Scholarships Council [201806170202]

Ask authors/readers for more resources

The goal of this study is to predict the dynamics of a diffusion system by active surveillance. By introducing the y value measure and the sentinel network mining algorithm, the key components can be identified and accurate predictions can be achieved.
The key to the effective control of a diffusion system lies in how accurately we could predict its unfolding dynamics based on the observation of its current state. However, in the real-world applications, it is often infeasible to conduct a timely and yet comprehensive observation due to resource constraints. In view of such a practical challenge, the goal of this work is to develop a novel computational method for performing active observations, termed active surveillance, with limited resources. Specifically, we aim to predict the dynamics of a large spatio-temporal diffusion system based on the observations of some of its components. Towards this end, we introduce a novel measure, the y value, that enables us to identify the key components by means of modeling a sentinel network with a row sparsity structure. Having obtained a theoretical understanding of the y value, we design a backward-selection sentinel network mining algorithm (SNMA) for deriving the sentinel network via group sparse Bayesian learning. In order to be practically useful, we further address the issue of scalability in the computation of SNMA, and moreover, extend SNMA to the case of a non-linear dynamical system that could involve complex diffusion mechanisms. We show the effectiveness of SNMA by validating it using both synthetic datasets and five real-world datasets. The experimental results are appealing, which demonstrate that SNMA readily outperforms the state-of-the-art methods.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available