Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pastor, R.: El niño climate pattern forms in pacific ocean (2006), http://www.usatoday.com/weather/climate/2006-09-13-el-nino_x.htm
WFUNA: Millenium project: Global challenges facing humanity (2007)
Mason, M.: World’s highest drug levels entering india stream, USA today (2009), http://www.usatoday.com/tech/science/environment/2009-01-26-drug-india-stream_n.htm
Saulny, S.: Fish-killing virus spreading in the great lakes, New York times (2007)
Bruckner, M.: The gulf of mexico dead zone, montana state university (2008), http://serc.carleton.edu/microbelife/topics/deadzone/
Matthews, D.A., Effler, S.W., Driscoll, C.T., O’Donnell, S.M., Matthews, C.M.: Electron budgets for the hypolimnion of a recovering urban lake, 1989-2004. Limnology and Oceanography, American Society of Limnology and Oceanography 53(2), 743–759 (2008)
Hyer, K.E., Hornberger, G.M., Herman, J.S.: Processes controlling the episodic streamwater transport of atrazine and other agrichemicals in the agricultural watershed. Journal of Hydrology 254, 47–66 (2001)
Kang, J.M., Shekhar, S., Wennen, C., Novak, P.: Discovering Flow Anomalies: A SWEET Approach. In: IEEE International Conference on Data Mining, pp. 851–856 (2008)
Amir, A., Apostolico, A., Lewenstein, M.: Inverse pattern matching. Journal of Algorithms 24(2), 325–339 (1997)
Lee, H., Ng, R.T., Shim, K.: Estimating Rarity and Similarity over Data Stream Windows. In: VLDB, pp. 195–206 (2007)
Berndt, D.J., Clifford, J.: Using Dynamic Time Warping to Find Patterns in Time Series. In: KDD 1994: AAAI Workshop on Knowledge Discovery in Databases, pp. 359–370 (1994)
Chen, A., Tang, C., Yuan, C.-a., Peng, J., Hu, J.: Mining Correlations Between Multi-streams Based on Haar Wavelet. In: Grumbach, S., Sui, L., Vianu, V. (eds.) ASIAN 2005, vol. 3818, pp. 270–271. Springer, Heidelberg (2005)
Sayal, M.: Detecting time correlations in time-series data streams. Technical Report HPL-2004-103, Hewlett-Packard Company (2004)
Bulut, A., Singh, A.K.: A unified framework for monitoring data streams in real time. In: IEEE ICDE, pp. 44–75 (2005)
Datar, M., Muthukrishnan, S.: Estimating Rarity and Similarity over Data Stream Windows. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 323–334. Springer, Heidelberg (2002)
Kalnis, P., Mamoulis, N., Bakiras, S.: On discovering moving clusters in spatio-temporal data. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005, vol. 3633, pp. 364–381. Springer, Heidelberg (2005)
Spiliopoulou, M., Ntoutsi, I., Theodoridis, Y., Schult, R.: MONIC - Modeling and Monitoring Cluster Transitions. In: ACM SIGKDD (2006)
DeGroot, M., Scheverish, M.J.: Probability and Statistics, 3rd edn. Addison Wesley, Reading (2002)
Knorr, E., Ng, R.: A Unified Notion of Outliers. In: ACM KDD (1997)
Shekhar, S., Lu, C.T., Zhang, P.: A unified approach to spatial outliers detection. GeoInformatica 7(2), 139–166 (2003)
Li, X., Hodgson, M.E.: Vector field data model and operations. GIScience and Remote Sensing 41(1), 1–24 (2004)
Zhang, P., Huang, Y., Shekhar, S., Kumar, V.: Exploiting Spatial Autocorrelation to Efficiently Process Correlation-Based Similarity Queries. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds.) SSTD 2003. LNCS, vol. 2750, pp. 25–27. Springer, Heidelberg (2003)
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective Outbreak Detection in Networks. In: ACM SIGKDD (2007)
Shekhar, S., Chawla, S.: Spatial Databases: A Tour. Prentice Hall, Englewood Cliffs (2002)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 41 (1959), www2.informatik.hu–berlin.de/alkox/lehre/lvws0809/verkehr/dijkstra.pdf
Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4(2) (1968)
Kang, J.M., Shekhar, S., Wennen, C., Novak, P.: Discovering Flow Anomalies: A SWEET Approach. University of Minnesota, MN, Technical Report, 09-006 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kang, J.M., Shekhar, S., Henjum, M., Novak, P.J., Arnold, W.A. (2009). Discovering Teleconnected Flow Anomalies: A Relationship Analysis of Dynamic Neighborhoods (RAD) Approach. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds) Advances in Spatial and Temporal Databases. SSTD 2009. Lecture Notes in Computer Science, vol 5644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02982-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-02982-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02981-3
Online ISBN: 978-3-642-02982-0
eBook Packages: Computer ScienceComputer Science (R0)