An Adaptive Sweep-Circle Spatial Clustering Algorithm Based on Gestalt

An adaptive spatial clustering (ASC) algorithm is proposed in this present study, which employs sweep-circle techniques and a dynamic threshold setting based on the Gestalt theory to detect spatial clusters. The proposed algorithm can automatically discover clusters in one pass, rather than through...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:ISPRS international journal of geo-information Ročník 6; číslo 9; s. 272
Hlavní autoři: Zhan, Qingming, Deng, Shuguang, Zheng, Zhihua
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.09.2017
Témata:
Adaptive algorithms
Algorithms
Clustering
Clusters
Data
data collection
data stream
Data transmission
Delaunay triangulation
Dynamic characteristics
Economic models
Gestalt theory
Mathematical models
spatial clustering
Spatial data
sweep-circle
trees
Voronoi graphs
ISSN:2220-9964, 2220-9964
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:An adaptive spatial clustering (ASC) algorithm is proposed in this present study, which employs sweep-circle techniques and a dynamic threshold setting based on the Gestalt theory to detect spatial clusters. The proposed algorithm can automatically discover clusters in one pass, rather than through the modification of the initial model (for example, a minimal spanning tree, Delaunay triangulation, or Voronoi diagram). It can quickly identify arbitrarily-shaped clusters while adapting efficiently to non-homogeneous density characteristics of spatial data, without the need for prior knowledge or parameters. The proposed algorithm is also ideal for use in data streaming technology with dynamic characteristics flowing in the form of spatial clustering in large data sets.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2220-9964
2220-9964
DOI:10.3390/ijgi6090272