A Spatial Clustering Algorithm Based on Minimum Spanning Tree-like

The concept of edge variation factor is firstly defined based upon the distance variation among the entities in the spatial neighborhood.An approach is presented to construct the minimum spanning tree-like(MST-L for short).Further,a MST-L based spatial clustering algorithm(MSTLSC for short) is developed.Two tests are implemented to demonstrate that the MSTLSC algorithm very robust and suitable to find the clusters with arbitrary shape,especially the algorithm has good adaptive characteristic.A comparative test is made to prove the MSTLSC algorithm better than classic DBSCAN algorithm.