A novel time series behavior matching algorithm for online conversion algorithms
- 221 Downloads
This work presents a novel time series behavior matching algorithm for analyzing behavior (trend) similarity between two given time series. Unlike traditional approaches, our dynamic programming based approach “Behavior Matching (BM)” is based on trends and behavior rather than absolute distance as similarity measure. In order to compare the effectiveness of our proposed algorithm, we conduct an experimental study on real world stock data (DAX30). We compare our proposed algorithm with state-of-the-art algorithm Euclidean Distance, V-Shift and Dynamic Time Warping. The experimental results validates the performance guarantee and consistency of our proposed scheme.
KeywordsTime series matching Behavior analysis for online conversion Similarity measures
We would like to thank the anonymous referees for their valuable input.
- 3.Chan, K.P., Fu, A.W.: Efficient time series matching by wavelets. In: Proceedings of the 15th International Conference on Data Engineering, ICDE ’99, Washington, DC, USA. IEEE Computer Society (1999)Google Scholar
- 6.Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast subsequence matching in time-series databases. In: Proceedings of the 1994 ACM SIGMOD international conference on Management of data, SIGMOD ’94, ACM pp. 419–429, New York, NY, USA (1994)Google Scholar
- 12.Vlachos, M., Gunopoulos, D., Kollios, G.: Discovering similar multidimensional trajectories. In: Proceedings of the 18th International Conference on Data Engineering, ICDE ’02, Washington, DC, USA. IEEE Computer Society (2002)Google Scholar