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.
|Title of host publication||Software Engineering Research, Management and Applications|
|Editors||R. Lee, N. Ishii|
|Place of Publication||Berlin Heidelberg|
|Number of pages||11|
|Publication status||Published - 2009|
|Name||Studies in Computational Intelligence|
Zheng, A., Ma, J., Petridis, M., Tang, J., & Luo, B. (2009). A robust approach to subsequence matching. In R. Lee, & N. Ishii (Eds.), Software Engineering Research, Management and Applications (Vol. 253, pp. 39-49). (Studies in Computational Intelligence). Springer.