Skip to main content
SpringerLink
Log in
Book cover

International Conference on Knowledge-Based and Intelligent Information and Engineering Systems

KES 2006: Knowledge-Based Intelligent Information and Engineering Systems pp 1043–1050Cite as

An Index-Based Time-Series Subsequence Matching Under Time Warping

  • Conference paper

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

Abstract

This paper addresses efficient processing of time-series subsequence matching under time warping. Time warping enables finding sequences with similar patterns even when they are of different lengths. The prefix-querying method is the first index-based approach that performs time-series subsequence matching under time warping without false dismissals. This method originally employs the L  ∞  distance metric as a base distance function. This paper extends the prefix-querying method for absorbing L 1 instead of L  ∞ . We formally prove that the extended prefix-querying method does not incur any false dismissals. The performance results reveal that our method achieves significant performance improvement over the previous methods up to 10.7 times.

This is a preview of subscription content, log in via an institution.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berndt, D.J., Clifford, J.: Finding Patterns in Time-Series: A Dynamic Programming Approach. In: Advances in Knowledge Discovery and Data Mining, pp. 229–248 (1996)

    Google Scholar 

  2. Faloutsos, C.: Private Communication (2001)

    Google Scholar 

  3. Keogh, E.: Exact Indexing of Dynamic Time Warping. In: Proc. Int’l. Conf. on Very Large Data Bases (VLDB), pp. 406–417 (2002)

    Google Scholar 

  4. Kim, S.W., Park, S.H., Chu, W.W.: An Index-Based Approach for Similarity Search Supporting Time Warping in Large Sequence Databases. In: Proc. Int’l. Conf. on Data Engineering, IEEE ICDE, pp. 1607–1614 (2001)

    Google Scholar 

  5. Kim, M.S., Kim, S.W., Shin, M.Y.: Optimization of Subsequence Matching Under Time Warping in Time-Series Databases. In: ACM Symp. on Applied Computing, pp. 581-586 (April 2005)

    Google Scholar 

  6. Park, S.H., Kim, S.W., Cho, J.S., Padmanabhan, S.: Prefix-Querying: An Approach for Effective Subsequence Matching Under Time Warping in Sequence Databases. In: Proc. ACM Intl. Conf. On Information and Knowledge Management, ACM CIKM, pp. 255–262 (2001)

    Google Scholar 

  7. Yi, B.K., Jagadish, H.V., Faloutsos, C.: Efficient Retrieval of Similar Time Sequences Under Time Warping. In: Proc. Int’l. Conf. on Data Engineering, IEEE ICDE, pp. 201–208 (1998)

    Google Scholar 

  8. Chang, B.C., Kim, S.W., Cha, J.H., Shin, M.Y.: An Index-Based Time-Series Subsequence Matching Under Time Warping, Technical Report, Data and Knowledge Engineering Laboratory (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information and Communications, Hanyang University, Korea

    Byoungchol Chang, Jaehyuk Cha & Sang-Wook Kim

  2. School of Electrical Engineering and Computer Science, Kyungpook National University, Korea

    Miyoung Shin

Authors
  1. Byoungchol Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jaehyuk Cha
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sang-Wook Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Miyoung Shin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Design, Engineering and Computing, Bournemouth University, UK

    Bogdan Gabrys

  2. Centre for SMART Systems, School of Environment and Technology, University of Brighton, BN2 4GJ, Brighton, UK

    Robert J. Howlett

  3. School of Electrical and Information Engineering, Knowledge Based Intelligent Engineering Systems Centre, University of South Australia, Mawson Lakes, 5095, SA, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chang, B., Cha, J., Kim, SW., Shin, M. (2006). An Index-Based Time-Series Subsequence Matching Under Time Warping. In: Gabrys, B., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2006. Lecture Notes in Computer Science(), vol 4251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11892960_125

Download citation

  • DOI: https://doi.org/10.1007/11892960_125

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46535-5

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation