Shape-based retrieval of similar subsequences in time-series databases

Sang Wook Kim, Jeehee Yoon, Sang Hyun Park, Tae Hoon Kim

Research output: Contribution to conferencePaper

14 Citations (Scopus)

Abstract

This paper deals with the problem of shape-based retrieval in time-series databases. The shape-based retrieval is defined as the operation that searchers for the (sub)sequences whose shapes are similar to that of a given query sequence. In this paper, we propose an effective an efficient approach for shape-based retrieval of subsequences. We first introduce a new similarity model for shape-based retrieval that supports various combinations of transformations such as shifting, scaling, moving average, and time warping. For efficient processing of the shape-based retrieval, we also propose the indexing and query processing methods. To verify the superiority of our approach, we perform extensive experiments with the real-world S&P 500 stock data. The results reveal that our approach successfully finds all the subsequences that have the shapes similar to that of the query sequence, and also achieves significant speedup over the sequential scan method.

Original languageEnglish
Pages438-445
Number of pages8
Publication statusPublished - 2002 Jan 1
EventApplied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing - Madrid, Spain
Duration: 2002 Mar 112002 Mar 14

Other

OtherApplied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing
CountrySpain
CityMadrid
Period02/3/1102/3/14

Fingerprint

Query processing
Time series
Processing
Experiments

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Kim, S. W., Yoon, J., Park, S. H., & Kim, T. H. (2002). Shape-based retrieval of similar subsequences in time-series databases. 438-445. Paper presented at Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing, Madrid, Spain.
Kim, Sang Wook ; Yoon, Jeehee ; Park, Sang Hyun ; Kim, Tae Hoon. / Shape-based retrieval of similar subsequences in time-series databases. Paper presented at Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing, Madrid, Spain.8 p.
@conference{a0e96e9c6b584ca99828a6756f601b23,
title = "Shape-based retrieval of similar subsequences in time-series databases",
abstract = "This paper deals with the problem of shape-based retrieval in time-series databases. The shape-based retrieval is defined as the operation that searchers for the (sub)sequences whose shapes are similar to that of a given query sequence. In this paper, we propose an effective an efficient approach for shape-based retrieval of subsequences. We first introduce a new similarity model for shape-based retrieval that supports various combinations of transformations such as shifting, scaling, moving average, and time warping. For efficient processing of the shape-based retrieval, we also propose the indexing and query processing methods. To verify the superiority of our approach, we perform extensive experiments with the real-world S&P 500 stock data. The results reveal that our approach successfully finds all the subsequences that have the shapes similar to that of the query sequence, and also achieves significant speedup over the sequential scan method.",
author = "Kim, {Sang Wook} and Jeehee Yoon and Park, {Sang Hyun} and Kim, {Tae Hoon}",
year = "2002",
month = "1",
day = "1",
language = "English",
pages = "438--445",
note = "Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing ; Conference date: 11-03-2002 Through 14-03-2002",

}

Kim, SW, Yoon, J, Park, SH & Kim, TH 2002, 'Shape-based retrieval of similar subsequences in time-series databases' Paper presented at Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing, Madrid, Spain, 02/3/11 - 02/3/14, pp. 438-445.

Shape-based retrieval of similar subsequences in time-series databases. / Kim, Sang Wook; Yoon, Jeehee; Park, Sang Hyun; Kim, Tae Hoon.

2002. 438-445 Paper presented at Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing, Madrid, Spain.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Shape-based retrieval of similar subsequences in time-series databases

AU - Kim, Sang Wook

AU - Yoon, Jeehee

AU - Park, Sang Hyun

AU - Kim, Tae Hoon

PY - 2002/1/1

Y1 - 2002/1/1

N2 - This paper deals with the problem of shape-based retrieval in time-series databases. The shape-based retrieval is defined as the operation that searchers for the (sub)sequences whose shapes are similar to that of a given query sequence. In this paper, we propose an effective an efficient approach for shape-based retrieval of subsequences. We first introduce a new similarity model for shape-based retrieval that supports various combinations of transformations such as shifting, scaling, moving average, and time warping. For efficient processing of the shape-based retrieval, we also propose the indexing and query processing methods. To verify the superiority of our approach, we perform extensive experiments with the real-world S&P 500 stock data. The results reveal that our approach successfully finds all the subsequences that have the shapes similar to that of the query sequence, and also achieves significant speedup over the sequential scan method.

AB - This paper deals with the problem of shape-based retrieval in time-series databases. The shape-based retrieval is defined as the operation that searchers for the (sub)sequences whose shapes are similar to that of a given query sequence. In this paper, we propose an effective an efficient approach for shape-based retrieval of subsequences. We first introduce a new similarity model for shape-based retrieval that supports various combinations of transformations such as shifting, scaling, moving average, and time warping. For efficient processing of the shape-based retrieval, we also propose the indexing and query processing methods. To verify the superiority of our approach, we perform extensive experiments with the real-world S&P 500 stock data. The results reveal that our approach successfully finds all the subsequences that have the shapes similar to that of the query sequence, and also achieves significant speedup over the sequential scan method.

UR - http://www.scopus.com/inward/record.url?scp=0036040646&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036040646&partnerID=8YFLogxK

M3 - Paper

SP - 438

EP - 445

ER -

Kim SW, Yoon J, Park SH, Kim TH. Shape-based retrieval of similar subsequences in time-series databases. 2002. Paper presented at Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing, Madrid, Spain.