Key points are not available for this paper at this time.
search algorithms. We demonstrate our work on the largest set of time series experiments ever attempted. In particular, the largest dataset we consider is larger than the combined size of all of the time series datasets considered in all data mining papers ever published. We show that our ideas allow us to solve higher-level time series data mining problem such as motif discovery and clustering at scales that would otherwise be untenable. In addition to mining massive datasets, we will show that our ideas also have implications for real-time monitoring of data streams, allowing us to handle much faster arrival rates and/or use cheaper and lower powered devices than are currently possible.
Building similarity graph...
Analyzing shared references across papers
Loading...
Thanawin Rakthanmanon
Bilson Campana
Abdullah Mueen
Brigham and Women's Hospital
Universidade de São Paulo
University of California, Riverside
Building similarity graph...
Analyzing shared references across papers
Loading...
Rakthanmanon et al. (Sun,) studied this question.
www.synapsesocial.com/papers/6a038bcc3f941ed46b57d4df — DOI: https://doi.org/10.1145/2339530.2339576