Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Research of Local Co-location Pattern in Spatial Event Sequences

  • Conference paper
Fuzzy Systems and Knowledge Discovery (FSKD 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4223))

Included in the following conference series:

  • 1238 Accesses

Abstract

The present works are focusing on the discovery of global co-location patterns. It is a challenging problem to find the local co-location patterns. A novel method was presented to find local co-location patterns in an event sequence. The local co-location patterns were found by using an effective multi-layer index in a given time window (win) and local neighbor domain set. The experiment was done to prove algorithm effective and feasible.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

Similar content being viewed by others

References

  1. Agarwal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. 20th Int. VLDB, Santiago, Chile, September 12-15, pp. 487–499 (1994)

    Google Scholar 

  2. Huang, Y.: Mining Co-Location Patterns from Large Spatial Datasets, PhD dissertation of the University of Minnesota (2003)

    Google Scholar 

  3. Chawla, S., Sekhar, S., Wu, W., Ozesmi, U.: Extending Data Mining for Spatial Applications A Case Study in Predicting Nest Locations. In: Conf. on ACM SIGMOD (2000)

    Google Scholar 

  4. Guting, R.H.: An introduction to Spatial Database Systems. In: VLDBJ (1994)

    Google Scholar 

  5. Koperski, K., Han, J.W.: Discovery of Spatial Association Rules in Geographic Information Database. In: Proc. 4th Int. Large Spatial Database, Maine, August 1995, pp. 47–66 (1995)

    Google Scholar 

  6. Morimoto, Y.: Mining Frequent Neighboring Class Sets in Spatial Databases. In: Proc. 7th int. Knowledge discovery and data mining, San Francisco, California, pp. 353–358 (2001)

    Google Scholar 

  7. Shekhar, S., Huang, Y.: Discovering Spatial Co-location Patterns: A Summary of Results. In: Proc. 7th Int. Spatial and Temporal Databases, Redondo Beach, CA, USA, pp. 236–256 (2001)

    Google Scholar 

  8. Wang, Z.Q.: Spatial Co-location Rule Mining Algorithm in Categorical Data. Journal of Computer-aided Design & Computer Graphics 17(10), 320–327 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhanquan, W., Huiqun, Y., Haibo, C. (2006). Research of Local Co-location Pattern in Spatial Event Sequences. In: Wang, L., Jiao, L., Shi, G., Li, X., Liu, J. (eds) Fuzzy Systems and Knowledge Discovery. FSKD 2006. Lecture Notes in Computer Science(), vol 4223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881599_68

Download citation

  • DOI: https://doi.org/10.1007/11881599_68

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45916-3

  • Online ISBN: 978-3-540-45917-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics