UNITED STATES
A Density Based Algorithm for Discovering Density Varied Clusters in Large Spatial Databases
|
10.5120/739-1038 |
Anant Ram, Sunita Jalal, Anand S Jalal and Manoj Kumar. Article:A Density Based Algorithm for Discovering Density Varied Clusters in Large Spatial Databases. International Journal of Computer Applications 3(6):1–4, June 2010. Published By Foundation of Computer Science. BibTeX
@article{key:article,
author = {Anant Ram and Sunita Jalal and Anand S. Jalal and Manoj Kumar},
title = {Article:A Density Based Algorithm for Discovering Density Varied Clusters in Large Spatial Databases},
journal = {International Journal of Computer Applications},
year = {2010},
volume = {3},
number = {6},
pages = {1--4},
month = {June},
note = {Published By Foundation of Computer Science}
}
Abstract
DBSCAN is a base algorithm for density based clustering. It can detect the clusters of different shapes and sizes from the large amount of data which contains noise and outliers. However, it is fail to handle the local density variation that exists within the cluster. In this paper, we propose a density varied DBSCAN algorithm which is capable to handle local density variation within the cluster. It calculates the growing cluster density mean and then the cluster density variance for any core object, which is supposed to be expended further, by considering density of its -neighborhood with respect to cluster density mean. If cluster density variance for a core object is less than or equal to a threshold value and also satisfying the cluster similarity index, then it will allow the core object for expansion. The experimental results show that the proposed clustering algorithm gives optimized results.
Reference
-
Jain, A.K., Dubes, R.C. 1998. Algorithm for Clustering Data. Printice Hall Englewood cliffs NJ
Han, J., Kamber, M. 2001. Data Mining: Concepts and Techniques. Morgan Kaufman
Ester, M., Kriegel, H.P., Sander, J., Xu, X. 1996. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In Proc. KDD,
Ankerst, M., Breunig, M., Kriegel, H.P., Sander, J. 1999. OPTICS: Ordering Objects to Identify the Clustering Structure. In proceedings of International Conference on Management of Data ACM SIGMOD. pp. 49–60.
Hinneburg, A., Keim, D. 1998. DENCLUE: An efficient approach to clustering in large multimedia data sets with noise. In proceedings of 4th International Conference on Knowledge Discovery and Data Mining. pp. 58–65.
Ram, A., Sharma, A., Jalal, A.S., Singh, R., agrawal, A. 2009. An Enhanced Density Based Spatial Clustering of Application with Noise. In proceedings of IEEE International Advance Computing Conference. pp.1475-1478
Borach, B., Bhattacharya, D.K. 2007. A Clustering Technique using Density Difference. In proceedings of International Conference on Signal Processing, Communications and Networking. pp. 585–588.
Borah, B., Bhattacharyya, D.K. 2008. DDSC:A Density Differentiated Spatial Clustering Technique, Journal of Computers. Vol. 3, No. 2.
Peng Liu, Dong Zhou, Naijun Wu. 2007. VDBSCAN: Varied Density Based Spatial Clustering of Applications with Noise, In proceedings of IEEE Conference ICSSSM2007, pp.528-531.
