This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2012 IEEE 12th International Conference on Data Mining Workshops
Approximate Search on Massive Spatiotemporal Datasets
Brussels, Belgium Belgium
December 10-December 10
ISBN: 978-1-4673-5164-5
Efficient time series similarity search is a fundamental operation for data exploration and analysis. While previous work has focused on indexing progressively larger datasets and has proposed data structures with efficient exact search algorithms, we motivate the need for approximate query methods that can be used in interactive exploration and as fast data analysis subroutines on large spatiotemporal datasets. We formulate a simple approximate range query problem for time series data, and propose a method that aims to quickly access a small number of high quality results of the exact search result set. We propose an evaluation strategy on the query framework when the false dismissal class is very large relative to the query result set, and investigate the performance of indexing novel classes of time series subsequences.
Index Terms:
Time series analysis,Search problems,Approximation methods,Indexing,Vegetation,Runtime,data analysis,time series,similarity search,earth science,rare class
Citation:
Ivan Brugere, Karsten Steinhaeuser, Shyam Boriah, Vipin Kumar, "Approximate Search on Massive Spatiotemporal Datasets," icdmw, pp.773-780, 2012 IEEE 12th International Conference on Data Mining Workshops, 2012
Usage of this product signifies your acceptance of the Terms of Use.