Argument free clustering via boundary extraction for massive point-data Sets
Estivill-Castro, Vladimir, and Lee, Ickjai (2002) Argument free clustering via boundary extraction for massive point-data Sets. Computers, Environment and Urban Systems, 26 (4). pp. 315-334.
Restricted to Repository staff only
Minimizing the need for user-specified arguments results in less costly Geographical Data Mining. For massive data sets, the need to find best-fit arguments in semi-automatic clustering is not the only concern, the manipulation of data to find arguments opposes the philosophy of ‘‘let the data speak for themselves’’ that underpins exploratory data analysis. Our new approach consists of effective and efficient methods for discovering cluster boundaries in point-data sets. Parameters are not specified by users. Rather, values for parameters are revealed from the proximity structures of Voronoi modeling, and thus, an algorithm, AUTOCLUST, calculates them from the Delunay Diagram. We detect clusters of different densities and sparse clusters near to high-density clusters. Multiple bridges linking clusters are identified and removed. All this within O(n log n) time, where n is the number of data points. We contrast AUTOCLUST with algorithms for clustering large georeferenced sets of points. These comparisons confirm the virtues of our approach.
|Item Type:||Article (Refereed Research - C1)|
|Keywords:||Exploratory spatial data analysis, Delaunay Diagram, Clustering, Data mining|
© 2002 Elsevier : This journal is available online - use hypertext links above.
|Date Deposited:||13 Sep 2006|
|FoR Codes:||09 ENGINEERING > 0909 Geomatic Engineering > 090903 Geospatial Information Systems @ 50%
08 INFORMATION AND COMPUTING SCIENCES > 0806 Information Systems > 080604 Database Management @ 50%
|SEO Codes:||89 INFORMATION AND COMMUNICATION SERVICES > 8902 Computer Software and Services > 890201 Application Software Packages (excl. Computer Games) @ 100%|