lumbermark: Resistant Clustering via Chopping Up Mutual Reachability Minimum Spanning Trees

Implements a fast and resistant divisive clustering algorithm which identifies a specified number of clusters: 'lumbermark' iteratively chops off sizeable limbs that are joined by protruding segments of a dataset's mutual reachability minimum spanning tree (Gagolewski, 2026 <doi:10.48550/arXiv.2604.07143>). The use of a mutual reachability distance pulls peripheral points farther away from each other. It is a viable alternative to the 'HDBSCAN*' algorithm and can be viewed as a divisive version of Genie. The resulting partitions of different granularities are properly nested. When combined with the 'deadwood' package, it can act as an outlier detector. The 'Python' version of 'lumbermark' is available via 'PyPI'.

Version: 0.9.1
Imports: Rcpp, deadwood
LinkingTo: Rcpp
Suggests: datasets
Published: 2026-10-01
DOI: 10.32614/CRAN.package.lumbermark
Author: Marek Gagolewski ORCID iD [aut, cre, cph]
Maintainer: Marek Gagolewski <marek at gagolewski.com>
BugReports: https://github.com/gagolews/lumbermark/issues
License: AGPL-3
URL: https://lumbermark.gagolewski.com/, https://clustering-benchmarks.gagolewski.com/, https://github.com/gagolews/lumbermark
NeedsCompilation: yes
SystemRequirements: OpenMP
Materials: NEWS
CRAN checks: lumbermark results

Documentation:

Reference manual: lumbermark.html , lumbermark.pdf

Downloads:

Package source: lumbermark_0.9.1.tar.gz
Windows binaries: r-devel: lumbermark_0.9.0.zip, r-release: lumbermark_0.9.0.zip, r-oldrel: lumbermark_0.9.0.zip
macOS binaries: r-release (arm64): lumbermark_0.9.0.tgz, r-oldrel (arm64): lumbermark_0.9.0.tgz, r-release (x86_64): lumbermark_0.9.0.tgz, r-oldrel (x86_64): lumbermark_0.9.0.tgz
Old sources: lumbermark archive

Reverse dependencies:

Reverse suggests: evoFE

Linking:

Please use the canonical form https://CRAN.R-project.org/package=lumbermark to link to this page.