Time series discord discovery based on R*-tree

Abstract

In this paper, we propose a new algorithm for time series discord discovery based on R*-tree. Our method is time and space efficient because it only saves Minimum Bounding Rectangles (MBR) of data in memory and needs a single scan over the entire time series database and a few times to read the original disk data in order to validate the results. The experimental results showed that our proposed algorithm outperforms the popular method, Hot SAX, in term of runtime and efficiency.