Description Usage Arguments Details
The algorithm has its basis in the assumptions that cluster centers are surrounded by neighbors with lower local density and that they are at a relatively large distance from any points with a higher local density.
1 | fast_density(trajectory, d_threshold)
|
trajectory |
A projected sf points dataframe representing a trajectory. |
d_threshold |
A distance (in units of the projection system) to include in the cluster search. |
For each data point 'i', we compute two quantities: its local density 'rho_i' and its distance 'delta_i' from points of higher density. Both these quantities depend only on the distances Embedded Image between data points, which are assumed to satisfy the triangular inequality. The local density Embedded Image of data point Embedded Image is defined as
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.