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'.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.9.0 |
rolling linux/jammy R-4.5 | lumbermark_0.9.0.tar.gz |
58.4 KiB |
0.9.0 |
rolling linux/noble R-4.5 | lumbermark_0.9.0.tar.gz |
59.4 KiB |
0.9.0 |
rolling source/ R- | lumbermark_0.9.0.tar.gz |
11.6 KiB |
0.9.0 |
latest linux/jammy R-4.5 | lumbermark_0.9.0.tar.gz |
58.4 KiB |
0.9.0 |
latest linux/noble R-4.5 | lumbermark_0.9.0.tar.gz |
59.4 KiB |
0.9.0 |
latest source/ R- | lumbermark_0.9.0.tar.gz |
11.6 KiB |
0.9.0 |
2026-04-26 source/ R- | lumbermark_0.9.0.tar.gz |
11.6 KiB |
0.9.0 |
2026-04-23 source/ R- | lumbermark_0.9.0.tar.gz |
11.6 KiB |
0.9.0 |
2026-04-09 windows/windows R-4.5 | lumbermark_0.9.0.zip |
379.8 KiB |