ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Improved CURE Clustering Algorithm using Shared Nearest Neighbour Technique

Journal: International Journal of Emerging Trends in Engineering Research (IJETER) (Vol.9, No. 2)

Publication Date:

Authors : ;

Page : 151-157

Keywords : Clustering; Nearest neighbours; Random sampling; Representative points; Shared nearest neighbour graph; Similarity matrix.;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

Clustering is the unsupervised learning based grouping of data points based on the similarity between them. Traditional clustering algorithms work well with datasets which have globular/spherical shape. When it comes to non-spherical shaped clusters, they may divide large clusters into small clusters or merge two clusters. CURE(Clustering using REpresentatives) clustering algorithm overcomes the limitations of traditional clustering algorithms for clustering non-globular shaped clusters. CURE algorithm chooses random points as representative points from each cluster and shrinks them towards the centroid of the clusters. The problem arises when data sets do not have a centroid tendency. To resolve this issue, we propose an improved CURE algorithm, where instead of shrinking of representative points, the shared neighbours between the points have been used to form clusters. The representative points which share the same neighbourhood are put together in the same clusters. This allows generating clusters of non-globular shaped clusters. Our neighbourhood based clustering does not get affected by the shape of the clusters. Experimental results of our work demonstrate that CURE clustering using shared nearest neighbours has better performance than CURE

Last modified: 2021-02-19 13:57:22