PDF] Yinyang K-Means: A Drop-In Replacement of the Classic K-Means
$ 8.50 · 4.6 (304) · In stock
Yinyang K-means is a drop-in replacement of the classic K-Means with an order of magnitude higher performance, and significantly outperforms prior K- means algorithms consistently across all experimented data sets, cluster numbers, and machine configurations. This paper presents Yinyang K-means, a new algorithm for K-means clustering. By clustering the centers in the initial stage, and leveraging efficiently maintained lower and upper bounds between a point and centers, it more effectively avoids unnecessary distance calculations than prior algorithms. It significantly outperforms prior K-means algorithms consistently across all experimented data sets, cluster numbers, and machine configurations. The consistent, superior performance--plus its simplicity, user-control of overheads, and guarantee in producing the same clustering results as the standard K-means--makes Yinyang K-means a drop-in replacement of the classic K-means with an order of magnitude higher performance.
PDF) A Hybrid MPI/OpenMP Parallelization of K-Means Algorithms
Clustering - Hung Nguyen's Site
K-Means Clustering - an overview
GitHub - tgbnhy/fast-kmeans: This repo holds the code, dataset
PDF) Making k-means Even Faster.
Large scale K-means clustering using GPUs
PDF] A Dual-Tree Algorithm for Fast k-means Clustering With Large
Remote Sensing, Free Full-Text
Algorithms, Free Full-Text
PDF) Even Faster Exact k-Means Clustering