Authors: Ghazi Al-Naymat
Addresses: Department of Computer Information Systems, College of Computer Science and Information Technology, University of Dammam, Dammam 31441, Saudi Arabia
Abstract: Time series are ubiquitous application domains that generate data including GPS, stock market, and ECG. Researchers concentrate on mining time series data to extract important knowledge and insights. Time series similarity search is a data mining technique that is widely used to compare time series data using similarity measurements, such as dynamic timewarping and Euclidean distance. The large number of sequences dimensions makes the mining process costly. Therefore, we need to extract fewer representative points, hence making the mining process manageable. In this paper, we investigate the application of three dimensionality reduction techniques (random projection, downsampling and averaging) on time series similarity search. Our study has been conducted based on very exhaustive experiments. Results show the performance of the reduction techniques on two similarity measures. Simulation shows that a high similarity matching accuracy can still be achieved after the reduction onto lower dimensions.
Keywords: time series; curse of dimensionality; data mining; similarity search; dimensionality reduction; random projection; downsampling; averaging; similarity measures; simulation; similarity matching.
International Journal of Computer Applications in Technology, 2015 Vol.52 No.1, pp.94 - 105
Published online: 27 Aug 2015 *Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article