arxiv: 1702.04739 · v1 · pith:UOIBKNRCnew · submitted 2017-02-15 · 💻 cs.DC

An Efficient Parallel Data Clustering Algorithm Using Isoperimetric Number of Trees

Ramin Javadi , Saleh Ashkboos This is my paper

classification 💻 cs.DC

keywords algorithmclusteringparalleldataisoperimetricminimumotherterms

0 comments p. Extension

Add this Pith Number to your LaTeX paper

\usepackage{pith}
\pithnumber{UOIBKNRC}

Prints a linked pith:UOIBKNRC badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

We propose a parallel graph-based data clustering algorithm using CUDA GPU, based on exact clustering of the minimum spanning tree in terms of a minimum isoperimetric criteria. We also provide a comparative performance analysis of our algorithm with other related ones which demonstrates the general superiority of this parallel algorithm over other competing algorithms in terms of accuracy and speed.

This paper has not been read by Pith yet.

An Efficient Parallel Data Clustering Algorithm Using Isoperimetric Number of Trees

discussion (0)