lumbermark: Resistant clustering via chopping up mutual reachability minimum spanning trees

A new package lumbermark is now available on CRAN and PyPI.

lumbermark is a fast and resistant divisive clustering algorithm which identifies a specified number of clusters. It iteratively chops off sizeable limbs that are joined by protruding segments of a dataset’s mutual reachability minimum spanning tree.