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.
|Titel||Proceedings 2018 IEEE International Conference on Big Knowledge (ICBK)|
|Publikationsstatus||Veröffentlicht - 2018|
|Veranstaltung||2018 IEEE International Conference on Big Knowledge (ICBK) - |
Dauer: 17 Nov. 2018 → 18 Nov. 2018
|Konferenz||2018 IEEE International Conference on Big Knowledge (ICBK)|
|Zeitraum||17/11/18 → 18/11/18|
- Ehemaliges Research Field - Mobility Systems