期刊名称：International Journal of Advanced Research In Computer Science and Software Engineering
印刷版ISSN：2277-6451
电子版ISSN：2277-128X
出版年度：2013
卷号：3
期号：3
出版社：S.S. Mishra
摘要：Clustering in data mining is a discovery process that groups a set of data objects so that the inter-cluster similarity is minimized and intra- cluster similarity is maximized. In presence of noise and outlier in high dimensional data base it is a difficult task to find out the clusters of different shapes, sizes and differ in density. Density based clustering algorithms like DBSCAN finds the clusters based on density property but still within the same cluster the major density difference ma y exist due to the only minimum point value. In this paper we propose a Local density differ clustering algorithm which capable to handle the local density variation within the cluster. It calculates the density variance in its surrounding and if any core object that have the density variance less than a given threshold value K than that core object can start the formation of cluster. The proposed clustering algorithm generates more density based homogenous cluster in comparison to DBSCAN
关键词：Core objects; minimum points; density variance; radius; threshold value K
