Research Article
Comparative Study of Density based Clustering Algorithms
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 27 - Issue 11 |
| Published: August 2011 |
| Authors: Pooja Batra Nagpal, Priyanka Ahlawat Mann |
10.5120/3341-4600
|
Pooja Batra Nagpal, Priyanka Ahlawat Mann . Comparative Study of Density based Clustering Algorithms. International Journal of Computer Applications. 27, 11 (August 2011), 44-47. DOI=10.5120/3341-4600
@article{ 10.5120/3341-4600,
author = { Pooja Batra Nagpal,Priyanka Ahlawat Mann },
title = { Comparative Study of Density based Clustering Algorithms },
journal = { International Journal of Computer Applications },
year = { 2011 },
volume = { 27 },
number = { 11 },
pages = { 44-47 },
doi = { 10.5120/3341-4600 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2011
%A Pooja Batra Nagpal
%A Priyanka Ahlawat Mann
%T Comparative Study of Density based Clustering Algorithms%T
%J International Journal of Computer Applications
%V 27
%N 11
%P 44-47
%R 10.5120/3341-4600
%I Foundation of Computer Science (FCS), NY, USA
Abstract
This paper presents a comparative study of three Density based Clustering Algorithms that are DENCLUE, DBCLASD and DBSCAN. Six parameters are considered for their comparison. Result is supported by firm experimental evaluation. This analysis helps in finding the appropriate density based clustering algorithm in variant situations.
References
- A.K. Jain and R. C. Dubes, Algorithms for Clustering Data. Englewood Cliffs, NJ: Prentice-Hall, 1988.
- Ester M. Kriegel H.-P., Xu X.: “Knowledge Discovery in Large Spatial Databases: Focusing Techniques for efficient Class Identification”, Proc. 4th Int. Symp. on large Spatial Databases, Portland, ME, 1995, in: Lecture Notes In Computer Science, Vol. 951, Springer, 1995, pp. 67-82.
- XU, X., ESTER, M., KRIEGEL, H.-P., and SANDER, J. 1998. A distribution-based clustering algorithm for mining in large spatial databases. In Proceedings of the 14th ICDE, 324-331, Orlando, FL.
- 10A. K. Jain, M. N. Murty and P. J. Flynn, Data clustering: a review, CM, 31 (1999), pp. 264–323.
- A. Hinneburg and D. Keim, “An efficient approach to clustering Large multimedia databases with noise,” in Proc. 4th Int. Conf. Knowledge Discovery and Data Mining (KDD’98), 1998, pp. 58–65.
- Linsay I Smith, “A tutorial on Principal components Analysis”,Retrived June 10,2007, http://csnet.otago.ac.nz/cosc453/stydent_tutorials/principal_components.pdf , pp.12-20
- McCallum, A, K. Nigam, and L.H. Ungar. Efficient Clustering of High-dimensional Data Sets with Application to Reference Matching. in Knowledge Discovery and Data Mining. 2000.
- Rijsbergen, C.J.v., Information Retrieval. 1975: Butter Worths
- Steinbach,M.,G. Karypis, and V. Kumar. A comparison of document clustering techniques in Text Mining workshop,KDD 2000
- Zhao, Y. and G. Karypis. Evaluation of Hierarchical Clustering Algorithms for Document Datasets. in CIKM. 2002. McLean, Viginia.
Index Terms
Keywords