[R-sig-Geo] complete linkage Agglomerative hierarchical clustering, nnclust, spatclus or something else?

[Hans Ekbrand]

On Wed, Apr 21, 2010 at 01:42:05PM +0200, Roger Bivand wrote:
> So you do not want hclust at all, really. Look at dnearneigh() in spdep,  
> setting a 100m bound. Then use n.comp.nb() to see which points belong to  
> which graph component, using perhaps plot.nb with colours to distinguish  
> the subgraphs.

Well, hclust was useful, once I understood how cutree works. What
would be the benefit of dnearneigh(), is it faster?
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 197 bytes
Desc: Digital signature
URL: <https://stat.ethz.ch/pipermail/r-sig-geo/attachments/20100421/161c7af8/attachment.bin>