← Back to home
Comparison · Analytics

discretefdr vs e2tree

A side-by-side editorial comparison of discretefdr and e2tree — release velocity, themes, recent moves, and the top alternatives to consider.

Shared themes:r-package

discretefdr vs e2tree: at a glance

Featurediscretefdre2tree
SectorAnalyticsAnalytics
Velocity score0.00.0
Sparks · 30d00
Top themesmultiple-testing, false-discovery-rate, discrete-statistics, r-packageexplainable-ai, ensemble-methods, decision-trees, r-package
Last editorial update1h ago1h ago
WebsiteVisit →Visit →

What is discretefdr?

The discrete-data FDR package is being pared into one piece of a larger multiple-testing suite.

DiscreteFDR implements false discovery rate procedures adapted for discrete test statistics, where the standard continuous-case corrections are conservative. It now covers a discrete Benjamini-Yekutieli procedure alongside the Benjamini-Hochberg variants it started with, including adaptive versions. Its datasets and test-result classes have been moved out into companion packages, so it increasingly does one job and defers the rest.

Read the full discretefdr trajectory →

What is e2tree?

The explainable-ensemble-tree package now measures whether its own explanations are faithful.

e2tree builds a single interpretable tree that approximates a fitted ensemble, working from the proximity structure the ensemble induces between observations. The 1.0.0 release added the piece that had been missing: a Goodness of Interpretability index quantifying how well the approximating tree reconstructs the ensemble's own proximity matrix, with a permutation test for significance. Interactive visualisation and a C++ backend with OpenMP parallelism arrived alongside, and support now spans ranger and CatBoost as well as the original targets.

Read the full e2tree trajectory →

discretefdr vs e2tree: editorial side-by-side

D
discretefdr
ANALYTICS
0.0

The discrete-data FDR package is being pared into one piece of a larger multiple-testing suite.

◆ Current state

DiscreteFDR implements false discovery rate procedures adapted for discrete test statistics, where the standard continuous-case corrections are conservative. It now covers a discrete Benjamini-Yekutieli procedure alongside the Benjamini-Hochberg variants it started with, including adaptive versions. Its datasets and test-result classes have been moved out into companion packages, so it increasingly does one job and defers the rest.

◆ Where it's heading

The direction is decomposition into a suite. The amnesia dataset went to DiscreteDatasets, summary output now interoperates with the DiscreteTestResults class from DiscreteTests, and match.pvals() stopped being exported — each release trims something that belongs elsewhere. What remains gets methodological additions at a slow, deliberate cadence, with performance work on the step-up procedures that dominate cost when the number of tests is large. Recent activity is maintenance: replacing deprecated calls the package still made of its own siblings. This is a mature statistical package whose release notes are short because the methods underneath them are settled.

◆ Prediction

Expect further alignment with the companion packages rather than new procedures, since the last substantive release was already about interoperating with DiscreteTests classes and the most recent one about clearing deprecations.

E
e2tree
ANALYTICS
0.0

The explainable-ensemble-tree package now measures whether its own explanations are faithful.

◆ Current state

e2tree builds a single interpretable tree that approximates a fitted ensemble, working from the proximity structure the ensemble induces between observations. The 1.0.0 release added the piece that had been missing: a Goodness of Interpretability index quantifying how well the approximating tree reconstructs the ensemble's own proximity matrix, with a permutation test for significance. Interactive visualisation and a C++ backend with OpenMP parallelism arrived alongside, and support now spans ranger and CatBoost as well as the original targets.

◆ Where it's heading

Development has moved from producing an explanation to defending it. The GoI index and its permutation test change the package's claim from here is a tree that resembles your ensemble to here is how closely it resembles it and whether that could have happened by chance — the question a reviewer asks of any surrogate model. Around that, the work is engineering: the proximity matrix construction moved from R-level parallel loops into C++ with thread-level parallelism, and recent releases have been absorbing the awkwardness of supporting multiple ensemble backends, where a multi-class CatBoost objective returns a score matrix where a vector was expected. Interactive visNetwork output and standalone HTML export point at explanations meant to be shared rather than only inspected.

◆ Prediction

Given how much recent effort has gone into per-backend adapters, expect further work on ensemble compatibility; the entries do not indicate whether the interpretability index is heading toward comparing surrogate trees against each other.

Alternatives to discretefdr and e2tree

Other Analytics products tracked by Sparkpulse, ranked by recent ship velocity. Each card links to a full editorial trajectory and lets you pivot into a head-to-head comparison with either discretefdr or e2tree.

See all discretefdr alternatives → · See all e2tree alternatives →

Recent activity from discretefdr and e2tree

Latest ship moves from both products, interleaved chronologically. ⚡ = editorial spark.

  1. 3mo agodiscretefdrDeprecated internal calls replaced
  2. 3mo agoe2treeCatBoost multi-class and loss-function handling repaired
  3. 4mo agoe2treeA significance-tested measure of explanation fidelity
  4. 1y agoe2treeranger models supported
  5. 1y agodiscretefdrDiscrete Benjamini-Yekutieli procedure added
  6. 1y agodiscretefdrDatasets split out and step-up procedures sped up

Frequently asked questions

What is the difference between discretefdr and e2tree?

Both compete on the same themes — r-package — within Analytics. discretefdr and e2tree are shipping at a similar cadence (velocity 0.0 vs 0.0, both within Sparkpulse's "active" band). See the at-a-glance table above for a side-by-side breakdown of velocity, recent sparks, and editorial themes.

Is discretefdr better than e2tree?

Sparkpulse doesn't pick a winner — we score release velocity, not feature parity. discretefdr and e2tree are shipping at a similar cadence (velocity 0.0 vs 0.0, both within Sparkpulse's "active" band). For your specific use case, the alternatives sections above list other Analytics products to evaluate alongside.

What are the best alternatives to discretefdr?

Top discretefdr alternatives in Analytics are ranked by recent ship velocity. Browse the "discretefdr alternatives" section above for the current picks, or visit /alternatives/discretefdr for the full list with editorial commentary on each.

What are the best alternatives to e2tree?

Top e2tree alternatives in Analytics are ranked by recent ship velocity. Browse the "e2tree alternatives" section above for the current picks, or visit /alternatives/e2tree for the full list with editorial commentary on each.