Abstract
Detection of similar representations of a given query time series within longer time series is an important task in many applications such as finance, activity research, text mining and many more. Identifying time warped instances of different lengths but similar shape within longer time series is still a difficult problem. We propose the novel Caterpillar algorithm which fuses the advantages of Dynamic Time Warping (DTW) and the Minimum Description Length (MDL) principle to move a sliding window in a crawling-like way into the future and past of a time series. To demonstrate the wide field of application and validity, we compare our method against stateof-the-art methods on accelerometer time series and synthetic random walks. Our experiments demonstrate that Caterpillar outperforms the comparison methods in detecting accelerometer signals of metro stops.
Original language | English |
---|---|
Title of host publication | 9th IEEE International Conference on Big Knowledge : ICBK 2018 : proceedings : 17-18 November 2018, Singapore |
Editors | Ong Yew Soon, Huanhuan Chen, Xindong Wu, Charu Aggarwal |
Place of Publication | Piscataway, NJ |
Publisher | IEEE |
Pages | 423-431 |
Number of pages | 9 |
ISBN (Electronic) | 978-1-5386-9125-0 |
ISBN (Print) | 978-1-5386-9126-7 |
DOIs | |
Publication status | Published - 17 Nov 2018 |
Event | ICBK 2018: IEEE International Conference on Big Knowledge - Singapur, Singapore Duration: 17 Nov 2018 → 18 Nov 2018 http://web.science.mq.edu.au/~jiawu/ICBK/index.html |
Conference
Conference | ICBK 2018: IEEE International Conference on Big Knowledge |
---|---|
Country/Territory | Singapore |
City | Singapur |
Period | 17/11/18 → 18/11/18 |
Internet address |
Austrian Fields of Science 2012
- 102033 Data mining
Keywords
- Accelerometer Data
- Dynamic Time Warping
- Minimum Description Length