CausalTAD: Causal Implicit Generative Model for Debiased Online Trajectory Anomaly Detection
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909440947519488 |
|---|---|
| author | Li, Wenbin Yao, Di Gong, Chang Chu, Xiaokai Jing, Quanliang Zhou, Xiaolei Zhang, Yuxuan Fan, Yunxia Bi, Jingping |
| author_facet | Li, Wenbin Yao, Di Gong, Chang Chu, Xiaokai Jing, Quanliang Zhou, Xiaolei Zhang, Yuxuan Fan, Yunxia Bi, Jingping |
| contents | Trajectory anomaly detection, aiming to estimate the anomaly risk of trajectories given the Source-Destination (SD) pairs, has become a critical problem for many real-world applications. Existing solutions directly train a generative model for observed trajectories and calculate the conditional generative probability $P({T}|{C})$ as the anomaly risk, where ${T}$ and ${C}$ represent the trajectory and SD pair respectively. However, we argue that the observed trajectories are confounded by road network preference which is a common cause of both SD distribution and trajectories. Existing methods ignore this issue limiting their generalization ability on out-of-distribution trajectories. In this paper, we define the debiased trajectory anomaly detection problem and propose a causal implicit generative model, namely CausalTAD, to solve it. CausalTAD adopts do-calculus to eliminate the confounding bias of road network preference and estimates $P({T}|do({C}))$ as the anomaly criterion. Extensive experiments show that CausalTAD can not only achieve superior performance on trained trajectories but also generally improve the performance of out-of-distribution data, with improvements of $2.1\% \sim 5.7\%$ and $10.6\% \sim 32.7\%$ respectively. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_18820 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | CausalTAD: Causal Implicit Generative Model for Debiased Online Trajectory Anomaly Detection Li, Wenbin Yao, Di Gong, Chang Chu, Xiaokai Jing, Quanliang Zhou, Xiaolei Zhang, Yuxuan Fan, Yunxia Bi, Jingping Machine Learning Trajectory anomaly detection, aiming to estimate the anomaly risk of trajectories given the Source-Destination (SD) pairs, has become a critical problem for many real-world applications. Existing solutions directly train a generative model for observed trajectories and calculate the conditional generative probability $P({T}|{C})$ as the anomaly risk, where ${T}$ and ${C}$ represent the trajectory and SD pair respectively. However, we argue that the observed trajectories are confounded by road network preference which is a common cause of both SD distribution and trajectories. Existing methods ignore this issue limiting their generalization ability on out-of-distribution trajectories. In this paper, we define the debiased trajectory anomaly detection problem and propose a causal implicit generative model, namely CausalTAD, to solve it. CausalTAD adopts do-calculus to eliminate the confounding bias of road network preference and estimates $P({T}|do({C}))$ as the anomaly criterion. Extensive experiments show that CausalTAD can not only achieve superior performance on trained trajectories but also generally improve the performance of out-of-distribution data, with improvements of $2.1\% \sim 5.7\%$ and $10.6\% \sim 32.7\%$ respectively. |
| title | CausalTAD: Causal Implicit Generative Model for Debiased Online Trajectory Anomaly Detection |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2412.18820 |