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) - Published Version
Restricted to Repository staff only

DOI: 10.1007/s10707-006-0340-x

View at Publisher Website: http://dx.doi.org/10.1007/s10707-006-034...

Abstract

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 ID:	4577
Item Type:	Article (Research - C1)
ISSN:	1573-7624
Keywords:	cluster polygonization; patterns and clusters; Delaunay Diagram; geographical data mining
Date Deposited:	15 Jun 2009 01:10
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%
	More Statistics

Actions (Repository Staff Only)

Item Control Page