An index-based time-series subsequence matching under time warping

Byoungchol Chang, Jaehyuk Cha, Sang Wook Kim, Miyoung Shin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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

Original languageEnglish
Title of host publicationKnowledge-Based Intelligent Information and Engineering Systems - 10th International Conference, KES 2006, Proceedings
PublisherSpringer Verlag
Pages1043-1050
Number of pages8
ISBN (Print)3540465359, 9783540465355
StatePublished - 2006
Event10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2006 - Bournemouth, United Kingdom
Duration: 9 Oct 200611 Oct 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4251 LNAI - I
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2006
Country/TerritoryUnited Kingdom
CityBournemouth
Period9/10/0611/10/06

Fingerprint

Dive into the research topics of 'An index-based time-series subsequence matching under time warping'. Together they form a unique fingerprint.

Cite this