Restricted Randomness DBSCAN : A faster DBSCAN Algorithm

Data Mining is the process of extracting useful and accurate information or patterns from large databases using different algorithms and methods of machine learning. To analyze the data, Clustering is one of the methods in which similar data is grouped together and DBSCAN clustering algorithm is the one, which is broadly used in numerous practical applications. This paper presents a more efficient density based clustering algorithm, which has the ability to discover cluster faster than the existing DBSCAN algorithm. The efficiency is achieved by restricting the randomness of choosing points from the dataset. Our proposed algorithm named Restricted Randomness DBSCAN (RR DBSCAN) is compared with conventional DBSCAN algorithm over 9 datasets on the basis of Silhouette Coefficient, Time taken in formation of clusters and accuracy. The results show that RR DBSCAN performs better than traditional DBSCAN in terms of accuracy and time taken to form clusters.