By Topic

A Scalable Grid-Based Clustering Algorithm for Very Large Spatial Databases

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)
Yufen Sun ; Coll. of Comput. Sci. & Technol., Huazhong Univ. of Sci. & Technol. ; Yansheng Lu

Many applications require the management of spatial data in very large spatial databases. We propose a grid-based clustering algorithm to process spatial data. This algorithm uses a grid-based method to identify data that are compressible and data that must be maintained in memory. Thus the algorithm compresses data without decreasing the quality of clustering. Through one scan over a database, our algorithm can obtain accurate clustering results with limited memory. The performance study on very large datasets demonstrates the effectiveness and efficiency of our algorithm

Published in:

Computational Intelligence and Security, 2006 International Conference on  (Volume:1 )

Date of Conference:

Nov. 2006