Bisecting k-means algorithm starts from a single cluster that contains all points. Iteratively it finds divisible clusters on the bottom level and bisects each of them using k-means, until there are leaf clusters in total or no leaf clusters are divisible.

Code

Results

Model

Prediction