Real Time Density-Based Clustering (RTDBC) Algorithm for Big Data
Dr. B. Ravi Prasad1 Show affiliations
- Marri Laxman Reddy Institute of Technology and Management, India
Journal of Computer Science, Volume 13, Issue 10, pp. 496–504 · doi.org/10.3844/jcssp.2017.496.504
Abstract
Density Based Spatial Clustering of Applications with Noise (DBSCAN), a well-known Density-Based Clustering Algorithm is a advanced data clustering method with various applications in numerous fields like Satellites images, X-ray crystallography, Anomaly Detection in Temperature Data. But its run time R(n2) complexity draws a major challenge. In this research paper, we propose a new unique algorithm called Real Time Density Based Clustering RTDBC to minimize the problems in DBSCAN. In proposed algorithms, objects are allotted into clusters using labels representatives than the method of propagating directly to reduce propagation time of label considerably. In contrast, RTDBC produce fast result and continuous process of runtime and additionally users are permitted to suspend for testing the result and continue as to enhance good results.
Licence and reuse
Open access. This article is licensed under a Creative Commons Attribution 3.0 Licence (CC BY 3.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.
How to reuse this articleResponses (0)
About this article
Prasad, D. B. R. (2017). Real Time Density-Based Clustering (RTDBC) Algorithm for Big Data. Journal of Computer Science, 13(10), 496–504. https://doi.org/10.3844/jcssp.2017.496.504
- Licence
- CC BY 3.0
- Issue
- Volume 13, Issue 10
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
