Skip to main content

Efficient Mining of Spatiotemporal Patterns

  • Conference paper
  • First Online:
Advances in Spatial and Temporal Databases (SSTD 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2121))

Included in the following conference series:

Abstract

The problem of mining spatiotemporal patterns is finding sequences of events that occur frequently in spatiotemporal datasets. Spatiotemporal datasets store the evolution of objects over time. Examples include sequences of sensor images of a geographical region, data that describes the location and movement of individual objects over time, or data that describes the evolution of natural phenomena, such as forest coverage. The discovered patterns are sequences of events that occur most frequently. In this paper, we present DFS_MINE, a new algorithm for fast mining of frequent spatiotemporal patterns in environmental data. DFS_MINE, as its name suggests, uses a Depth-First-Search-like approach to the problem which allows very fast discoveries of long sequential patterns. DFS_MINE performs database scans to discover frequent sequences rather than relying on information stored in main memory, which has the advantage that the amount of space required is minimal. Previous approaches utilize a Breadth-First-Search-like approach and are not efficient for discovering long frequent sequences. Moreover, they require storing in main memory all occurrences of each sequence in the database and, as a result, the amount of space needed is rather large. Experiments show that the I/O cost of the database scans is offset by the efficiency of the DFS-like approach that ensures fast discovery of long frequent patterns. DFS_MINE is also ideal for mining frequent spatiotemporal sequences with various spatial granularities. Spatial granularity refers to how fine or how general our view of the space we are examining is.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Agrawal, R. Srikant: Fast Algorithms for Mining Association Rules, 20th VLDB, Santiago, Chile, Sept. 1994

    Google Scholar 

  2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, A. I. Verkamo: Fast discovery of association rules. Advances in Knowledge Discovery and Data Mining 1996

    Google Scholar 

  3. R. Agrawal, R. Srikant: Mining Sequential Patterns, Proc. of the Fifth Int’l Conference on Extending Database Technology (EDBT), Avignon, France, March 1996

    Google Scholar 

  4. B.A. Davey, H.A. Priestley: Introduction to lattices and Order. Cambridge University Press, 1990

    Google Scholar 

  5. Klosgen, W., 1995. Deviation and association patterns for subgroup mining in temporal, spatial, and textual data bases. Proc. First International Conference on Rough Sets and Current Trends in Computing, RSCTCT98, 1–18, Springer-Verlag, Berlin.

    Google Scholar 

  6. Klosgen, W., 1998. Subgroup mining in temporal, spatial and textual databases. Proc. International Symposium on Digital Media Information Base, 246–261, World Scientific, Singapore.

    Google Scholar 

  7. K. Koperksi, J. Han: Discovery of Spatial Association Rules in Geographie Information Databases, 4th Int’l Symp. on Large Spatial Databases (SSD95), Maine, Aug. 1995.

    Google Scholar 

  8. H. Mannila, H. Toivonen, A. I. Verkamo: Discovery of frequent episodes in event sequences. Report C-1997-15, University of Helsinki, Department of Computer Science, February 1997.

    Google Scholar 

  9. R. T. Ng, J. Han: Efficient and Effective Clustering Methods for Spatial Data Mining. VLDB 1994

    Google Scholar 

  10. J. Sander, M. Ester, H-P Kriegel, X. Xu: Density-Based Clustering in Spatial Databases:The Algorithm GDBSCAN and Its Applications.

    Google Scholar 

  11. Stolorz, P., et al., 1995. Fast Spatio-Temporal Data Mining of Large Geophysical Sets. Proc. First International Conference on Knowledge Discovery and Data Mining, Montreal,Canada, 300–305, AAAI Press.

    Google Scholar 

  12. W. Wang, J. Yang, R. Muntz: STING: A Statistical Information Grid Approach to Spatial Data Mining, 23rd VLDB Conference, Athens, Greece, Aug 1997.

    Google Scholar 

  13. W. Wang, J. Yang, R. Muntz: STING+: An Approach to Active Spatial Data Mining, International Conference on Data Engineering (ICDE-99), Australia, March, 1999.

    Google Scholar 

  14. M. Zaki: Efficient Enumeration of Frequent Sequences, Machine Learning Journal 2001

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tsoukatos, I., Gunopulos, D. (2001). Efficient Mining of Spatiotemporal Patterns. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds) Advances in Spatial and Temporal Databases. SSTD 2001. Lecture Notes in Computer Science, vol 2121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47724-1_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-47724-1_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42301-0

  • Online ISBN: 978-3-540-47724-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics