Skip to main content

Mining Temporal Patterns from Sequence Database of Interval-Based Events

  • 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:

Abstract

Sequential pattern mining is one of the important techniques of data mining to discover some potential useful knowledge from large databases. However, existing approaches for mining sequential patterns are designed for point-based events. In many applications, the essence of events are interval-based, such as disease suffered, stock price increase or decrease, chatting etc. This paper presents a new algorithm to discover temporal pattern from temporal sequences database consisting of interval-based events.

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. Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: Proceedings of the 11th International Conference on Data Engineering, pp. 3–14 (1995)

    Google Scholar 

  2. Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of ACM 26(11), 832–843 (1983)

    Article  MATH  Google Scholar 

  3. Han, J., Pei, J., Mortazavi-Asl, B., Chen, Q., Dayal, U., Hsu, M.-C.: Freespan: frequent pattern-projected sequential pattern mining. In: Proceedings of the International Conference on Knowledge Discovery and Data Mining, pp. 355–359 (2000)

    Google Scholar 

  4. Lin, M.-Y., Lee, S.-Y.: Fast discovery of sequential patterns by memory indexing. In: Kambayashi, Y., Winiwarter, W., Arikawa, M. (eds.) DaWaK 2002. LNCS, vol. 2454, pp. 150–160. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  5. Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.-C.: PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth. In: Proceedings of the 17th International Conference on Data Engineering, pp. 215–224 (2001)

    Google Scholar 

  6. Srikant, R., Agrawal, R.: Mining sequential patterns: generalizations and performance improvements. In: Apers, P.M.G., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, pp. 3–17. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  7. Zaki, M.J.: SPADE: an efficient algorithm for mining frequent sequences. Machine Learning Journal 42(1/2), 31–60 (2001)

    Article  MATH  Google Scholar 

  8. Zhao, Q., Bhowmick, S.S.: Sequential pattern mining: a survey. Technical Report, CAIS, Nanyang Technological University, Singapore (2003)

    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

Chen, YL., Wu, SY. (2006). Mining Temporal Patterns from Sequence Database of Interval-Based Events. 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_70

Download citation

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

  • 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