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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.