Skip to content

lumbermark

0.9.0

Resistant Clustering via Chopping Up Mutual Reachability Minimum Spanning Trees

1packages depend
2.2Kdownloads / year
test coverage
13/13checks pass

Overview

About
Maintained by Marek GagolewskiFirst published 2026-03-171 releasesCRAN page ↗GitHub ↗

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'.

Install

Health

CRAN checks
13OK
Slowest check: 2.9 min · r-devel-windows-x86_64
Code health
None
Tests · ratio 0.00
not tracked
Coverage
100%
Documentation · exports
2
Dependencies · direct
Check history
  • OK2026-08-05
    13 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
  • NOTE2026-08-01
    12 OK · 1 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
  • OK2026-04-22
    14 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
  • ERROR2026-04-18
    13 OK · 0 NOTE · 0 WARNING · 1 ERROR · 0 FAILURE
  • OK2026-03-17
    5 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE

Documentation

Documentation
READMENoVignettesNopkgdown siteNoNEWSYes · 67% structuredCode of conductNoContributing guideNo
Examples that run
100%
Documented parameters
100%
Return-value docs
100%
References docs
50%

Downloads

2.2K
CRAN downloads in the past year
Rank #9,454 · ~6/day · ~183/mo
Daily download trend is not available in this view yet.
17530 days
99590 days
2.2K1 year
Compare downloads with other packages →
Also on168 r2u12 autocran

Repository

Repository
0Stars
0Forks
0Open issues
0Open PRs
1Releases
45Commits
1Contributors
anomaly-detectioncluster-analysisclusteringclustering-algorithmhdbscanmachine-learningmachine-learning-algorithmsminimum-spanning-tree
45 commits · Last activity 2026-07-01

Releases over time

2026-03-09 · 12026-07-07 · 1

Repository practices

Upstream repositoryBeta

2 development-tooling and community-health practices detected across 2 families in the upstream repository

Checks run against github.com/gagolews/lumbermark on 2026-08-16.

Continuous integration (1)
GitHub Actions
Reproducibility and dev environment (1)
Makefile
How this is detected·Detection ruleset v1 (2026-07-18)

Dependencies

Declared dependencies
3 external dependencies (excludes base and recommended)
Depends (0)
none
Imports (2)
LinkingTo (1)
Suggests (1)
datasets
Enhances (0)
none
Reverse dependencies
1direct
0indirect

Code & Tests

People & History

People (1)
Maintainer (1)
Author, Maintainer, Copyright holder
Authors (1)
Author, Maintainer, Copyright holder
Copyright holders (1)
Author, Maintainer, Copyright holder
Package Timeline

1 release. R releases are shown for context.

  • R
    R 4.6.0 released · 2026-04-24
  • 0.9.0Latest
    2026-03-17 · current release
  • R
    R 4.5.0 released · 2025-04-11

Package metadata

First published
2026-03-17
Total releases
1 / 1 yrs
License
AGPL-3 OSI
Download size
12 KB
Installed size
not tracked yet
With dependencies
not tracked yet

Cite

Cite this package

Run in R for the authors' preferred citation:

citation("lumbermark")
Gagolewski, M. (2026). lumbermark: Resistant Clustering via Chopping Up Mutual Reachability Minimum Spanning Trees (Version 0.9.0) [Computer software]. https://doi.org/10.32614/CRAN.package.lumbermark

This is what citation() produces when a package has no citation file of its own. If it prints something else, use that.

Cite the R Observatory

For a number measured here: a download total, a coverage figure, an archival date.

APA

Balamuta, J. J. (2026). R Observatory: Metrics for lumbermark version 0.9.0 [Data set]. HJJB, LLC. Data release v2026-08-18. https://doi.org/10.5281/zenodo.21843040

From data release v2026-08-18, which the citation names so these numbers can be found later. More on citing and the projects behind them.

Report a problem with this page →

Privacy choices

These apply to this browser and are stored on this device only. Nothing about your choice is sent to us.

Read the privacy policy