A dimensionality reduction technique for efficient similarity analysis of time series databases

Authors:
Vasileios Megalooikonomou;Guo Li;Qiang Wang
Affiliations:
Temple University, Philadelphia, PA;Temple University, Philadelphia, PA;Temple University, Philadelphia, PA
Venue:
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Year:
2004

Citing 2
Cited 9

Vector quantization and signal compression

Vector quantization and signal compression
Fast Time Sequence Indexing for Arbitrary Lp Norms

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases

A Multiresolution Symbolic Representation of Time Series

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
A dimensionality reduction technique for efficient time series similarity analysis

Information Systems
Boolean representation based data-adaptive correlation analysis over time series streams

Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Adaptive correlation analysis in stream time series with sliding windows

Computers & Mathematics with Applications
Time series analysis with multiple resolutions

Information Systems
A review on time series data mining

Engineering Applications of Artificial Intelligence
Time-series data mining

ACM Computing Surveys (CSUR)
Multiresolution similarity search in time series data: an application to EEG signals

Proceedings of the 6th International Conference on PErvasive Technologies Related to Assistive Environments
A new similarity measure based on shape information for invariant with multiple distortions

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficiently searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem with applications in many domains. The high dimensionality of the data makes the analysis very challenging. To solve this problem, many dimensionality reduction methods have been proposed. PCA (Piecewise Constant Approximation) and its variant have been shown efficient in time series indexing and similarity retrieval. However, in certain applications, too many false alarms introduced by the approximation may reduce the overall performance dramatically. In this paper, we introduce a new piecewise dimensionality reduction technique that is based on Vector Quantization. The new technique, PVQA (Piecewise Vector Quantized Approximation), partitions each sequence into equi-length segments and uses vector quantization to represent each segment by the closest (based on a distance metric) codeword from a codebook of key-sequences. The efficiency of calculations is improved due to the significantly lower dimensionality of the new representation. We demonstrate the utility and efficiency of the proposed technique on real and simulated datasets. By exploiting prior knowledge about the data, the proposed technique generally outperforms PCA and its variants in similarity searches.