Description Usage Arguments Details Value Author(s) References See Also Examples

View source: R/similarityMeasures.R

A function to calculate the longest common subsequence between two trajectories. This function does not calculate translations and only uses the given trajectories and optional translation.

1 2 |

`traj1` |
An m x n matrix containing trajectory1. Here m is the number of points and n is the dimension of the points. |

`traj2` |
A k x n matrix containing trajectory2. Here k is the number of points and n is the dimension of the points. The two trajectories are not required to have the same number of points. |

`pointSpacing` |
An integer value of the maximum index difference between trajectory1 and trajectory2 allowed in the calculation. A negative value sets the point spacing to unlimited. |

`pointDistance` |
A floating point number representing the maximum distance in each dimension allowed for points to be considered equivalent. |

`trans` |
A vector containing translations in each dimension to be applied to trajectory2 in this calculation. |

The LCSS algorithm calculates the largest number of equivalent points between the two trajectories when traversed in a monotone way. If a translation is given then this is applied before the calculation is done. This function is used by all of the the LCSS functions. Please see the references for more information.

An integer value is returned. This represents the maximum LCSS value obtained using the variables provided. If a problem occurs, then a string containing information about the problem is returned.

Kevin Toohey

Vlachos, M., Kollios, G. and Gunopulos, D. (2002) Discovering similar multidimensional trajectories. Paper presented at the Data Engineering, 2002. Proceedings. 18th International Conference on.

`LCSS`

, `LCSSRatio`

, `LCSSRatioCalc`

, `LCSSTranslation`

1 2 3 4 5 6 |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.