This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | Next revision Both sides next revision | ||
|
teaching:projh402 [2021/09/08 09:09] ezimanyi [MobilityDB on Google Cloud Platform] |
teaching:projh402 [2021/09/18 18:27] ezimanyi [Geospatial Trajectory Similarity Measure] |
||
|---|---|---|---|
| Line 107: | Line 107: | ||
| The goal of this project is to survey the state of the art in geospatial trajectory data cleaning, both model-based and machine learning. The work also includes prototyping and empirically evaluating a selection of these methods in the MobilityDB system, and on different real datasets. These outcomes should serve as a base for a thesis project to enhance geospatial trajectory data cleaning. | The goal of this project is to survey the state of the art in geospatial trajectory data cleaning, both model-based and machine learning. The work also includes prototyping and empirically evaluating a selection of these methods in the MobilityDB system, and on different real datasets. These outcomes should serve as a base for a thesis project to enhance geospatial trajectory data cleaning. | ||
| + | |||
| + | ===== Dynamic Time Warping for Trajectories ===== | ||
| + | |||
| + | The dynamic time warping (DTW) algorithm is able to find the optimal alignment between two time series. It is often used to determine time series similarity, classification, and to find corresponding regions between two time series. Several dynamic time warping implementations are available. However, DTW has a quadratic time and space complexity that limits its use to small time series data sets. Therefore, a fast approximation of DTW have been proposed that has linear time and space complexity. | ||
| + | |||
| + | The goal of this project is to survey and to prototype in MobilityDB the state of art methods in dynamic time warping. | ||
| ===== Geospatial Trajectory Similarity Measure ===== | ===== Geospatial Trajectory Similarity Measure ===== | ||