Abstract
We propose a new gravitational based hierarchical
clustering algorithm using kd- tree. kd- tree generates densely
populated packets and finds the clusters using gravitational
force between the packets. Gravitational based hierarchical
clustering results are of high quality and robustness. Our
method is effective as well as robust. Our proposed algorithm
is tested on synthetic dataset and results are presented.
Users
Please
log in to take part in the discussion (add own reviews or comments).