Modified CURE algorithm with enhancement to identify number of clusters
by Alka Tripathi; Kirtee Panwar
International Journal of Artificial Intelligence and Soft Computing (IJAISC), Vol. 5, No. 3, 2016

Abstract: In this paper, we present an effective way of identifying number of clusters (k) based on density of data in given dataset and optimality of clusters formed. We have used internal evaluation of clustering to choose optimal set of clusters after narrowing the selection space to a small ideal range. This range is identified by partitioning dataset into a number of partitions using kd-tree so that partitions created contains densely packed data objects. We have used the concept of multi-representative points of a cluster in partitioning and evaluation of clustering and implemented it by modifying CURE algorithm. In this paper, linear transformation method (PCA) is applied to reduce high dimensional data into lower dimensions.

Online publication date: Mon, 22-Aug-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Artificial Intelligence and Soft Computing (IJAISC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com