MST Clustering Algorithm Based on Optimized Grid
Jianliang Meng, WeiXiang Cheng · 2008
A MST clustering algorithm based on optimized grid (OGMST) is presented. On one hand,the OGMST dealt with datasets by the way of MST, on the other hand,it resolved the MST algorithm's limitation of unfit for multi-density datasets by the use of parameter automatic grid paritition technique and density threshold method, and it improved the efficiency and precision of the existed clustering algorithms on mult-density datasets. Besides, the OGMST can extract border points effectively. The experiment results show that the OGMST is of good extensible ability and can reduce running-time.