Mitigating the influence of the curse of dimensionality on time series similarity measures Online publication date: Thu, 27-Aug-2015
by Ghazi Al-Naymat
International Journal of Computer Applications in Technology (IJCAT), Vol. 52, No. 1, 2015
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook