On Wed, Apr 21, 2010 at 03:14:46PM +0200, Roger Bivand wrote: > On Wed, 21 Apr 2010, Hans Ekbrand wrote:
[...] >> Well, hclust was useful, once I understood how cutree works. What >> would be the benefit of dnearneigh(), is it faster? >> > > For larger data sets, hclust needs a triangular distance matrix, > dnearneigh does not. Finding graph components in the output "nb" object > also seems conceptually more direct. OK, good to know if I run into trouble when using the code on larger data-sets later on.
signature.asc
Description: Digital signature
_______________________________________________ R-sig-Geo mailing list R-sig-Geo@stat.math.ethz.ch https://stat.ethz.ch/mailman/listinfo/r-sig-geo
