Skip to main content

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 117))

  • 1166 Accesses

Abstract

On the basis of analyzing the newly time sequence research achievement nowadays, this paper addresses the problem of the whole event sequences matching, a type of sequence matching that retrieves and matching the occurrences patterns from chaotic and nonlinear event sequences. In this paper, several definitions on event relativity are put forward, 3-tuple is employed to present the event, the chain table is developed to describe the event sequence, and the whole similarity sequence matching model for the compact storage of the event sequence is presented, and then it is analysis. In this paper, we first given the definition of event sequences and then propose a 3-tuple method to descript events and employs chain tables to storage them.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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. Roiger, R.J., Geatz, M.W.: Data Mining: A Tutorial-based Primer. Pearson education (2003)

    Google Scholar 

  2. Han, J., Kamber, M.: Data Mining: Concepts and Techniques Primer. China Machine Press (2006)

    Google Scholar 

  3. Agrawal, R., Faloutsos, C., Swami, A.: Efficient Similarity Searching Sequence Databases. In: Proc. Int’l Conf.on Foundations of Data organization and Algorithms, FODO 1993, pp. 69–84 (1993)

    Google Scholar 

  4. Ren, J., Tian, H.: Sequential Pattern Mining with Inaccurate Event in Temporal Sequenee. In: Fourth International Conference on Networked Computing and Advanced Information Management, pp. 659–664 (2008)

    Google Scholar 

  5. Park, S.-H., Won, J.-I., Yoon, J.-H., Kim, S.-W.: An index-based method for timestamped event sequence matching. In: Andersen, K.V., Debenham, J., Wagner, R. (eds.) DEXA 2005. LNCS, vol. 3588, pp. 493–502. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Wu, S.-C., Wu, G.-F., Wang, W., Yu, Z.-C.: A Time-Sequence Similarity Matching Algorithm for Seimological Relevant Zones. Journal of Software 17(2), 185–192 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hong-Xia Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media Dordrecht

About this paper

Cite this paper

Wang, HX., Chen, JJ. (2012). A Whole Sequence Matching Algorithm for Event Sequences. In: Wu, Y. (eds) Advanced Technology in Teaching - Proceedings of the 2009 3rd International Conference on Teaching and Computational Science (WTCS 2009). Advances in Intelligent and Soft Computing, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25437-6_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25437-6_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25436-9

  • Online ISBN: 978-3-642-25437-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics