Nothing
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.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Taylor B. Arnold |
| Maintainer | Taylor B. Arnold <tarnold2@richmond.edu> |
| License | LGPL-2 |
| Version | 1.5 |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the leaderCluster package in your browser
Any scripts or data that you put into this service are public.
