By Topic

Clustering for Complex and Massive Data

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
$33 $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

4 Author(s)
Hai-Dong Meng ; Inner Mongolia Univ. of Sci. & Technol., Baotou, China ; Yu-Chen Song ; Fei-Yan Song ; Shu-Ling Wang

For applications of clustering algorithms, the key techniques are to handle complicatedly distributed clusters and process massive data effectively and efficiently. On the basis of analysis and research of traditional clustering algorithms, a clustering algorithm based on density and adaptive density-reachable is presented in this paper, which can handle clusters of arbitrary shapes, sizes and densities. For very large databases, such as spatial database and multimedia database, the traditional clustering algorithms are of limitations in validity and scalability. According to the notion of clustering feature of BIRCH, an incremental clustering algorithm is designed and implemented, which solves the problems of effectiveness, space and time complexities of clustering algorithms for very large spatial databases.

Published in:

2009 International Conference on Information Engineering and Computer Science

Date of Conference:

19-20 Dec. 2009