TY - GEN
T1 - Discovering teleconnected flow anomalies
T2 - 11th International Symposium on Spatial and Temporal Databases, SSTD 2009
AU - Kang, James M.
AU - Shekhar, Shashi
AU - Henjum, Michael
AU - Novak, Paige J
AU - Arnold, Bill
PY - 2009
Y1 - 2009
N2 - Given a collection of sensors monitoring a flow network, the problem of discovering teleconnected flow anomalies aims to identify strongly connected pairs of events (e.g., introduction of a contaminant and its removal from a river). The ability to mine teleconnected flow anomalies is important for applications related to environmental science, video surveillance, and transportation systems. However, this problem is computationally hard because of the large number of time instants of measurement, sensors, and locations. This paper characterizes the computational structure in terms of three critical tasks, (1) detection of flow anomaly events, (2) identification of candidate pairs of events, and (3) evaluation of candidate pairs for possible teleconnection. The first task was addressed in our recent work. In this paper, we propose a RAD (Relationship Analysis of spatio-temporal Dynamic neighborhoods) approach for steps 2 and 3 to discover teleconnected flow anomalies. Computational overhead is brought down significantly by utilizing our proposed spatio-temporal dynamic neighborhood model as an index and a pruning strategy. We prove correctness and completeness for the proposed approaches. We also experimentally show the efficacy of our proposed methods using both synthetic and real datasets.
AB - Given a collection of sensors monitoring a flow network, the problem of discovering teleconnected flow anomalies aims to identify strongly connected pairs of events (e.g., introduction of a contaminant and its removal from a river). The ability to mine teleconnected flow anomalies is important for applications related to environmental science, video surveillance, and transportation systems. However, this problem is computationally hard because of the large number of time instants of measurement, sensors, and locations. This paper characterizes the computational structure in terms of three critical tasks, (1) detection of flow anomaly events, (2) identification of candidate pairs of events, and (3) evaluation of candidate pairs for possible teleconnection. The first task was addressed in our recent work. In this paper, we propose a RAD (Relationship Analysis of spatio-temporal Dynamic neighborhoods) approach for steps 2 and 3 to discover teleconnected flow anomalies. Computational overhead is brought down significantly by utilizing our proposed spatio-temporal dynamic neighborhood model as an index and a pruning strategy. We prove correctness and completeness for the proposed approaches. We also experimentally show the efficacy of our proposed methods using both synthetic and real datasets.
UR - http://www.scopus.com/inward/record.url?scp=70350379142&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70350379142&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-02982-0_6
DO - 10.1007/978-3-642-02982-0_6
M3 - Conference contribution
AN - SCOPUS:70350379142
SN - 3642029817
SN - 9783642029813
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 44
EP - 61
BT - Advances in Spatial and Temporal Databases - 11th International Symposium, SSTD 2009, Proceedings
Y2 - 8 July 2009 through 10 July 2009
ER -