https://github.com/statsmaths/leadercluster

Implementation of Hartigan's leader clustering algorithm
https://github.com/statsmaths/leadercluster

Last synced: 10 months ago
JSON representation

Implementation of Hartigan's leader clustering algorithm

• Host: GitHub
• URL: https://github.com/statsmaths/leadercluster
• Owner: statsmaths
• Created: 2014-11-10T15:54:42.000Z (over 11 years ago)
• Default Branch: master
• Last Pushed: 2023-03-24T16:26:58.000Z (over 3 years ago)
• Last Synced: 2024-10-27T00:04:13.276Z (over 1 year ago)
• Language: R
• Size: 22.5 KB
• Stars: 1
• Watchers: 0
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
Hartigan's clustering leader algorithm provides

 a means for clustering points given a predetermined radius

 of a cluster. Unlike other clustering algorithms it does not

 require the user to specify the number of clusters. The package

 provides a fast implementation of this algorithm in two dimensions

 using either euclidian distance or the Haversine formula,

 which takes latitude and longitude as inputs.