Fast cluster polygonization and its applications in data-rich environments
Lee, Ickjai, and Estivill-Castro, Vladimir (2006) Fast cluster polygonization and its applications in data-rich environments. Geoinformatica, 10 (4). pp. 399-422.
|PDF (Published Version) - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
View at Publisher Website: http://dx.doi.org/10.1007/s10707-006-034...
We develop a linear time method for transforming clusters of 2D-point data into area data while identifying the shape robustly. This method translates a data layer into a space filling layer where shaped clusters are identified as the resulting regions. The method is based on robustly identifying cluster boundaries in point data using the Delaunay Diagram. The method can then be applied to modelling point data, to displaying choropleth maps of point data without a reference map, to identifying association rules in the spatial dimension for geographical data mining, or to measuring a gap between clusters for cluster validity.
|Item Type:||Article (Refereed Research - C1)|
|Keywords:||cluster polygonization; patterns and clusters; Delaunay Diagram; geographical data mining|
|SEO Codes:||89 INFORMATION AND COMMUNICATION SERVICES > 8902 Computer Software and Services > 890299 Computer Software and Services not elsewhere classified @ 60%|
89 INFORMATION AND COMMUNICATION SERVICES > 8999 Other Information and Communication Services > 899999 Information and Communication Services not elsewhere classified @ 40%
|Deposited On:||15 Jun 2009 11:10|
|Last Modified:||20 May 2013 00:40|
Last 12 Months: 0
|Citation Counts with External Providers:||Web of Science: 3|
Repository Staff Only: item control page