Skip to main content

Detecting Statistically Significant Temporal Associations from Multiple Event Sequences

  • Conference paper
Advances in Artificial Intelligence (Canadian AI 2013)

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

Included in the following conference series:

  • 1727 Accesses

Abstract

In this paper, we aim to mine temporal associations in multiple event sequences. It is assumed that a set of event sequences has been collected from an application, where each event has an id and an occurrence time. Our work is motivated by the observation that in practice many associated events in multiple temporal sequences do not occur concurrently but sequentially. We proposed a two-phase method, called Multivariate Association Miner (MAM). In an empirical study, we apply MAM to two different application domains. Firstly, we use our method to detect multivariate motifs from multiple time series data. Existing approaches are all limited by assuming that the univariate elements of a multivariate motif occur completely or approximately synchronously. The experimental results on both synthetic and real data sets show that our method not only discovers synchronous motifs, but also finds non-synchronous multivariate motifs. Secondly, we apply MAM to mine frequent episodes from event streams. Current methods are all limited by requiring users to either provide possible lengths of frequent episodes or specify an inter-event time constraint for every pair of successive event types in an episode. The results on neuronal spike simulation data show that MAM automatically detects episodes with variable time delays.

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. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB 1994, pp. 487–499 (1994)

    Google Scholar 

  2. Chiu, B., Keogh, E., Lonardi, S.: Probabilistic discovery of time series motifs. In: KDD 2003, pp. 493–498 (2003)

    Google Scholar 

  3. Laxman, S., Sastry, P., Unnikrishnan, K.: A fast algorithm for finding frequent episodes in event streams. In: KDD 2007, pp. 410–419 (2007)

    Google Scholar 

  4. Mannila, H., Toivonen, H., Verkamo, A.: Discovering frequent episodes in sequences. In: KDD 1995, pp. 210–215 (1995)

    Google Scholar 

  5. Meester, R.: A Natural Introduction to Probability Theory (2004)

    Google Scholar 

  6. Minnen, D., Isbell, C., Essa, I.: Discovering multivariate motifs using subsequence density estimation and greedy mixture learning. In: AAAI 2007, pp. 615–620 (2007)

    Google Scholar 

  7. Minnen, D., Starner, T., Essa, I., Isbell, C.: Discovering characteristic actions from on-body sensor data. In: ISWC 2006, pp. 11–18 (2006)

    Google Scholar 

  8. Minnen, D., Starner, T., Essa, I., Isbell, C.: Improving activity discovery with automatic neighborhood estimation. In: IJCAI 2007, pp. 2814–2819 (2007)

    Google Scholar 

  9. Patnaik, D., Laxman, S.: Discovering excitatory networks from discrete event streams with applications to neuronal spike train analysis. In: ICDM 2009, pp. 407–416 (2009)

    Google Scholar 

  10. Raajay, V.: Frequent episode mining and multi-neuronal spike train data analysis. Master’s thesis, IISc, Bangalore (2009)

    Google Scholar 

  11. Sastry, P., Unnikrishnan, K.: Conditional probability-based significance tests for sequential patterns in multineuronal spike trains. Neural Computation (2010)

    Google Scholar 

  12. Shimazaki, H., Shinomoto, S.: A method for selecting the bin size of a time histogram. Neural Computation 19(6), 1503–1527 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Tanaka, Y., Iwamoto, K., Uehara, K.: Discovery of time-series motif from multi-dimensional data based on mdl principle. Machine Learning 58, 269–300 (2005)

    Article  MATH  Google Scholar 

  14. Vahdatpour, A., Amini, N.: Toward unsupervised activity discovery using multi-dimensional motif detection in time series. In: IJCAI 2009, pp. 1261–1266 (2009)

    Google Scholar 

  15. Wu, W., Au, L., Jordan, B.: The smartcane system: an assistive device for geriatrics. In: BodyNets 2008, pp. 1–4 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liang, H., Sander, J. (2013). Detecting Statistically Significant Temporal Associations from Multiple Event Sequences. In: Zaïane, O.R., Zilles, S. (eds) Advances in Artificial Intelligence. Canadian AI 2013. Lecture Notes in Computer Science(), vol 7884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38457-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38457-8_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38456-1

  • Online ISBN: 978-3-642-38457-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics