rankUncertainty (version 1.0.2.0)

bottomSet: Compute the k-bottom set for a set of intervals

Description

Suppose that we select one point from each of a set of n intervals and rank them. The k-bottom set is the set of intervals whose points can have a rank of n + 1 - k or higher.

Usage

bottomSet(intervals, k)

Arguments

intervals

data frame (see generateIntervals for the required format)

k

cutoff for inclusion

Value

Indices of intervals in the k-bottom set.

Details

See section 4.2 of Rising (2021).

References

Rising, Justin (2021). Uncertainty in Ranking. arXiv:2107.03459.

Examples

# NOT RUN {
intervals <- data.frame(left = 1:4, right = 1:4 + 0.5)
bottomSet(intervals, 2)
# }