Message-ID: <20100421132429.GB10970@samir>
Date: 2010-04-21T13:24:30Z
From: Hans Ekbrand
Subject: complete linkage Agglomerative hierarchical clustering, nnclust, spatclus or something else?
In-Reply-To: <alpine.LRH.2.00.1004211511280.2367@reclus.nhh.no>
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.
-------------- 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/2f074037/attachment.bin>