leaderCluster: Leader Clustering Algorithm
Version 1.2

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

Package details

AuthorTaylor B. Arnold
Date of publication2014-12-16 00:58:11
MaintainerTaylor B. Arnold <taylor.arnold@acm.org>
Package repositoryView 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.

leaderCluster documentation built on May 29, 2017, 2:21 p.m.