TY - GEN
T1 - Towards Controlling the Transmission of Diseases: Continuous Exposure Discovery over Massive-Scale Moving Objects
AU - Li, Ke
AU - Chen, Lisi
AU - Shang, Shuo
AU - Wang, Haiyan
AU - Liu, Yang
AU - Kalnis, Panos
AU - Yao, Bin
N1 - KAUST Repository Item: Exported on 2022-12-09
Acknowledgements: This work was supported by the NSFC (U21B2046, U2001212, 62032001, and 61932004) and Sichuan Science and Technology Program (No.2021YFS0007). Bin Yao was supported by the NSFC (61922054, 61872235, 61832017).
PY - 2022/7
Y1 - 2022/7
N2 - Infectious diseases have been recognized as major public health concerns for decades. Close contact discovery is playing an indispensable role in preventing epidemic transmission. In this light, we study the continuous exposure search problem: Given a collection of moving objects and a collection of moving queries, we continuously discover all objects that have been directly and indirectly exposed to at least one query over a period of time. Our problem targets a variety of applications, including but not limited to disease control, epidemic pre-warning, information spreading, and co-movement mining. To answer this problem, we develop an exact group processing algorithm with optimization strategies. Further, we propose an approximate algorithm that substantially improves the efficiency without false dismissal. Extensive experiments offer insight into effectiveness and efficiency of our proposed algorithms.
AB - Infectious diseases have been recognized as major public health concerns for decades. Close contact discovery is playing an indispensable role in preventing epidemic transmission. In this light, we study the continuous exposure search problem: Given a collection of moving objects and a collection of moving queries, we continuously discover all objects that have been directly and indirectly exposed to at least one query over a period of time. Our problem targets a variety of applications, including but not limited to disease control, epidemic pre-warning, information spreading, and co-movement mining. To answer this problem, we develop an exact group processing algorithm with optimization strategies. Further, we propose an approximate algorithm that substantially improves the efficiency without false dismissal. Extensive experiments offer insight into effectiveness and efficiency of our proposed algorithms.
UR - http://hdl.handle.net/10754/686310
UR - https://www.ijcai.org/proceedings/2022/540
U2 - 10.24963/ijcai.2022/540
DO - 10.24963/ijcai.2022/540
M3 - Conference contribution
BT - Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence
PB - International Joint Conferences on Artificial Intelligence Organization
ER -