Abstract
The proliferation of location-acquisition technologies and online social networks such as twitter, Foursquare, Meetup lead to huge volumes of spatio-temporal events in the form of event stream. In this study, we investigate the problem of discovering spatio-temporal co-occurrence patterns from spatio- temporal event stream (CoPES). We propose an effective sliding-window based dynamic incremental and decayed (abbreviated as DIAD) algorithm for discovering CoPES. DIAD algorithm proposes a novel decay mechanism to calculate the prevalence of CoPES and a sliding-window to process the event stream time slot by time slot to discover CoPES. The algorithm utilizes a hash tree to store the closet COPES. Then the decay mechanism and the sliding-window exploit the superimposed spatio-temporal neighbor relationships between time slots to get the accurate prevalence from event stream and discover CoPES efficiently. The experimental results on real dataset show that our proposed algorithm has superior quality and excellent expansibility.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487–499 (1994)
Estivil-Castro, V., Murray, A.: Discovering associations in spatial data-an efficient medoid based approach. In: Wu, X., Kotagiri, R., Korb, K.B. (eds.) PAKDD 1998. LNCS, vol. 1394, pp. 110–121. Springer, Heidelberg (1998)
Morimoto, Y.: Mining frequent neighboring class sets in spatial databases. In: SIGKDD, pp. 353–358 (2001)
Lee, C., Lin, C., Chen, M.: Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining. In: CIKM, pp. 263–270 (2001)
Estivil-Castro, V., Lee, I.: Data mining techniques for autonomous exploration of large volumes of geo-referenced crime data. Geocomputation, 24–26 (2001)
Huang, Y., Shekhar, S., Xiong, H.: Discovering colocation patterns from spatial data sets: A general approach. In: TKDE, pp. 1472–1485 (2004)
Yoo, J.S., Shekhar, S., Smith, J., Kumquat, J.P.: A partial join approach for mining co-location patterns. In: GIS, pp. 241–249 (2004)
Goldin, D., Millstein, T., Kutlu, A.: Bounded similarity querying for time-series data. In: IANDC, pp. 203–241 (2004)
Kalnis, P., Mamoulis, N., Bakiras, S.: On Discovering Moving Clusters in Spatio-temporal Data. In: SSD, pp. 364–381 (2005)
Yoo, J.S., Shekhar, S.: A joinless approach for mining spatial colocation patterns. In: TKDE, pp. 1323–1337 (2006)
Huang, Y., Zhang, P.: On the Relationships Between Clustering and Spatial Co-location Pattern Mining. In: ICTAI, pp. 513–522 (2006)
Gudmundsson, J., Kreveld, M.J.: Computing Longest Duration Flocks in Trajectory Data. In: GIS, pp. 35–42 (2006)
Celik, M., Shekhar, S., Rogers, J.P., Shine, J.A.: Mixed-drove Spatiotemporal co-occurrence Pattern Mining. In: TKDE, pp. 1322–1335 (2008)
Huang, Y., Zhang, L., Zhang, P.: A Framework for Mining sequential Patterns from Spatio-temporal Event Data sets. IEEE, 433–448 (2008)
Xiao, X.Y., Xie, X., Luo, Q., Ma, W.Y.: Density Based co-location pattern discovery. In: GIS, pp. 29–10 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huo, J., Zhang, J., Meng, X. (2013). On Co-occurrence Pattern Discovery from Spatio-temporal Event Stream. In: Lin, X., Manolopoulos, Y., Srivastava, D., Huang, G. (eds) Web Information Systems Engineering – WISE 2013. WISE 2013. Lecture Notes in Computer Science, vol 8181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41154-0_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-41154-0_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41153-3
Online ISBN: 978-3-642-41154-0
eBook Packages: Computer ScienceComputer Science (R0)