Speedup of Fuzzy Clustering Through Stream Processing on Graphics Processing Units
Authors:
- 30 April 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 16 (4) , 1101-1106
Abstract
As the number of data points, feature dimensionality, and number of centers for clustering algorithms increase, computational tractability becomes a problem. The fuzzy c-means has a large degree of inherent algorithmic parallelism that modern CPU architectures do not exploit. Many pattern recognition algorithms can be sped up on a graphics processing unit (GPU) as long as the majority of computation at various stages and the components are not dependent on each other. We present a generalized method for offloading fuzzy clustering to a GPU, while maintaining control over the number of data points, feature dimensionality, and the number of cluster centers. GPU-based clustering is a high-performance low-cost solution that frees up the CPU. Our results show a speed increase of over two orders of magnitude for particular clustering configurations and platforms.Keywords
This publication has 6 references indexed in Scilit:
- Incorporation of Non-euclidean Distance Metrics into Fuzzy Clustering on Graphics Processing Units2007
- A Survey of General‐Purpose Computation on Graphics HardwareComputer Graphics Forum, 2007
- Extending fuzzy and probabilistic clustering to very large data setsComputational Statistics & Data Analysis, 2006
- Iterative Solutions using Programmable Graphics Processing Units2005
- Complexity reduction for "large image" processingIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2002
- Pattern Recognition with Fuzzy Objective Function Algorithms1981