2012 16th Panhellenic Conference on Informatics (2012)
Piraeus, Greece Greece
Oct. 5, 2012 to Oct. 7, 2012
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PCi.2012.24
The fuzzy c-means clustering is a well-known unsupervised algorithm and has been widely used in various pattern recognition applications. As the amount of data increase, however, the basic serial implementation becomes overwhelmed. This is the main motivation for utilizing the computational power of parallel machines to speed up the c-means algorithm. We present an algorithm that exploits the mathematical equations in c-means to create building blocks based on linear algebra functions that are optimized for most available parallel architectures. We implemented our algorithm on both GPU (using CUDA and CUBLAS) and MPI (using MPI4py and NumPy), then evaluated their performance and scalability. Experiments show that our implementation outperforms all of available GPU implementations of c-means have been proposed so far.
Informatics, multi-core clustering, Fuzzy C-means Clustering, CUDA, GPU
A. Glenis and V. Pham, "A Linear Algebra Approach to C-Means Clustering Using GPUs and MPI," 2012 16th Panhellenic Conference on Informatics(PCI), Piraeus, Greece Greece, 2012, pp. 198-203.