This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
teaching:projh402 [2020/10/01 12:35] mahmsakr [Geospatial Trajectory Data Cleaning] |
teaching:projh402 [2020/10/01 16:37] ezimanyi [Visualization Moving Objects on the Web] |
||
|---|---|---|---|
| Line 20: | Line 20: | ||
| - | ===== Visualization Moving Objects on the Web ===== | + | ===== Visualization of Moving Objects on the Web ===== |
| <TBD> | <TBD> | ||
| Line 64: | Line 64: | ||
| ===== Geospatial Trajectory Similarity Measure ===== | ===== Geospatial Trajectory Similarity Measure ===== | ||
| + | One of the main functions for a wide range of application domains is to measure the similarity between two moving objects' trajectories. This is desirable for similarity-based retrieval, classification, clustering and other querying and mining tasks over moving objects' data. The existing movement similarity measures can be classified into two classes: (1) spatial similarity that focuses on finding trajectories with similar geometric shapes, ignoring the temporal dimension; and (2) spatio-temporal similarity that takes into account both the spatial and the temporal dimensions of movement data. | ||
| + | The goal of this project is to survey and to prototype in MobilityDB the state of art methods in trajectory similarity. Since it is a complex problem, these outcomes should serve as a base for a thesis project to propose effective and efficient trajectory similarity measures. | ||
| ===== Spatiotemporal k-Nearest Neighbour (kNN) Queries ===== | ===== Spatiotemporal k-Nearest Neighbour (kNN) Queries ===== | ||
| + | An example of continuous kNN is when the GPS device of the vehicle initiates a query | ||
| + | to find the three closest gas stations to the vehicle at any time instant during its trip from source to destination. According to the location of the vehicle, the set of three nearest gas stations can change. The result is thus a set of intervals, where very interval is associated with a set of three gas stations. The challenge in this type of query is to find an efficient incremental way of evaluation. | ||
| + | The goal of the project is to survey the state of art in continuous kNN queries, and to prototype selected methods in MobilityDB. Since it is a complex problem, these outcomes should serve as a base for a more elaborate thesis project. | ||