TY - JOUR
T1 - Active Surveillance via Group Sparse Bayesian Learning
AU - Pei, Hongbin
AU - Yang, Bo
AU - Liu, Jiming
AU - Chang, Kevin Chen Chuan
N1 - Funding information:
This work was supported by the National Natural Science Foundation of China under Grant 61876069, the Jilin Province Key Scientific and Technological Research and Development Project under Grants 20180201067GX and 20180201044GX, Jilin Province Natural Science Foundation under Grant 20200201036JC, University Science and Technology Research Plan Project of Jilin Province under Grant JJKH20190156KJ, Research Grants Council of Hong Kong Special Administrative Region under Grants RGC/HKBU12201318 and RGC/HKBU12202220, National Science Foundation IIS 16-19302 and IIS 16-33755, Zhejiang University ZJU Research 083650, Futurewei Technologies HF2017060011 and 094013, UIUC OVCR CCIL Planning Grant 434S34, UIUC CSBS Small Grant 434C8U, IBM-Illinois Center for Cognitive Computing Systems Research (C3SR), and China Scholarships Council under scholarship 201806170202. Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the author(s) and do not necessarily reflect the views of the funding agencies. A preliminary version of this work was published in AAAI18[6]. The authors are also very grateful to the anonymous reviewers for their constructive comments, which further improved the quality of the work.
Publisher Copyright:
© 2020 IEEE.
PY - 2022/3/1
Y1 - 2022/3/1
N2 - 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 γ 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 γ 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.
AB - 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 γ 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 γ 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.
KW - automatic relevance determination
KW - diffusion
KW - dynamical systems
KW - Epidemic dynamics
KW - sensor deployment
UR - http://www.scopus.com/inward/record.url?scp=85117854437&partnerID=8YFLogxK
U2 - 10.1109/TPAMI.2020.3023092
DO - 10.1109/TPAMI.2020.3023092
M3 - Journal article
C2 - 32915724
AN - SCOPUS:85117854437
SN - 0162-8828
VL - 44
SP - 1133
EP - 1148
JO - IEEE Transactions on Pattern Analysis and Machine Intelligence
JF - IEEE Transactions on Pattern Analysis and Machine Intelligence
IS - 3
ER -