Research Article

Self-Adaptive -Means Based on a Covering Algorithm

Algorithm 4

(CA initialization).
Input:
Output: Results of parallel covering with granularity analysis–A set of clusters
Begin
1: center
2: Set
3:  do
4:   center get_center(Cu)
5:   radius r ← get_weight_radius(,Cu)
6:   Covering Cform=get_covering(,r,Cu)
7:   c ← get_centroid(Cform)
8:   r ← get_weight_radius(,Cu)
9:     Covering Clast=get_covering(,r,Cu)
10:    whileClast.subtractByKey(Cform)>0
11:      CformClast
12:       ← get_centroid(Cform)
13:      r ← get_radius_centroid(,Cu)
14:      Clast=get_covering(,r,Cu)
15:    end while
16: while ()
17:   Do Split Operation
18:   Do Merge Operation
19: return
End