Comparing Trajectory Clustering Methods Save

Comparing Different Clustering Methods and Similarity Metrics on Trajectory Datasets

Project README

Comparing Trajectory Clustering Methods

Update (Feb 2022)

If you have a problem downloading the public dataset described in the demo file, please try this link.

Update (Feb 2022)

I recently published a blog post regarding trajectory clustering. It suplements the repo in a more theoretical level, you may check it out if the general approach is not clear.

Update (Feb 2019)

Added a notebook demonstrating every step of the project. Please look at that first, it is more shorter and understandable than other parts of the project. It also shows these steps on a public dataset.

Public Dataset:

Public Dataset

Clustered Trajectories:

Clustered Trajectories


Introduction

This was my pattern recognition course term project. The goal is to compare 4 clustering algorithms (k-medoids, gaussian mixture model, dbscan and hdbscan) on civil flight data. More detail can be found in report.pdf file.

A snapshot of data

Resulting clusters look like this:

Resulting clusters with one method

Trajectory segmentation is applied to reduce the number of sample points and hausdorff distance is used to compare the similarity between trajectories.

Trajectory Segmentation

Open Source Agenda is not affiliated with "Comparing Trajectory Clustering Methods" Project. README Source: seljukgulcan/comparing-trajectory-clustering-methods

Open Source Agenda Badge

Open Source Agenda Rating