![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/8123
Title: | Spatial Locality Aware, Fast, and Scalable SLINK Algorithm for Commodity Clusters |
Authors: | Goyal, Navneet Goyal, Poonam |
Keywords: | Computer Science Algorithm Commodity Clusters Spatial locality |
Issue Date: | 2016 |
Publisher: | IEEE |
Abstract: | Single linkage (SLINK) hierarchical clustering algorithm is a preferred clustering algorithm over traditional partitioning-based clustering as it does not require the number of clusters as input. But, due to its high time complexity and inherent data dependencies, it does not scale well for large datasets. In this paper, we parallelize an efficient implementation of SLINK algorithm to leverage a commodity cluster of multicore workstations. We present, dGridSlink, a distributed algorithm, which outperforms the best existing parallel solution in literature for all the real datasets considered. We also propose a hybrid parallel algorithm hGridSLINK for a cluster of multicore nodes. The proposed parallel algorithms are scalable and can cluster (several) millions of data points efficiently, without compromising the quality of clustering. |
URI: | https://www.computer.org/csdl/proceedings-article/cluster/2016/3653a158/12OmNAIdBPU http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8123 |
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.