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

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Study of Density based Algorithms

by Vivek S Ware, Bharathi H N
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 69 - Number 26
Year of Publication: 2013
Authors: Vivek S Ware, Bharathi H N
10.5120/12132-8235

Vivek S Ware, Bharathi H N . Study of Density based Algorithms. International Journal of Computer Applications. 69, 26 ( May 2013), 1-4. DOI=10.5120/12132-8235

@article{ 10.5120/12132-8235,
author = { Vivek S Ware, Bharathi H N },
title = { Study of Density based Algorithms },
journal = { International Journal of Computer Applications },
issue_date = { May 2013 },
volume = { 69 },
number = { 26 },
month = { May },
year = { 2013 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume69/number26/12132-8235/ },
doi = { 10.5120/12132-8235 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:31:19.744509+05:30
%A Vivek S Ware
%A Bharathi H N
%T Study of Density based Algorithms
%J International Journal of Computer Applications
%@ 0975-8887
%V 69
%N 26
%P 1-4
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Clusters formed on the basis of density are very useful and easy to understand and they do not limit to their shapes. Basically two types of density based algorithms are present. One is density based connectivity which focuses on Density and Connectivity and another is Density function which is total mathematical function. They work best in spatial database. In this paper, we are studying DBSCAN, VDBSCAN, DVBSCAN, UDBSCAN, OPTICS, DBNCLUE, GDBSCA and DBCLASD. We analyze some of the algorithms in terms of meaningful clusters.

References
  1. Pooja Nagpal and Priyanka Mann, 2011, "Survey of Density Based Algorithms" in International Journal of Computer Science and Applications.
  2. Pooja Nagpal and Priyanka Mann, august 2011, "Comparative Study of Density Based Clustering Algorithms" in International Journal of Computer Science and Applications, volume-27.
  3. M. Parimala, Daphne Lophne and N. C. Senthilkumar, June 2011, "A Survey on Density Based Clustering Algorithms for Mining Large Spatial Databases" in International Journal of Advanced Science and Technology, Volume-31.
  4. S. Vijayalakshmi, Dr. M. Punithavali, 2010, "Improved Varied Density Based Clustering Algorithms for Mining Large Spatial Databases" in Research and Development Center Bharathiar University Coimbatore, India IEEE.
  5. Peng Liu, Dong Zhou and Naijun Wu, "Varied Density Based Spatial Clustering of Application with Noise", in proceedings of IEEE Conference ICSSSM 2007 Pg 528-531.
  6. K. Jain, M. N. Murty and P. J. Flynn, 1999, "Data Clustering: A Review", ACM, 31(1999), PP. 264-323.
  7. Hinneburg and D. Keim, 1998, "An efficient approach to clustering Large multimedia databases with noise" ,in Proc. 4th Int. Conf. Knowledge Discovery and Data Mining (KDD'98), PP. 58-65.
  8. Martin Ester, Han-peter Kriegel, Jorg Sander and Xiaowei Xu, "A Density- Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise", in 2nd International conference on Knowledge Discovery and Data Mining (KDD-96).
Index Terms

Computer Science
Information Sciences

Keywords

Dbscan Vdbscan Dvbscan Udbscan Optics Dbnclue Gdbsca And Dbclasd

Powered by PhDFocusTM