Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
A comparison of DFT and DWT based similarity search in time-series databases
Proceedings of the ninth international conference on Information and knowledge management
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Distance Measures for Effective Clustering of ARIMA Time-Series
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
On the need for time series data mining benchmarks: a survey and empirical demonstration
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Identifying similarities, periodicities and bursts for online search queries
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Clustering time series from ARMA models with clipped data
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Time Series Classification Using Gaussian Mixture Models of Reconstructed Phase Spaces
IEEE Transactions on Knowledge and Data Engineering
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Data Mining and Knowledge Discovery
A review on time series data mining
Engineering Applications of Artificial Intelligence
A novel clustering method on time series data
Expert Systems with Applications: An International Journal
Classification of household devices by electricity usage profiles
IDEAL'11 Proceedings of the 12th international conference on Intelligent data engineering and automated learning
ACM Computing Surveys (CSUR)
Classification of time series by shapelet transformation
Data Mining and Knowledge Discovery
Hi-index | 0.00 |
Fast Fourier Transforms (FFTs) have been a popular transformation and compression technique in time series data mining since first being proposed for use in this context in [1]. The Euclidean distance between coefficients has been the most commonly used distance metric with FFTs. However, on many problems it is not the best measure of similarity available. In this paper we describe an alternative distance measure based on the likelihood ratio statistic to test the hypothesis of difference between series. We compare the new distance measure to Euclidean distance on five types of data with varying levels of compression. We show that the likelihood ratio measure is better at discriminating between series from different models and grouping series from the same model.