Skip to content
Prev 132623 / 398506 Next

Finding overlaps in vector

This may not be as direct as Jim's in terms of specifying granularity but
will uses conventional hierarchical clustering to create the clusters and also
draws a nice dendrogram for you.   I have split the dendrogram at a
height of 0.5
to define the clusters but you can change that to whatever granularity you like:
[1] 8
[1] 7.0 7.1
[1] 6.00 6.45
[1] 5
[1] 3.00 3.25 3.33 3.75 4.10
[1] 2
[1] 1
[1] 0.00 0.45
1    1    2    3    4    4    4    4    4    5    6    6    7    7    8
0.00 0.45 1.00 2.00 3.00 3.25 3.33 3.75 4.10 5.00 6.00 6.45 7.00 7.10 8.00
On Dec 21, 2007 4:56 AM, Johannes Graumann <johannes_graumann at web.de> wrote: