This function conducts a heuristic search for row subsets that minimize the number of omitted rows that remove all missing values from a given matrix.
1 | ladderOptima(mat, pareto = FALSE, to.remove = FALSE)
|
mat |
A matrix. |
pareto |
Logical; whether to restrict the results to Pareto-optimal subsets. |
to.remove |
Logical; whether to return subsets of rows and columns to
keep ( |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.