A novel iterative partitioning approach for building prime clusters
by Sreeja Ashok; M.V. Judy
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 7, No. 3/4, 2015

Abstract: Cluster analysis is an iterative process of knowledge discovery by segregating the data objects into significant and logical groups. An efficient clustering algorithm will produce groups of similar objects which are tightly bonded within the groups and independent between groups. In this paper, we propose a new iterative, non-parametric, partitioning clustering algorithm called prime equivalence clustering algorithm (PECA) based on computation of distance to subsets of attributes where object values are closer. The right number of clusters and the final partition of the datasets are automatically determined without any prior knowledge. The performance of this algorithm has been studied on benchmark datasets and it is proven better than the well-known clustering algorithms.

Online publication date: Wed, 16-Dec-2015

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 Advanced Intelligence Paradigms (IJAIP):
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