A Clustering Algorithm based on Local Density of Points
Ahmed Fahim · International Journal of Modern Education and Computer Science · 2017
Data clustering is very active and attractive research area in data mining; there are dozens of clustering algorithms that have been published.Any clustering algorithm aims to classify data points according to some criteria.DBSCAN is the most famous and well-studied algorithm.Clusters are recorded as dense regions separated from each other by spars regions.It is based on enumerating the points in Epsneighborhood of each point.This paper proposes a clustering method based on k-nearest neighbors and local density of objects in data; that is computed as the total of distances to the most near points that affected on it.Cluster is defined as a continuous region that has points within local densities fall between minimum local density and maximum local density.The proposed method identifies clusters of different shapes, sizes, and densities.It requires only three parameters; these parameters take only integer values.So it is easy to determine.The experimental results demonstrate the superior of the proposed method in identifying varied density clusters.