Divisive/partional clustering. Divisive or partitional clustering algorithms begin with the entire set of data points considered to be in one cluster and then attempt to partition this set [Jain and Dubes, 1988, p.57]. They sometimes are recommended because if they begin with exactly k seeds the complexity of comparison is reduced to O(kN).