'Yingyang' K-Means and K-NN using NVIDIA CUDA
Overview
K-means implementation is base on "Yingyang K-Means: A Drop-In Replacement of the Classic K-Means with Consistent Speedup". While it introduces some overhead and many conditional clauses which are bad for CUDA, it still shows 1.6-2x speedup against the Lloyd algorithm. K-nearest neighbors employ the same triangle inequality idea and require precalculated centroids and cluster assignments, similar to the flattened ball tree.
Install
Health
CRAN check results are not tracked yet.
Documentation
- Help pages
- 2
- Examples that run
- no examples
- Exported functions with examples
- 0%
- Documented parameters
- 100%
- Return-value docs
- 100%
- Help pages citing references
- 0%
Downloads
Dependencies
Code & Tests
People & History
Pick two releases to compare their code metrics.
- RR 4.2.0 released · 2022-04-22
- archivedRemoved from CRAN2021-11-05check problems were not corrected in time
- RR 4.1.0 released · 2021-05-18
- RR 4.0.0 released · 2020-04-24
- RR 3.6.0 released · 2019-04-26
- 1.1.02019-03-22 · diff ↗
- RR 3.5.0 released · 2018-04-23
- 1.0.02017-05-03
- RR 3.4.0 released · 2017-04-21
Package metadata
- First published
- 2017-05-03
- Total releases
- 2 / 9 yrs
- License
- Apache License (>= 2.0) | file LICENSE · relicensed from MIT + file LICENSE in 1.1.0
- Minimum R
- ≥ 3.3.2
Cite
Cite this package
Run in R for the authors' preferred citation:
citation("kmcudaR")This package has no citation file, so citation() returns this entry built from DESCRIPTION.
Cite the R Observatory
For a number measured here: a download total, a coverage figure, an archival date.
From data release v2026-10-24, which the citation names so these numbers can be found later. More on citing and the projects behind them.