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; see Gagolewski (2026) <https://lumbermark.gagolewski.com/>. The use of a mutual reachability distance pulls peripheral points farther away from each other. 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.0 |
| Imports: | Rcpp, deadwood |
| LinkingTo: | Rcpp |
| Suggests: | datasets |
| Published: | 2026-03-16 |
| DOI: | 10.32614/CRAN.package.lumbermark (may not be active yet) |
| Author: | Marek Gagolewski 
[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.0.tar.gz |
| Windows binaries: | r-devel: lumbermark_0.9.0.zip, r-release: not available, r-oldrel: not available |
| macOS binaries: | r-release (arm64): not available, r-oldrel (arm64): lumbermark_0.9.0.tgz, r-release (x86_64): not available, r-oldrel (x86_64): not available |
Linking:
Please use the canonical form https://CRAN.R-project.org/package=lumbermark to link to this page.