Nothing Special   »   [go: up one dir, main page]

Skip to main content

Discovering Local Patterns from Multiple Temporal Sequences

  • Conference paper
  • First Online:
EurAsia-ICT 2002: Information and Communication Technology (EurAsia-ICT 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2510))

Included in the following conference series:

  • 360 Accesses

Abstract

In this paper, we address a data-mining problem that is the discovery of local sequential patterns from a set of long sequences. Each local sequential pattern is represented by a pattern A→B and a time period in which A→B is frequent. Such patterns are actually very common in practice and are potentially very useful. However it is impractical to use traditional methods on this problem directly. We propose a suffix-tree-like data structure for indexing the instances of the patterns. Based on this index, our mining method can discover all locally frequent patterns after one scan of the sequences. We have analyzed the behavior of the problem and evaluated the performance of our algorithm with both synthetic and real data. The results correspond with the definition of the problem and verify the superiority of our approach.

The research has been supported in part of Chinese national key fundamental research program (no, G1998030414) and Chinese national fund of natural science (no. 79990580)

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. P. Weiner Linear pattern matching algorithms. Conference Record, the IEEE 14th Annual Symposium on Switching and Automata Theory, 1973.

    Google Scholar 

  2. K. Wang, Discovering patterns from large and dynamic sequential data, Special Issues on Data Mining and Knowledge Discovery, Journal of Intelligent Information Systems, 9(1), 8–33, 1997.

    Article  Google Scholar 

  3. R. Agrawal and R. Srikant Mining sequential patterns. In Proc. of International Conference On Data Engineering. Taipei, 1995.

    Google Scholar 

  4. R. Srikant, R. Agrawal Mining sequential patterns: generalizations and performance improvements. The Fifth International Conference on Extending Database Technology. 1996.

    Google Scholar 

  5. K. Wang and J. Tan Incremental discovery of sequential patterns. ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, Montreal, Canada. 1996.

    Google Scholar 

  6. H. Mannila and H. Toivonen Discovering generalised episodes using minimal occurences. Second International Conference on Knowledge Discovery and Data Mining (KDD-96). 1996.

    Google Scholar 

  7. P.-s. Kam and A. W.-C. Fu Discovering temporal patterns for interval-based events. Second International Conference on Data Warehousing and Knowledge Discovery. 2000.

    Google Scholar 

  8. Y. Li, X.S. Wang and S. Jajodia Discovering temporal patterns in multiple granularities. International Workshop on Temporal, Spatial and Spatio-Temporal Data Mining. Lyon, France. 2000.

    Google Scholar 

  9. A. Tansel, N. Ayan Discovery of association rules in temporal databases. 4th International Conference on Knowledge Discovery and Data Mining (KDD’98) Distributed Data Mining Workshop, New York, USA, August 1998.

    Google Scholar 

  10. G. Das, K. Lin, H. Mannila, G. Renganathan and P. Smyth Rule discovery from time series. the 4th International Conference on KDD. 1998.

    Google Scholar 

  11. M. Spiliopoulou and J.F. Roddick Higher order mining: modelling and mining the results of knowledge discovery. Data Mining II-Second International Conference on Data Mining Methods and Databases. 2000.

    Google Scholar 

  12. X. Chen, I. Petrounias An Integrated query and mining system for temporal association rules. The 2nd International Conference on Data Warehousing and Knowledge Discovery (DaWaK 2000), London, UK. 327–336. 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jin, X., Lu, Y., Shi, C. (2002). Discovering Local Patterns from Multiple Temporal Sequences. In: Shafazand, H., Tjoa, A.M. (eds) EurAsia-ICT 2002: Information and Communication Technology. EurAsia-ICT 2002. Lecture Notes in Computer Science, vol 2510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36087-5_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-36087-5_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00028-0

  • Online ISBN: 978-3-540-36087-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics