Description Usage Arguments Details Value
View source: R/densest_subset.r
Given a matrix with unknown values, find a densest subset of matrix.
1 | densest_subset(x, empty = NA, density = 1, steps = Inf)
|
x |
a matrix with unknown values |
empty |
the unknown value if different from NA; such as |
density |
a desired density |
steps |
the number of steps |
This is a stepwise filtering algorithm that deletes the least represented columns and/or rows to get a matrix subset with the least amount of unknown values until an optimum is reached.
In a lot of cases, an optimum would be a single vector. For this reasons, the algorithm is limited both by the number of steps and by a desired density.
a list containing the densest submatrix, vectors of deleted columns and a vector of densities at each step of the algorithm
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.