Georg Kaspar schrieb:
the steps described in
http://download.osgeo.org/grass/grass6_progman/c__exec_8c_source.html
seem to fit the migrating means algorithm described in richards and jia
(2006) and based on the isodata algorithm in ball and hall (1965):
which is in principle the same as k-means.
I wrote a mail to Michael Shapiro, who wrote the code back in the 90's
and received this answer:
Georg,
It has been a very long time since I wrote that code so my memory may be
suspect, but I think that is correct.
----- Original Message -----
From: "Georg Kaspar" <[email protected]>
To: [email protected]
Sent: Thursday, April 22, 2010 10:09:57 AM
Subject: algorithm used in GRASS module i.cluster
Dear Mr Shapiro,
for my diploma thesis I need to know the algorithm implemented in the
GRASS GIS module "i.cluster". I had a quick look at the source code and
think that it uses an iterative process similar to k-means clustering.
Can you confirm this assumption?
Thank you very much in advance!
best regards,
Georg Kaspar
_______________________________________________
grass-user mailing list
[email protected]
http://lists.osgeo.org/mailman/listinfo/grass-user
