View source: R/weightedSetCover.R
weightedSetCover | R Documentation |
Size constrained weighted set cover problem to find top N sets while maximizing the coverage of all elements.
weightedSetCover(idsInSet, costs, topN, nThreads = 4)
idsInSet |
A list of set names and their member IDs. |
costs |
A vector of the same length to add weights for penalty, i.e. 1/-logP. |
topN |
The number of sets (or less when it completes early) to return. |
nThreads |
The number of processes to use. In Windows, it fallbacks to 1. |
A list of topSets
and coverage
.
A list of set IDs.
The percentage of IDs covered in the top sets.
Zhiao Shi, Yuxing Liao
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.