16998

An Efficient Parallel Data Clustering Algorithm Using Isoperimetric Number of Trees

Ramin Javadi, Saleh Ashkboos
Department of Mathematical Sciences, Isfahan University of Technology, Isfahan, 84156-83111, Iran
arXiv:1702.04739 [cs.DC], (15 Feb 2017)
BibTeX

Download Download (PDF)   View View   Source Source   

1736

views

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.
Rating: 2.0/5. From 4 votes.
Please wait...

Recent source codes

* * *

* * *

HGPU group © 2010-2025 hgpu.org

All rights belong to the respective authors

Contact us:

contact@hpgu.org