![DSpace logo](/jspui/image/logo.gif)
Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/8131
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Goyal, Navneet | - |
dc.contributor.author | Goyal, Poonam | - |
dc.date.accessioned | 2022-12-26T09:51:13Z | - |
dc.date.available | 2022-12-26T09:51:13Z | - |
dc.date.issued | 2011 | - |
dc.identifier.uri | https://link.springer.com/chapter/10.1007/978-3-642-22606-9_54 | - |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8131 | - |
dc.description.abstract | In this paper, we present a multi-purpose density-based clustering framework. The framework is based on a novel cluster merging algorithm which can efficiently merge two sets of DBSCAN clusters using the concept of intersection points. It is necessary and sufficient to process just the intersection points to merge clusters correctly. The framework allows for clustering data incrementally, parallelizing the DBSCAN algorithm for clustering large data sets and can be extended for clustering streaming data. The framework allows us to see the clustering patterns of the new data points separately. Results presented in the paper establish the efficiency of the proposed incremental clustering algorithm in comparison to IncrementalDBSCAN algorithm. Our incremental algorithm is capable of adding points in bulk, whereas IncrementalDBSCAN adds points, one at a time. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Incremental clustering | en_US |
dc.subject | DBSCAN | en_US |
dc.subject | Cluster merging algorithm | en_US |
dc.title | A Multi-purpose Density Based Clustering Framework | en_US |
dc.type | Article | en_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.