An adaptive spatial clustering algorithm based on the minimum spanning tree-like

Min Deng; Qiliang Liu; Guangqiang Li; Tao Cheng

doi:10.1117/12.838295

15 October 2009 An adaptive spatial clustering algorithm based on the minimum spanning tree-like

Min Deng, Qiliang Liu, Guangqiang Li, Tao Cheng

Proceedings Volume 7492, International Symposium on Spatial Analysis, Spatial-Temporal Data Modeling, and Data Mining; 74921Z (2009) https://doi.org/10.1117/12.838295
Event: International Symposium on Spatial Analysis, Spatial-temporal Data Modeling, and Data Mining, 2009, Wuhan, China

Abstract

Spatial clustering is an important means for spatial data mining and spatial analysis, and it can be used to discover the potential rules and outliers among the spatial data. Most existing spatial clustering methods cannot deal with the uneven density of the data and usually require predefined parameters which are hard to justify. In order to overcome such limitations, we firstly propose the concept of edge variation factor based upon the definition of distance variation among the entities in the spatial neighborhood. Then, an approach is presented to construct the minimum spanning tree-like (MST-L). Further, an adaptive MST-L based spatial clustering algorithm (AMSTLSC) is developed in this paper. The spatial clustering algorithm only involves the setting of the threshold of edge variation factor as an input parameter, which is easily made with the support of little priori information. Through this parameter, a series of MST-L can be automatically generated from the high-density region to the low-density one, where each MST-L represents a cluster. As a result, the algorithm proposed in this paper can adapt to the change of local density among spatial points. This property is also called the adaptiveness. Finally, two tests are implemented to demonstrate that the AMSTLSC algorithm is very robust and suitable to find the clusters with different shapes. Especially the algorithm has good adaptiveness. A comparative test is made to further prove the AMSTLSC algorithm better than classic DBSCAN algorithm.

Citation Download Citation

Min Deng, Qiliang Liu, Guangqiang Li, and Tao Cheng "An adaptive spatial clustering algorithm based on the minimum spanning tree-like", Proc. SPIE 7492, International Symposium on Spatial Analysis, Spatial-Temporal Data Modeling, and Data Mining, 74921Z (15 October 2009); https://doi.org/10.1117/12.838295

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available