Skip to main content

Efficient Detection of Emergency Event from Moving Object Data Streams

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8422))

Abstract

The advance of positioning technology enables us to online collect moving object data streams for many applications. One of the most significant applications is to detect emergency event through observed abnormal behavior of objects for disaster prediction. However, the continuously generated moving object data streams are often accumulated to a massive dataset in a few seconds and thus challenge existing data analysis techniques. In this paper, we model a process of emergency event forming as a process of rolling a snowball, that is, we compare a size-rapidly-changed (e.g., increased or decreased) group of moving objects to a snowball. Thus, the problem of emergency event detection can be resolved by snowball discovery. Then, we provide two algorithms to find snowballs: a clustering-and-scanning algorithm with the time complexity of O(n 2) and an efficient adjacency-list-based algorithm with the time complexity of O(nlogn). The second method adopts adjacency lists to optimize efficiency. Experiments on both real-world dataset and large synthetic datasets demonstrate the effectiveness, precision and efficiency of our algorithms

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kalnis, P., Mamoulis, N., Bakiras, S.: On discovering moving clustering moving clusters in spatio-temporal data. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 364–381. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Al-Naymat, G., Chawla, S., Gudmundsson, J.: Dimensionality reduction for long duration and complex spatio-temporal queries. In: SAC (2007)

    Google Scholar 

  3. Jeung, H., Shen, H.T., Zhou, X.: Convoy queries in spatio-temporal databases. In: ICDE (2008)

    Google Scholar 

  4. Tang, L.A., Zheng, Y.: On discovery of traveling companions from streaming trajectories. In: ICDE (2012)

    Google Scholar 

  5. Li, Z., Ding, B., Han, J., et al.: Swarm: Mining relaxed temporal moving object clusters. In: VLDB (2010)

    Google Scholar 

  6. Zheng, K., Zheng, Y., Yuan, N.J.: On Discovery of Gathering Patterns from Trajectories. In: ICDE (2013)

    Google Scholar 

  7. Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: An efficient data clustering method for very large databases. In: SIGMOD (1996)

    Google Scholar 

  8. Andersson, M., Gudmundsson, J., et al.: Reporting leadership patterns among trajectories. In: SAC (2007)

    Google Scholar 

  9. Laube, P., van Kreveld, M., Imfeld, S.: Finding REMO-detecting relative motion patterns in geospatial lifelines. In: SDH 2005, pp. 201–215. Springer, Heidelberg (2005)

    Google Scholar 

  10. Ni, J., Ravishankar, C.V.: Indexing spatio-temporal trajectories with efficient polynomial approximations. In: TKDE, vol. 19, pp. 663–678 (2007)

    Google Scholar 

  11. Anagnostopoulos, A., Vlachos, M., Hadjieleftheriou, M., et al.: Global distance-based segmentation of trajectories. In: SIGKDD, pp. 34–43 (2006)

    Google Scholar 

  12. Lee, J.-G., Han, J.: Trajectory clustering: A partition-and-group framework. In: SIGMOD (2007)

    Google Scholar 

  13. Wu, H.-R., Yeh, M.-Y., Chen, M.-S.: Profiling Moving Objects by Dividing and Clustering Trajectories Spatiotemporally. In: TKDE (2012)

    Google Scholar 

  14. Palma, A.T., Bogorny, V., Kuijpers, B., et al.: A clustering-based approach for discovering interesting places in trajectories. In: SAC, pp. 863–868 (2008)

    Google Scholar 

  15. Giannotti, F., Nanni, M., Pinelli, F., et al.: Trajectory pattern mining. In: SIGKDD, pp. 330–339 (2007)

    Google Scholar 

  16. Zheng, Y., Zhang, L., Xie, X., et al.: Mining interesting locations and travel sequences from gps trajectories. In: WWW, pp. 791–800 (2009)

    Google Scholar 

  17. Ester, M., Kriegel, H.-P., Sander, J., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: SIGKDD (1996)

    Google Scholar 

  18. Lelis, L., Sander, J.: Semi-supervised density-based clustering. In: ICDM, pp. 842–847 (2009)

    Google Scholar 

  19. Yang, D., Rundensteiner, E.A., Ward, M.O.: Summarization and Matching of Density-Based Clusters in Streaming Environments. In: VLDB, pp. 121–132 (2012)

    Google Scholar 

  20. Brinkhoff, T.: A framework for generating network-based moving objects. GeoInformatica 6(2) (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Guo, L., Huang, G., Ding, Z. (2014). Efficient Detection of Emergency Event from Moving Object Data Streams. In: Bhowmick, S.S., Dyreson, C.E., Jensen, C.S., Lee, M.L., Muliantara, A., Thalheim, B. (eds) Database Systems for Advanced Applications. DASFAA 2014. Lecture Notes in Computer Science, vol 8422. Springer, Cham. https://doi.org/10.1007/978-3-319-05813-9_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-05813-9_28

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-05812-2

  • Online ISBN: 978-3-319-05813-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics