Upper bound for the number of false discoveries among most significant items
Source:R/posthoc-bounds.R
curveMaxFP_alternatives.RdUpper bound for the number of false discoveries among most significant items
Arguments
- p.values
A vector containing all \(m\) p-values, sorted non-decreasingly
- thr
A vector of \(K\) JER-controlling thresholds, sorted non-decreasingly
Value
A vector of size \(m\) giving an joint upper confidence bound on the number of false discoveries among the \(k\) most significant items for all \(k \in \{1\ldots m\}\).