By Topic

A Novel Clustering Algorithm Based on Circlusters to Find Arbitrary Shaped Clusters

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

4 Author(s)

Clustering is the problem of partitioning a (large) set of data using unsupervised techniques.Today, there exist many clustering techniques. The most important characteristic of a clustering technique is the shape of the cluster it can find. In this paper, we propose a method that is capable to find arbitrary shaped clusters and uses simple geometric constructs, Circlusters. Circlusters are different radius sectored circles. Circlusters can be used to create many hybrid approaches in mixture with density based or partitioning based methods. We also proposed two new clustering methods that are capable to find complex clusters in O(n), where n is the size of the data set. Both of the methods are two phase. In the first phase, circlusters are mined to approximate the shape of the data set. In the second phase, connected circlusters are found to mine the final clusters using different approaches.

Published in:

Computer and Electrical Engineering, 2008. ICCEE 2008. International Conference on

Date of Conference:

20-22 Dec. 2008