Skip to content
Prev 44200 / 398503 Next

Calculate Closest 5 Cases?

A quick and dirty clustering method (I think its due to Hartigan, at
least I recall first seeing it in his book on clustering) is to pick a
random set of seed cases, and then make one pass through the data,
assigning each case to the seed closest to it.  Then you can compute
your distance matrices within the resulting clusters.  You could do
this within the resulting clusters again to reduce the size of the
distance matrix computation, and you would need to check neighboring
"clusters" for close points.

albyn
On Fri, Feb 13, 2004 at 01:40:25PM -0500, Tom Blackwell wrote: