deadwood
0.9.0-3Outlier Detection via Trimming of Mutual Reachability Minimum Spanning Trees
Overview
Implements an anomaly detection algorithm based on mutual reachability minimum spanning trees: 'deadwood' trims protruding tree segments and marks small debris as outliers; see Gagolewski (2026) https://deadwood.gagolewski.com/. More precisely, the use of a mutual reachability distance pulls peripheral points farther away from each other. Tree edges with weights beyond the detected elbow point are removed. All the resulting connected components whose sizes are smaller than a given threshold are deemed anomalous. The 'Python' version of 'deadwood' is available via 'PyPI'.
Install
Health
- NOTE r-devel-linux-x86_64-debian-gcc
- NOTE2026-08-0112 OK · 1 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
- OK2026-04-2214 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
- ERROR2026-04-1813 OK · 0 NOTE · 0 WARNING · 1 ERROR · 0 FAILURE
- OK2026-03-1014 OK · 0 NOTE · 0 WARNING · 0 ERROR · 0 FAILURE
Documentation
- Examples that run
- 100%
- Documented parameters
- 100%
- Return-value docs
- 100%
- References docs
- 75%
Downloads
Repository
Stars over time
Releases over time
Issues over time
Repository practices
2 development-tooling and community-health practices detected across 2 families in the upstream repository
Checks run against github.com/gagolews/deadwood on 2026-07-31.
Dependencies
Code & Tests
People & History
2 releases. Pick two to compare their code metrics. R releases are shown for context.
- RR 4.6.0 released · 2026-04-24
- 0.9.0-3Latest
- 0.9.0-22026-02-20
- RR 4.5.0 released · 2025-04-11
Package metadata
- First published
- 2026-02-20
- Total releases
- 2 / 1 yrs
- License
- AGPL-3 OSI
- Download size
- 29 KB
- Installed size
- not tracked yet
- With dependencies
- not tracked yet