A Robust Approach to Subsequence Matching
In terms of a general time theory which addresses time-elements as typed point-based intervals, a formal characterization of time-series and state-sequences is introduced. Based on this framework, the subsequence matching problem is specially tackled by means of being transferred into bipartite graph matching problem. Then a hybrid similarity model with high tolerance of inversion, crossover and noise is proposed for matching the corresponding bipartite graphs involving both temporal and non-temporal measurements. Experimental results on reconstructed time-series data from UCI KDD Archive demonstrate that such an approach is more effective comparing with the traditional similarity model based algorithms, promising robust techniques for lager time-series databases and real-life applications such as Content-based Video Retrieval (CBVR), etc.
Unable to display preview. Download preview PDF.
- 2.Agrawal, R., Faloutsos, C., Swami, A.: Efficient similarity search in sequence databases. In: Proc. of the 4th Int’l Conf. on Foundations of Data Organization and Algorithms, Chicago, Illinois, USA, October 13-15, 1993, pp. 69–84 (1993)Google Scholar
- 4.Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The r*-tree: An efficient and robust access method for points and rectangles. In: Proc. of the 1990 ACM SIGMOD Int’l Conf. on Management of Data, Atlantic City, NJ, May 23-25, 1990, pp. 322–331 (1990)Google Scholar
- 6.Keogh, E.: Exact indexing of dynamic time warping. In: Proc. of the 28th Int’l Conf. on Very Large Data Bases, Hong Kong, China, August 20-23, 2002, pp. 406–417 (2002)Google Scholar
- 8.Ma, J., Bie, R., Zhao, G.: An ontological Characterization of Time-series and State-sequences for Data Mining. In: Proc. of the 5th International Conference on Fuzzy Systems and Knowledge Discovery, Jinan, Shandong, October 18-20, 2008, pp. 325–329 (2008)Google Scholar
- 9.Moon, Y., Whang, K., Han, W.: General Match A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows. In: Proc. of the 8th ACM SIGMOD Int’l Conf. on Management of data, Madison, Wisconsin, USA, June 4-6, 2002, pp. 382–393 (2002)Google Scholar
- 10.Moon, Y., Whang, K., Loh, W.: Duality-based subsequence matching in time-series databases. In: Proc. of the 17th Int’l Conf. on Data Engineering, Santa Barbara, California, May 21-24, 2001, pp. 263–272 (2001)Google Scholar
- 14.Shier, D.: Matchings and assignments. In: Gross, J.L., Yellen, J. (eds.) Handbook of Graph Theory, pp. 1103–1116. CRC Press, Boca Raton (2004)Google Scholar
- 15.Vlachos, M., Gunopulos, D., Kollios, G.: Discovering similar multidimensional trajectories. In: Proc. of the 18th Int’l Conf. on Data Engineering, San Jose, CA, USA, February 26 - March 1, 2002, pp. 673–684 (2002)Google Scholar