Hi Corrado,
I was thinking about this some more.
Maybe you could use a linear discriminate, i.e. a (hyper)plane that
partitions your points into two sets, such that the misclassification
rate is minimised.
Closeness could be regarded as the number of misclassified points.
Two sets would be dista
Thanks Mario! (Oppure grazie Mario?)
- Can those silhouette coefficients be used for distances between sets or only
for distances point to set?
- Where did you get the other post you attached? It did not come up when I
searched the mailing list!
Best,
On Tuesday 01 December 2009 10:31:47 Ma
silhouette coefficients?
It measure for each point how similar is to its cluster other points and how
dissimilar
from the points of other clusters.
P.N. Tam, M. Steinbach, V. Kumar, Introduction to data mining, Addison-Wesley,
2006 page 541
Hope it helps.
mario
Charlott
Well, here's another naive post from me (hopefully better than the last one).
Firstly I'm not sure computing euclidean distance is that simple. I
would assume temperatures and precipitation would need to be
standardised in some way.
I think the notion of how far away something is, and how distinc
Dear friends,
I have several sets of points in a transformed environmental space. Each set
of points can be represented as a cloud in the environmental space.
This space is spanned by n coordinates, corresponding to the first n PCs of 36
PCs of some environmental variables (12 monthly minimum t
5 matches
Mail list logo