[R] classification algorithms with distance matrix

From: sidahmed BENABDERRAHMANE <sidahmed.benabderrahmane_at_loria.fr>
Date: Mon, 07 Jun 2010 18:05:59 +0200


Dear all,

I have a problem when using some classification functions (Kmeans, PAM, FANNY...) with a distance matrix, and i would to understand how it proceeds for the positioning of centroids after one execution step.

In fact, in the classical formulation of the algorithm, after each step, to re-position the center, it calculates the distance between any elements of the old cluster and its center, or in my case I used a distance matrix , so I do not understand how the algorithm can recalculates the distance between the newly generated center and other elements of the cluster knowing that the new center does not appear in the distance matrix and there is no way to calculate the distance between him and the elements of a cluster. ?

Thank you for your help.

Sid., LORIA
France.



R-help_at_r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-help PLEASE do read the posting guide http://www.R-project.org/posting-guide.html and provide commented, minimal, self-contained, reproducible code. Received on Mon 07 Jun 2010 - 20:52:09 GMT

Archive maintained by Robert King, hosted by the discipline of statistics at the University of Newcastle, Australia.
Archive generated by hypermail 2.2.0, at Mon 07 Jun 2010 - 21:20:28 GMT.

Mailing list information is available at https://stat.ethz.ch/mailman/listinfo/r-help. Please read the posting guide before posting to the list.

list of date sections of archive