Let xi be a member of X patterns.
- Find distance between all pairs of patterns in X.
- Suppose the smallest distance is between pattern xi and xj, then replace
them by Ci, equal to the average of xi and xj.
- Go back to step1.
- If the smallest distance is between xk and Cj then replace by Ck,
or if the smallest distance is betwen Ci and Cj, then replace by a new
C.
- Go back to step 3, until no more xi.
|