bottomSet: Compute the k-bottom set for a set of intervals
In rankUncertainty: Methods for Working with Uncertainty in Rankings
Description
Usage
Arguments
Details
Value
References
Examples
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
1
bottomSet(intervals, k)
Arguments
intervals
data frame (see generateIntervals for
the required format)
k
cutoff for inclusion
Details
See section 4.2 of Rising (2021).
Value
Indices of intervals in the k-bottom set.
References
Rising, Justin (2021). Uncertainty in Ranking. arXiv:2107.03459.
Examples
1
2
intervals <- data.frame(left = 1:4, right = 1:4 + 0.5)
bottomSet(intervals, 2)
rankUncertainty documentation built on Nov. 16, 2021, 1:07 a.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Details Value References Examples
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
1 | bottomSet(intervals, k)
|
Arguments
intervals |
data frame (see generateIntervals for the required format) |
k |
cutoff for inclusion |
Details
See section 4.2 of Rising (2021).
Value
Indices of intervals in the k-bottom set.
References
Rising, Justin (2021). Uncertainty in Ranking. arXiv:2107.03459.
Examples
1 2 | intervals <- data.frame(left = 1:4, right = 1:4 + 0.5)
bottomSet(intervals, 2)
|
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.