Algorithm 2. Pseudo-code of the Build Phase

1. repeat

2.  for a := 1 → N do        /* Find Minimum Sum */

3.   Select Xa as temporary Medoid

4.   for i := 1 → N do

5.    for each Medoid selected yet (including Xa) do

6.     Find the minimum Euclidean distance b/w Xi and Medoid

7.    endfor

8.    Find sum of minimum distances

9.   endfor

10.    Find minimum sum

11.  endfor

12.  Select Xa as actual Medoid for which the sum is minimum    /* Select Initial Medoid */

13. until ‘K’ initial Medoids are selected