Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Analysis of Density-Based Spatial Clustering In Data Mining

Author : C.Vinothini 1 Dr V.Lakshmi Praba 2

Date of Publication :30th March 2018

Abstract: Data mining involves the association rule learning, classification, summarization, regression, anomaly detection and clustering. Clustering is a data mining technique to group the related data into a cluster and unrelated data into different clusters. Based on the recently described cluster models, there are a lot of clustering that can be applied to a data set in order to partitionate the information. DBSCAN (Density-Based Spatial Clustering of Applications with Noise) is the most well-known density-based clustering algorithm. The aim is to identify dense regions, which can be measured by the number of objects nearest to a given point. Unlike K-Means, DBSCAN does not require the number of clusters as a parameter. It infers the number of clusters on its data, and it can detect clusters of arbitrary shape. Density-based clustering algorithms try to find clusters based on the density of data points in a region. For the experimental work, we have used the milk data set. The results were analyzed and practically tested under MATLAB tools

Reference :

    1. Pooja Batra Nagpal and Priyanka Ahlawat Mann,” Comparative Study of Density based Clustering Algorithms”, International Journal of Computer Applications (0975 – 8887) Volume 27– No.11, August 2011.
    2. Arvind Sharma,1 R. K. Gupta,2 and Akhilesh Tiwari,” Improved Density Based Spatial Clustering of Applications of Noise Clustering Algorithm for Knowledge Discovery in Spatial Data”, Hindawi Publishing Corporation Mathematical Problems in Engineering Volume 2016, Article ID 1564516, 9 pages.
    3. Son T. Mai,Ira Assent and Martin Storgaard,” An Efficient Anytime Density-based Clustering Algorithm for Very Large Complex Datasets”, KDD ’16, August 13-17, 2016, San Francisco, CA, USA.
    4. Mariam Rehman and Syed Atif Mehdi, ”Comparison of Density-Based Clustering Algorithms”, www.researchgate.net/publication/242219043. 
    5. Hajar Rehioui, Abdellah IDRISSI, Manar ABOUREZQ and Faouzia ZEGRARI, “DENCLUE-IM: A New Approach for Big Data Clustering”, The 7th International Conference on Ambient Systems, Networks and Technologies (ANT 2016), Procedia Computer Science 83 ( 2016 ) 560 – 567.

Recent Article