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.
展开▼
