Development and evaluation of efficient kNN search of time series subsequences using the example of the Google Ngram data set

Aus SDQ-Institutsseminar
Version vom 27. September 2023, 14:50 Uhr von Erik Burger (Diskussion | Beiträge) (Änderung 2727 von Jv1963 (Diskussion) rückgängig gemacht.)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Vortragende(r) Janek Bettinger
Vortragstyp Proposal
Betreuer(in) Jens Willkomm
Termin Fr 18. August 2017
Kurzfassung There are many data structures and indices that speed up kNN queries on time series. The existing indices are designed to work on the full time series only. In this thesis we develop a data structure that allows speeding up kNN queries in an arbitrary time range, i.e. for an arbitrary subsequence.