CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Comparative Study of Density based Clustering Algorithms

by Pooja Batra Nagpal, Priyanka Ahlawat Mann
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 27 - Number 11
Year of Publication: 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 },
issue_date = { August 2011 },
volume = { 27 },
number = { 11 },
month = { August },
year = { 2011 },
issn = { 0975-8887 },
pages = { 44-47 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume27/number11/3341-4600/ },
doi = { 10.5120/3341-4600 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:13:32.008935+05:30
%A Pooja Batra Nagpal
%A Priyanka Ahlawat Mann
%T Comparative Study of Density based Clustering Algorithms
%J International Journal of Computer Applications
%@ 0975-8887
%V 27
%N 11
%P 44-47
%D 2011
%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
  1. A.K. Jain and R. C. Dubes, Algorithms for Clustering Data. Englewood Cliffs, NJ: Prentice-Hall, 1988.
  2. 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.
  3. 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.
  4. 10A. K. Jain, M. N. Murty and P. J. Flynn, Data clustering: a review, CM, 31 (1999), pp. 264–323.
  5. 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.
  6. 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
  7. 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.
  8. Rijsbergen, C.J.v., Information Retrieval. 1975: Butter Worths
  9. Steinbach,M.,G. Karypis, and V. Kumar. A comparison of document clustering techniques in Text Mining workshop,KDD 2000
  10. Zhao, Y. and G. Karypis. Evaluation of Hierarchical Clustering Algorithms for Document Datasets. in CIKM. 2002. McLean, Viginia.
Index Terms

Computer Science
Information Sciences

Keywords

Clustering Algorithms Density based Algorithms Clustering in Presence of Noise

Powered by PhDFocusTM