iSAX: indexing and mining terabyte sized time series

Current research in indexing and mining time series data has produced many interesting algorithms and representations. However, it has not led to algorithms that can scale to the increasingly massive datasets encountered in science, engineering, and business domains. In this work, we show how a novel multiresolution symbolic representation can be used to index datasets which are several orders of magnitude larger than anything else considered in the literature. Our approach allows both fast exact search and ultra fast approximate search. We show how to exploit the combination of both types of search as sub-routines in data mining algorithms, allowing for the exact mining of truly massive real world datasets, containing millions of time series. Keywords Time Series, Data Mining, Representations, Indexing

• Type: Conference
• Year: 2008
• Where: KDD
• Authors: Jin Shieh, Eamonn J. Keogh
• Keywords: Data Mining, Data Mining Algorithms, Fast Exact Search, KDD 2008, Mining Time Series