A dimensionality reduction technique for efficient time series similarity analysis

作者:

Highlights:

摘要

We propose a dimensionality reduction technique for time series analysis that significantly improves the efficiency and accuracy of similarity searches. In contrast to piecewise constant approximation (PCA) techniques that approximate each time series with constant value segments, the proposed method—piecewise vector quantized approximation—uses the closest (based on a distance measure) codeword from a codebook of key-sequences to represent each segment. The new representation is symbolic and it allows for the application of text-based retrieval techniques into time series similarity analysis. Experiments on real and simulated datasets show that the proposed technique generally outperforms PCA techniques in clustering and similarity searches.

论文关键词:Temporal databases,Dimensionality reduction,Vector quantization,Data mining,Information retrieval

论文评审过程:Received 27 October 2006, Revised 22 May 2007, Accepted 7 July 2007, Available online 17 July 2007.

论文官网地址:https://doi.org/10.1016/j.is.2007.07.002