DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/8121
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGoyal, Navneet-
dc.contributor.authorGoyal, Poonam-
dc.date.accessioned2022-12-26T06:57:34Z-
dc.date.available2022-12-26T06:57:34Z-
dc.date.issued2017-01-
dc.identifier.urihttps://dl.acm.org/doi/abs/10.1145/3007748.3007773-
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8121-
dc.description.abstractDBSCAN is one of the most popular density-based clustering algorithm capable of identifying arbitrary shaped clusters and noise. It is computationally expensive for large data sets. In this paper, we present a grid-based DBSCAN algorithm, GridDBSCAN, which is significantly faster than the state-of-the-art sequential DBSCAN. The efficiency of GridDBSCAN is achieved by reducing the number of neighborhood queries using spatial locality information, without compromising the quality of clusters. We also propose scalable parallel implementations of GridDBSCAN to leverage a multicore commodity cluster. Clustering results of GridDBSCAN and its parallel implementations are exactly the same as that of classical DBSCAN. The performance of proposed algorithms, both sequential and parallel, is benchmarked against the state-of-the-art algorithms by experimenting on various real datasets. Experimental results show considerable performance improvements achieved by GridDBSCAN and its parallel implementations.en_US
dc.language.isoenen_US
dc.publisherACM Digital Libraryen_US
dc.subjectComputer Scienceen_US
dc.subjectDBSCAN Algorithmen_US
dc.subjectCommodity Platformsen_US
dc.titleExact, Fast and Scalable Parallel DBSCAN for Commodity Platformsen_US
dc.typeArticleen_US
Appears in Collections:Department of Computer Science and Information Systems

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.