Travis Brenden wrote:
> Classification Listserve Members,
>
> I am working on a clustering method that can be applied to digital river
> networks

[skiped]

> My question is whether the Calinski and Harabasz index is useful for
this type
> of application (trying to find an "optimum" number of clusters) or to
see if
> anybody had any other suggestions as to a better stopping rule?  I would
also
> be interested to hear if anybody had other suggestions concerning how to
> cluster only adjoining river reaches.  I have done a number of web
searches for
> a better method but I have always come up empty.  To me, this is a form of
> spatially-constrained clustering, but I have not come across anything
similar
> in other fields.

It's classical task with classical solution: you need only to calc
distance matrix based on the adjoining graph (other distancies are
infinity), and run any stat package (R have a lot of such stuff) for
matrix-based clustering (preferably hierarchical to select optimal number
of classes).

I prefer Ward's method, it gives pretty results.

Best regards,

Anatoly Saveliev

>
> Thanks in advance for any suggestions that might be provided.