leaderCluster
Leader Clustering Algorithm
The leader clustering algorithm provides a means for clustering a set of data points. Unlike many other clustering algorithms it does not require the user to specify the number of clusters, but instead requires the approximate radius of a cluster as its primary tuning parameter. The package provides a fast implementation of this algorithm in n-dimensions using Lp-distances (with special cases for p=1,2, and infinity) as well as for spatial data using the Haversine formula, which takes latitude/longitude pairs as inputs and clusters based on great circle distances.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.5 |
rolling source/ R- | leaderCluster_1.5.tar.gz |
5.5 KiB |
1.5 |
rolling linux/jammy R-4.5 | leaderCluster_1.5.tar.gz |
16.7 KiB |
1.5 |
latest source/ R- | leaderCluster_1.5.tar.gz |
5.5 KiB |
1.5 |
latest linux/jammy R-4.5 | leaderCluster_1.5.tar.gz |
16.7 KiB |
1.5 |
2026-04-23 source/ R- | leaderCluster_1.5.tar.gz |
5.5 KiB |
1.5 |
2026-04-09 windows/windows R-4.5 | leaderCluster_1.5.zip |
25.8 KiB |
1.5 |
2025-04-20 source/ R- | leaderCluster_1.5.tar.gz |
5.5 KiB |