Compute a clustering on a sparse symmetric distance matrix using graph cutting.
an object of class
the distance threshold.
This function computes a clustering on an object of class
by cutting the graph induced by the threshold
beta into all
disconnected subgraphs (the clusters). Two nodes are connected by a
link if their distance is below the specified threshold. Note that
the threshold is not strict, i.e.
Note that distances of value
NaN are ignored.
This is not strictly correct but avoids computing 2^k possible
solutions if there are k
The time complexity is O(n^2) with n the number of rows/columns.
A factor of cluster labels (indexed 1,2,...,k).
Fixme: can the time complexity be improved?
1 2 3 4 5 6 7 8 9
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.