Cart (Loading....) | Create Account
Close category search window
 

Effective and efficient boundary-based clustering for three-dimensional geoinformation studies

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lee, I. ; Dept. of Comput. Sci., Newcastle Univ., NSW, Australia ; Estivill-Castro, V.

Due to their inherent volumetric nature, underground and marine geoinformation studies and even astronomy demand clustering techniques capable of dealing with three-dimensional data. However, most robust and exploratory spatial clustering approaches for GIS only consider two dimensions. We extend robust argument-free two-dimensional boundary-based clustering (Estivill-Castro and Lee, 2000) to three dimensions. The progression to 3D demands manipulation of one argument from users and the encoding of proximity and density information in different proximity graphs. Fortunately, the input argument allows exploration of weaknesses in clusters, and detection of regions for potential merge or split. We also provide an effective heuristic to obtain good initial values for the input argument. This maximizes user friendliness and minimizes exploration time. Experimental results demonstrate that for two popular proximity graphs (Delaunay tetrahedrization and undirected k-nearest neighbor graph) our approach is robust to the presence of noise and is able to detect high-quality, volumetric clusters for complex situations such as non-convex clusters, clusters of different densities and clusters of different sizes

Published in:

Cooperative Database Systems for Advanced Applications, 2001. CODAS 2001. The Proceedings of the Third International Symposium on

Date of Conference:

2001

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.