Self-Adaptive -Means Based on a Covering Algorithm

Algorithm 3

(-means|| initialization).

Input:

Output: Initial center set

 Begin

1: ← sample a point uniformly at random from dataset

2:

3: for times do:

4:      ← sample each point independently with probability

5:   C ←

6: end for

7: For , set as the number of points in that are closer to than any other

 point in

8: Recluster the weighted points in into clusters

 End