<br><br><div class="gmail_quote">On Thu, Apr 22, 2010 at 5:35 PM, Georg Kaspar <span dir="ltr"><<a href="mailto:georg@muenster.de">georg@muenster.de</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">
Sorry for flooding the list, but i found an interesting note in Schowengerdt (2007), p. 400:<br></blockquote><div><br>IMHO, you're welcome:-)<br><br>Would you mind assembling all this info in a nice little paragraph including full references so that the i.cluster manual can be updated?<br>
<br>Thanks,<br><br>Markus M<br><br></div><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">
<br>
"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"<br>
<br>
The algorithm implemented in the i.cluster module involves merging of classes (I_cluster_merge) though no splitting function seems to be implemented.<br>
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).<div>
<div></div><div class="h5"><br>
<br>
_______________________________________________<br>
grass-user mailing list<br>
<a href="mailto:grass-user@lists.osgeo.org" target="_blank">grass-user@lists.osgeo.org</a><br>
<a href="http://lists.osgeo.org/mailman/listinfo/grass-user" target="_blank">http://lists.osgeo.org/mailman/listinfo/grass-user</a><br>
</div></div></blockquote></div><br>