Skip to main content
. 2022 Nov 17;24(11):1678. doi: 10.3390/e24111678
Algorithm 3 Birch
    Input
          X     input vectors, {x→1,x→2,…,x→n}
          T     Threshold value for CF Tree
    Output
          C     set of clusters
    procedure BIRCH
          for each x→i∈X do
                find the leaf node for insertion
                if leaf node is within the threshold condition then
                      add x→i to cluster
                      update CF triples
                else
                      if there is space for insertion then
                            insert x→i as a single cluster
                            update CF triples
                      else
                            split leaf node
                            redistribute CF features
                      end if
                end if
          end for
    end procedure