Instance-Level Subsequence Matching Method based on a Virtual Window


KIPS Transactions on Computer and Communication Systems, Vol. 3, No. 2, pp. 43-46, Feb. 2014
10.3745/KTCCS.2014.3.2.43,   PDF Download:

Abstract

A time-series data is the collection of real numbers over the time intervals. One of the main tasks in time-series data is efficiently to find subsequences similar to a given query sequence. In this paper, we propose an efficient subsequence matching method, which is called Instance-Match (I-Match). I-Match constructs a virtual window in order to reduce false alarms. Through the experiment with real data set and query sets, we show that I-Match improves query processing time by up to 2.95 times and significantly reduces the number of candidates comparing to Dual Match.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. Y. Ihm and Y. H. Park, "Instance-Level Subsequence Matching Method based on a Virtual Window," KIPS Transactions on Computer and Communication Systems, vol. 3, no. 2, pp. 43-46, 2014. DOI: 10.3745/KTCCS.2014.3.2.43.

[ACM Style]
Sun Young Ihm and Young Ho Park. 2014. Instance-Level Subsequence Matching Method based on a Virtual Window. KIPS Transactions on Computer and Communication Systems, 3, 2, (2014), 43-46. DOI: 10.3745/KTCCS.2014.3.2.43.