Skip to content

Latest commit

 

History

History
33 lines (17 loc) · 814 Bytes

README.md

File metadata and controls

33 lines (17 loc) · 814 Bytes

paganaye / fast-hierarchical-clustering

A attempt to make a faster hierarchical clustering algorithm for two dimensionnal points.

Because why not.

Made with ❤️ by Pascal Ganaye


❯ Why

According to Wikipedia, the standard algorithm for hierarchical clustering is too slow for even medium data sets.

This code works only with two dimensional data.

A document here describes the algorithm in more detail https://docs.google.com/document/d/1d8vldwLr56vUYoXOg0B1O2WVNddBHCNKatMYUlR_atc/edit?usp=sharing

A demo page can be found here

http://ganaye.com/ahc

❯ Ide

❯ License

MIT