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

SMIP an Incremental and Parallel Clustering Algorithm Based on Statistics and Morphology

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Zhang Qiang ; Sch. of Electron. Inf. Eng., Tianjin Univ. ; Zhao Zheng ; Yantai Shu

We propose a new clustering algorithm called SMIP. It uses a statistics method to obtain the clustering parameters automatically. Mathematics morphology theory is introduced into clustering to acquire high speed and accuracy. Based on it, we realize incremental clustering and distribution parallel clustering. Our incremental clustering can yield sign speed-up factors for new coming data in an already processed database. Our distribution parallel clustering can be run on a number of workstations connected via network. It is robust and efficient with low overhead. We realized SMIP by Java language. The tests show that SMIP is very efficient with a complexity of O(N), N being the number of points in databases; it is much faster than DBSCAN, it is effective in discovering clusters of arbitrary shape, it is not sensitive to noise, It has some ability to deal with high dimensional points, incremental clustering can speed up the process over 30 times than complete re-clustering, the total overhead of parallel clustering on four workstations is below 13%. SMIP is an ideal clustering method for very large databases

Published in:

Electrical and Computer Engineering, 2006. CCECE '06. Canadian Conference on

Date of Conference:

May 2006

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.