geokmeans
0.1.0A Collection of Fast, Exact and Eco-Friendly k-Means Clustering Algorithms
Overview
A collection of fast k-means clustering algorithms under a single, uniform interface. The core method is Geometric-k-means, a bound-free algorithm of Sharma et al. (2026) doi:10.1007/s10994-025-06891-1 that uses geometry to restrict computation to the data points able to change clusters, substantially reducing distance computations and runtime while returning the same result as standard k-means. Also included are Lloyd's algorithm, Elkan, Hamerly, Annulus, Exponion, and Ball k-means. All algorithms are implemented in 'C++' via 'Rcpp' and 'RcppEigen' and return the final centroids, optional per-point cluster assignments, and computational statistics.
Install
Health
- OK2026-06-236 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
Documentation
- Examples that run
- 100%
- Documented parameters
- 100%
- Return-value docs
- 100%
- References docs
- 67%
Downloads
Repository
Stars over time
Repository practices
2 development-tooling and community-health practices detected across 2 families in the upstream repository
Checks run against github.com/parichit/geometric-k-means on 2026-07-19.
Dependencies
Nothing depends on this yet.
Code & Tests
People & History
1 release. R releases are shown for context.
- 0.1.0Latest2026-06-22 · current release
- RR 4.6.0 released · 2026-04-24
Package metadata
- First published
- 2026-06-22
- Total releases
- 1 / 1 yrs
- License
- GPL-3 OSI
- Download size
- not tracked yet
- Installed size
- not tracked yet
- With dependencies
- not tracked yet