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)

@article{javadi2017efficient,

   title={An Efficient Parallel Data Clustering Algorithm Using Isoperimetric Number of Trees},

   author={Javadi, Ramin and Ashkboos, Saleh},

   year={2017},

   month={feb},

   archivePrefix={"arXiv"},

   primaryClass={cs.DC}

}

Download Download (PDF)   View View   Source Source   

357

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.
VN:F [1.9.22_1171]
Rating: 4.0/5 (4 votes cast)
An Efficient Parallel Data Clustering Algorithm Using Isoperimetric Number of Trees, 4.0 out of 5 based on 4 ratings

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: