[GRASS-user] Re: algorithm used in i.cluster

[Markus Metz]

On Thu, Apr 22, 2010 at 5:35 PM, Georg Kaspar <georg at muenster.de> wrote:

> Sorry for flooding the list, but i found an interesting note in
> Schowengerdt (2007), p. 400:
>

IMHO, you're welcome:-)

Would you mind assembling all this info in a nice little paragraph including
full references so that the i.cluster manual can be updated?

Thanks,

Markus M


> "The ISODATA algorithm (Ball and Hall, 1967) is a common modification of
> the K-means algorithm and includes merging of clusters if their separation
> is below a threshold, and splitting of a single cluster into two clusters if
> it becomes too large"
>
> The algorithm implemented in the i.cluster module involves merging of
> classes (I_cluster_merge) though no splitting function seems to be
> implemented.
> Since Michael Shapiro stated that he might have used the K-means algorithm,
> I think we can be pretty shure that it is a modified version similar to the
> isodata algorithm, which is described as migrating means in Richards (2006).
>
>
> _______________________________________________
> grass-user mailing list
> grass-user at lists.osgeo.org
> http://lists.osgeo.org/mailman/listinfo/grass-user
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.osgeo.org/pipermail/grass-user/attachments/20100422/2b9ba81d/attachment.html