Journal Article10.1016/J.COMPELECENG.2017.12.002
A GPU-accelerated parallel K-means algorithm
41
TL;DR: This work focuses on a parallel technique to reduce the execution time when the K-means algorithm is used to cluster large dataset, and optimize the proposed implementation to handle the space limitation issue of GPUs and the host-device data transfer time.
read more
About: This article is published in Computers & Electrical Engineering. The article was published on 01 Dec 2017. The article focuses on the topics: Cluster analysis & k-means clustering.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficient algorithm for big data clustering on single machine
TL;DR: A new parallel clustering algorithm based on the k-means algorithm that significantly reduces the exponential growth of computations and splits a dataset into batches while preserving the characteristics of the initial dataset and increasing the clustering speed.
104
A survey on parallel clustering algorithms for Big Data
TL;DR: An overview of the latest parallel clustering algorithms categorized according to the computing platforms used to handle the Big Data, namely, the horizontal and vertical scaling platforms.
85
Parallel K-Means Clustering for Brain Cancer Detection Using Hyperspectral Images
Emanuele Torti,Giordana Florimbi,Francesca Castelli,Samuel Ortega,Himar Fabelo,Gustavo M. Callico,M. Marrero-Martin,Francesco Leporati +7 more
TL;DR: A parallel K-means clustering algorithm based on OpenMP, CUDA and OpenCL paradigms that will generate an unsupervised segmentation map that, combined with a supervised classification map, will offer guidance to the neurosurgeon during the tumor resection task.
36
Clustering Algorithms on Low-Power and High-Performance Devices for Edge Computing Environments
TL;DR: In this article, the authors investigate how to implement clustering algorithms on parallel and low-energy devices for edge computing environments, and they present the experiments related to two devices with different features: the quad-core UDOO X86 Advanced+ board and the GPU-based NVIDIA Jetson Nano board.
29
Performance enhancement of a dynamic K-means algorithm through a parallel adaptive strategy on multicore CPUs
TL;DR: This paper proposes a method to dynamically define the value of K by optimizing a suitable quality index with special care to the computational cost and proposes a strategy for parallel implementation on modern multicore CPUs.
25
References
Some methods for classification and analysis of multivariate observations
James B. MacQueen
- 01 Jan 1967
TL;DR: The k-means algorithm as mentioned in this paper partitions an N-dimensional population into k sets on the basis of a sample, which is a generalization of the ordinary sample mean, and it is shown to give partitions which are reasonably efficient in the sense of within-class variance.
Cluster analysis and display of genome-wide expression patterns
TL;DR: A system of cluster analysis for genome-wide expression data from DNA microarray hybridization is described that uses standard statistical algorithms to arrange genes according to similarity in pattern of gene expression, finding in the budding yeast Saccharomyces cerevisiae that clustering gene expression data groups together efficiently genes of known similar function.
•Proceedings Article
On Spectral Clustering: Analysis and an algorithm
Andrew Y. Ng,Michael I. Jordan,Yair Weiss +2 more
- 03 Jan 2001
TL;DR: A simple spectral clustering algorithm that can be implemented using a few lines of Matlab is presented, and tools from matrix perturbation theory are used to analyze the algorithm, and give conditions under which it can be expected to do well.
Advances in Neural Information Processing Systems 14
08 Nov 2002
Abstract: The proceedings of the 2001 Neural Information Processing Systems (NIPS) Conference. The annual conference on Neural Information Processing Systems (NIPS) is the flagship conference on neural computation. The conference is interdisciplinary, with contributions in algorithms, learning theory, cognitive science, neuroscience, vision, speech and signal processing, reinforcement learning and control, implementations, and diverse applications. Only about 30 percent of the papers submitted are accepted for presentation at NIPS, so the quality is exceptionally high. These proceedings contain all of the papers that were presented at the 2001 conference. Bradford Books imprint
8.9K
Genesis: cluster analysis of microarray data
TL;DR: Genesis integrates various tools for microarray data analysis such as filters, normalization and visualization tools, distance measures as well as common clustering algorithms including hierarchical clustering, self-organizing maps, k-means, principal component analysis, and support vector machines.
1.9K