| Algorithm 3 Birch |
|
Input X input vectors, T Threshold value for CF Tree Output C set of clusters procedure BIRCH for each do find the leaf node for insertion if leaf node is within the threshold condition then add to cluster update CF triples else if there is space for insertion then insert as a single cluster update CF triples else split leaf node redistribute CF features end if end if end for end procedure |