liyingben/LcssAlgorithm

This project enables to study the problem of finding similarity between trajectories (trajectory similarity problem) which is a known problem in the field of Data Mining. The algorithm called to deploy and solves the above problem is the LCSS(Longest Common Subsequence). Each orbit is described by a sequence geographical points (latidute, longitude). Each record dataset that we are given represents a path of a taxi that has taken place in the city of Beijing. Each line of the file contains the following separated by commas: taxi id, timestamp, latitude, longitude.

Mathematica