[GRASS-user] algorithm used in i.cluster

[Georg Kaspar]

hi,

a quote from Markus' "Introduction to GRASS GIS Software" (1998):

"[...] GRASS uses the "minimum distance to means" algorithm for deriving 
the clusters [...]

"minimum distance to means" is described in Lillesand and Kiefer (2000), 
as a supervised classification technique which requires a priori 
information. Does the i.cluster module use a modified version or have 
there been changes since 1998?
the manual page does not contain any further information on how the 
module works...

does anybody know which exact algorithm is used (k-means probably...)?

thanks & regards,
georg