Algorithm of divisive hierarchical clustering is as follows.
a)
Primarily initiate the process with one cluster containing
all the samples
b)
Select  a  cluster  with  the  widest  diameter  as  the  largest
cluster.
c)
Detect the data point in the cluster found in step b) with
the minimum average similarity to the other elements in
that cluster.
d)
The  data  sample  found  in  c)  is  the  first  element  to  be
added to the fragment group
e)
Detect  the  element  in  the  original  group  which  reports
the highest average similarity with the fragment group;
f)
If  the  average  similarity  of  element  detected  in  e)  with
the fragment group is greater than its average similarity
with the original group then assign the data sample to the
fragment group and go to Step e; otherwise do nothing;
g)
Repeat Step b
–
 Step f until each data point is separated
into individual clusters [19].
Complexity of divisive hierarchical clustering algorithm is
O(2n) [17]