Exploiting multi-core and many-core parallelism for subspace clustering

Amitava Datta, Amardeep Kaur, Tobias Lauer, Sami Chabbouh

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Pages (from-to)81-91
Number of pages11
JournalInternational Journal of Applied Mathematics and Computer Science
Volume29
Issue number1
DOIs
Publication statusPublished - 1 Mar 2019

Fingerprint Dive into the research topics of 'Exploiting multi-core and many-core parallelism for subspace clustering'. Together they form a unique fingerprint.

  • Cite this