arXiv Open Access 2017

An Efficient Parallel Data Clustering Algorithm Using Isoperimetric Number of Trees

Ramin Javadi Saleh Ashkboos

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DC

Penulis (2)

Ramin Javadi

Saleh Ashkboos

Format Sitasi

APA MLA BibTeX

Javadi, R., Ashkboos, S. (2017). An Efficient Parallel Data Clustering Algorithm Using Isoperimetric Number of Trees. https://arxiv.org/abs/1702.04739

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2017
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓