Improved Clustering Algorithm Based on Density-Isoline

Bin Yan; Guangming Deng

doi:10.4236/ojs.2015.54032

Home > Journals > Physics & Mathematics > OJS

Open Journal of Statistics > Vol.5 No.4, June 2015

Improved Clustering Algorithm Based on Density-Isoline ()

Bin Yan, Guangming Deng

College of Science, Guilin University of Technology, Guilin, China.

DOI: 10.4236/ojs.2015.54032 PDF HTML XML 2,610 Downloads 3,105 Views Citations

Abstract

An improved clustering algorithm was presented based on density-isoline clustering algorithm. The new algorithm can do a better job than density-isoline clustering when dealing with noise, not having to literately calculate the cluster centers for the samples batching into clusters instead of one by one. After repeated experiments, the results demonstrate that the improved density-isoline clustering algorithm is significantly more efficiency in clustering with noises and overcomes the drawbacks that traditional algorithm DILC deals with noise and that the efficiency of running time is improved greatly.

Keywords

Density-Isolines, Density-Based Clustering, Clustering Algorithm, Noise

Share and Cite:

Yan, B. and Deng, G. (2015) Improved Clustering Algorithm Based on Density-Isoline. Open Journal of Statistics, 5, 303-310. doi: 10.4236/ojs.2015.54032.

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1]	Han, J. and Kamber, M. (2006) Data Mining Concepts and Techniques. 2nd Edition, Margan Kaufmann Publishers, San Francisco.
[2]	Macqueen, J. (1967) Some Methods for Classification and Analysis of Multivariate Observations. Fifth Berkeley Symposium on Mathematic Statistics and Probability, University of California Press, Berkeley, 666.
[3]	Guha, S., Rastogi, R. and Shim. K, (2001) Cure: An Efficient Algorithm for Large Databses. Information Systems, 26, 35-58. http://dx.doi.org/10.1016/S0306-4379(01)00008-4
[4]	Ester, M., Kriegel, H.P., Sander, J. and Xu, X. (1996) A Density Based Algorithm for Discover Clusters in Large Spatial Datasets with Noise. Proceedings of International Conference on Knowledge Discovery and Data Mining, 226-231.
[5]	Ankerst, M., Breunig, M.M., Kriegel, H.-P. and Sand, J. (1999) OPTICS: Ordering Points to Identify the Clustering Structure. SIGMOD Conference, 28, 49-60. http://dx.doi.org/10.1145/304182.304187
[6]	Nanda, S.J. and Panda, G. (2014) Desugn of Computationally Efficient Density-Based Clustering Algorithms. Data & Knowledge Engineering, 1-16.
[7]	Zhao, Y.C., Xie, F. and Sun, J.D. (2002) DILCA: Clustering Algorithm Based on Density-Isoline. Journal of Beijing University of Posts and Telecommunications, 25, 8-1.