Abstract
In this paper, we propose a dual approach of GeneralMatch, called DualGMatch. GeneralMatch is an efficient time-series subsequence matching method that uses the generalized windows, called J-sliding and J-disjoint windows. We first investigate the traditional subsequence matching methods. Based on this investigation, we show that DualGMatch can be feasible as a dual approach of GeneralMatch by switching the role of J-sliding and J-disjoint windows. We analytically and empirically compare the proposed DualGMatch with the previous GeneralMatch.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Faloutsos, C., Swami, A.: Efficient Similarity Search in Sequence Databases. In: Lomet, D.B. (ed.) FODO 1993. LNCS, vol. 730, Springer, Heidelberg (1993)
Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*–tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. Int’l Conf. on Management of Data, ACM SIGMOD, Atlantic City, New Jersey, pp. 322–331 (May 1990)
Berchtold, S., Bohm, C., Kriegel, H.-P.: The Pyramid-Technique: Towards Breaking the Curse of Dimensionality. In: Proc. Int’l Conf. on Management of Data, ACM SIGMOD, Seattle, Washington, pp. 142–153 (June 1998)
Chan, K.-P., Fu, A.W.-C., Yu, C.T.: Haar Wavelets for Efficient Simi-larity Search of Time-Series: With and Without Time Warping. IEEE Trans. on Knowledge and Data Engineering 15(3), 686–705 (2003)
Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast Subsequence Matching in Time-Series Databases. In: Proc. Int’l Conf. on Management of Data, ACM SIGMOD, Minneapolis, Minnesota, pp. 419–429 (May 1994)
Han, W.-S., Lee, J., Moon, Y.-S., Hwang, S.-W., Yu, H.: A New Ap-proach for Processing Ranked Subsequence Matching Based on Ranked Union. In: Proc. of Int’l Conf. on Management of Data, ACM SIGMOD, Athens, Greece (June 2011)
Moon, Y.-S., Whang, K.-Y., Loh, W.-K.: Duality-Based Subsequence Matching in Time-Series Databases. In: Proc. the 17th Int’l Conf. on Data Engineering (ICDE), pp. 263–272. IEEE, Heidelberg (2001)
Moon, Y.-S., Whang, K.-Y., Han, W.-S.: General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows. In: Proc. Intl Conf. on Management of Data, ACM SIGMOD, Madison, Wisconsin, pp. 382–393 (June 2002)
Moon, Y.-S., Kim, B.-S., Kim, M.S., Whang, K.-Y.: Scaling-Invariant Boundary Image Matching Using Time-Series Matching Techniques. Data & Knowledge Engineering 69(10), 1022–1042 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, HS., Lee, M., Moon, YS. (2014). A Dual Approach of GeneralMatch in Time-Series Subsequence Matching. In: Jeong, H., S. Obaidat, M., Yen, N., Park, J. (eds) Advances in Computer Science and its Applications. Lecture Notes in Electrical Engineering, vol 279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41674-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-41674-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41673-6
Online ISBN: 978-3-642-41674-3
eBook Packages: EngineeringEngineering (R0)