Skip to main content

Mining Interventions from Parallel Event Sequences

  • Conference paper
Advances in Data and Web Management (APWeb 2009, WAIM 2009)

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

Abstract

Discovering temporal patterns from sequence data has been an important task of data mining in recent years. In this paper a novel temporal pattern, Intervention, is proposed to capture the partial ordering relations in parallel event sequences. It is demonstrated that Intervention is essentially a deviation of generalized Markov property holding in parallel event sequences. A measure to evaluate the degree of such deviation, Intervention Intensity, is suggested, which has an important mathematical property, non-symmetry. As a result, an algorithm called MIPES for mining interventions is proposed. The time complexity of MIPES is of O(m 2) and is independent of data size, where m is the number of event types and is far smaller than the data size in practice. The experimental results show MIPES is applicable and scalable.

Supported by the National Natural Science Foundation of China under Grant No.600773169 and the 11th Five Years Key Programs for Sci. &Tech. Development of China under grant No. 2006BAI05A01.

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 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.

References

  1. Unnikrishnan, K.P., Uthurusamy, R. (eds): Temproal Data Mining Workshop Notes. In: 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2002) (2001)

    Google Scholar 

  2. Vautier, A., Cordier, M., Quiniou, R.: An Inductive Database for Mining Temporal Patterns in Event Sequences. In: International Joint Conference on Artificial Intellegence (2005)

    Google Scholar 

  3. Roddick, J.F., Hornsby, K.S., Spiliopoulou, M.: An updated bibliography of temporal, spatial, and spatio-temporal data mining research. In: Roddick, J.F., Hornsby, K.S. (eds.) TSDM 2000. LNCS, vol. 2007, pp. 147–163. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Wu, S., Chen, Y.L.: Mining Nonambiguous Temporal Patterns for Interval-Based Events. IEEE Transactions on Knowledge and Data Engineering 19(6), 742–758 (2007)

    Article  Google Scholar 

  5. Antunes, O.: Temporal data mining: An overview. In: 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2001) (2001)

    Google Scholar 

  6. Han, J., Cheng, H., Xin, D., Yan, X.: Frequent Pattern Mining: Current Status and Future Directions. Data Mining and Knowledge Discovery 15(1), 55–86 (2007)

    Article  MathSciNet  Google Scholar 

  7. Mannila, H., Toivonen, H., Verkamo, A.I.: Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery 1(3), 259–289 (1997)

    Article  Google Scholar 

  8. Laxman, S., Sastry, P.S., Unnikrishnan, K.P.: Discovering Frequent Episodes and Learning Hidden Markov Models: A Formal Connection. IEEE Transactions on Knowledge and Data Engineering 19(11), 742–758 (2005)

    Google Scholar 

  9. Kullback, S., Leibler, R.A.: On Information and Sufficiency. Ann. Math. Stat. 22, 79–86 (1951)

    Article  MathSciNet  MATH  Google Scholar 

  10. Agrawal, R., Srikant, R.: Fast Algoritms for Mining Association Rules. In: VLDB, pp. 487–499 (1994)

    Google Scholar 

  11. Agrawal, R., Srikant, R.: Mining sequential patterns. In: ICDE, pp. 3–14 (1995)

    Google Scholar 

  12. Casas-Garriga, G.: Discovering unbounded episodes in sequential data. In: Lavrač, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS, vol. 2838, pp. 83–94. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Meger, N., Rigotti, C.: Constraint-based mining of episode rules and optimal window sizes. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS, vol. 3202, pp. 313–324. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Keogh, E., Pazzani, M.: An Enhanced Representation of Time Series Which Allows Fast and Accurate Classification, Clustering and Relevance Feedback. In: Knowledge Discovery in Databases and Data Mining, pp. 239–241 (1998)

    Google Scholar 

  15. Lesh, N., Zaki, M., Ogihara, M.: Mining Features for Sequence Classification. In: The 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 1999) (1999)

    Google Scholar 

  16. Ketterlin, A.: Clustering Sequences of Complex Objects. In: The 3th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 1997) (1997)

    Google Scholar 

  17. Cover, T.: Elements of Information Theory. John Wiley & Sons, Inc., San Francisco (2006)

    MATH  Google Scholar 

  18. http://archive.ics.uci.edu/ml/datasets/Dodgers+Loop+Sensor

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, N. et al. (2009). Mining Interventions from Parallel Event Sequences. In: Li, Q., Feng, L., Pei, J., Wang, S.X., Zhou, X., Zhu, QM. (eds) Advances in Data and Web Management. APWeb WAIM 2009 2009. Lecture Notes in Computer Science, vol 5446. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00672-2_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00672-2_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00671-5

  • Online ISBN: 978-3-642-00672-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics