Abstract
Subsequence matching is a fundamental task in mining time series data. The UCR Suite approach can deal with normalized subsequence matching problem (NSM), but it needs to scan full time series. In this paper, we propose to deal with the subsequence matching problem based on a simple series synopsis, the mean values of the disjoint windows. We propose a novel problem, named constrained normalized subsequence matching problem (cNSM), which adds some constraints to NSM problem. We propose a query processing approach, named MVS-match, to process the cNSM query efficiently. The experimental results verify the effectiveness and efficiency of our approach.
The work is supported by the Ministry of Science and Technology of China, National Key Research and Development Program (2016YFB1000700), NSFC (61672163, 61170006), and National Key Basic Research Program of China under No. 2015CB358800.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast subsequence matching in time-series databases. In: SIGMOD, pp. 419–429 (1994)
Rakthanmanon, T., Campana, B., et al.: Searching and mining trillions of time series subsequences under dynamic time warping. In: SIGKDD, pp. 262–270 (2012)
Chen, Y., et al.: The UCR time series classification archive. www.cs.ucr.edu/~eamonn/time_series_data/
Li, Y., Tang, B., Hou, U.L., Yiu, M.L., Gong, Z.: Fast subsequence search on time series data (poster paper). In: EDBT, pp. 514–517 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Feng, K., Wu, J., Wang, P., Pan, N., Wang, W. (2019). MVS-match: An Efficient Subsequence Matching Approach Based on the Series Synopsis. In: Li, G., Yang, J., Gama, J., Natwichai, J., Tong, Y. (eds) Database Systems for Advanced Applications. DASFAA 2019. Lecture Notes in Computer Science(), vol 11448. Springer, Cham. https://doi.org/10.1007/978-3-030-18590-9_47
Download citation
DOI: https://doi.org/10.1007/978-3-030-18590-9_47
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18589-3
Online ISBN: 978-3-030-18590-9
eBook Packages: Computer ScienceComputer Science (R0)