Skip to content

Latest commit

 

History

History
16 lines (11 loc) · 501 Bytes

File metadata and controls

16 lines (11 loc) · 501 Bytes

Hierarchical clustering for points in R^d

Based on the paper "Performance guarantees for hierarchical clustering" by Sanjoy Dasgupta and Philip M. Long Download PDF here

Straight forward implementation of the Algorithm for points in R^4 with the Euclidian norm.

Compiling

Only depends on STL and CMake (for building)

 mkdir build
 cd build
 cmake ..
 make

Usage

See the file test_hcluster.cc for a usage example.