Browse > Article
http://dx.doi.org/10.3745/KTCCS.2014.3.2.43

Instance-Level Subsequence Matching Method based on a Virtual Window  

Ihm, Sun-Young (숙명여자대학교 멀티미디어과학과)
Park, Young-Ho (숙명여자대학교 멀티미디어과학과)
Publication Information
KIPS Transactions on Computer and Communication Systems / v.3, no.2, 2014 , pp. 43-46 More about this Journal
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.
Keywords
Subsequence Matching; Time-Series Data; Instance-level Query Processing;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 C. Faloutsos, M. Ranganathan and Y. Manolopoulos, "Fast Subsequence Matching in Time-Series Databases," In Proceeding of International Conference on Management of Data (ACM SIGMOD), 1994, pp.419-429.
2 S. H. Lim "Using Multiple Indexes for Efficient Subsequence Matching in Time-Series Databases," In Proceedings of the Database Systems for Advanced Applications (DASFAA), 2006, pp.65-79.
3 Y. S. Moon, K. Y. Whang and W. K Loh, "Duality-based subsequence matching in time-series databases," In Proceedings of the 17th International Conference on Data Engineering (ICDE), 2001, pp.263-272.
4 M. H. Pandi, O. Kashefi and B. Minaei, "A Novel Similarity Measure for Sequence Data," Journal of Information Processing Systems, Vol.7, No.3, pp.413-424, 2011.   DOI   ScienceOn
5 S. H. Lim, H. Park and S. W. Kim, "Using multiple indexes for efficient subsequence matching in time-series databases," Journal of Information Science, Vol.170, No.24, pp.5691-5706, 2007.
6 Y. S. Moon, K. Y. Whang and W. K. Loh, "General Match: A Subsequence Matching Method in Time-Series Database Based on Generalized Windows," In Proceedings of International Conference on Management of Data (ACM SIGMOD), 2002, pp.382-393.
7 S. Y. Ihm, A. Nasridinov, J. H. Lee and Y. H. Park, "Efficient duality-based subsequent matching on time-series data in gree computing," Journal of Supercomputing, 2013, [DOI] 10.1007/s11227-013-1028-2.   DOI   ScienceOn
8 H. Wu, "Structured Time Series Stream Data," Dissertation, Northeastern University, 2005.