Exploiting multi–core and many–core parallelism for subspace clustering release_3fytlizww5g2rgdl4fkkohtrw4

by Amitava Datta, Amardeep Kaur, Tobias Lauer, Sami Chabbouh

Published in International Journal of Applied Mathematics and Computer Science by Walter de Gruyter GmbH.

2019   Volume 29, p81-91


<jats:title>Abstract</jats:title> Finding clusters in high dimensional data is a challenging research problem. Subspace clustering algorithms aim to find clusters in all possible subspaces of the dataset, where a subspace is a subset of dimensions of the data. But the exponential increase in the number of subspaces with the dimensionality of data renders most of the algorithms inefficient as well as ineffective. Moreover, these algorithms have ingrained data dependency in the clustering process, which means that parallelization becomes difficult and inefficient. SUBSCALE is a recent subspace clustering algorithm which is scalable with the dimensions and contains independent processing steps which can be exploited through parallelism. In this paper, we aim to leverage the computational power of widely available multi-core processors to improve the runtime performance of the SUBSCALE algorithm. The experimental evaluation shows linear speedup. Moreover, we develop an approach using graphics processing units (GPUs) for fine-grained data parallelism to accelerate the computation further. First tests of the GPU implementation show very promising results.
In application/xml+jats format

Archived Files and Locations

application/pdf  500.9 kB
web.archive.org (webarchive)
content.sciendo.com (web)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2019-03-01
Journal Metadata
Open Access Publication
In Keepers Registry
ISSN-L:  1641-876X
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: c7927546-0f88-46ab-8c70-14160305fed6