Description Usage Arguments Value Author(s) Examples
High level function for learning the number of components k, if unknown.
1 2 3 4 5 6 7 8 9 10 11 |
D |
data with cells indexing the columns and features (E-genes) indexing the rows |
ks |
vector of number of components k to test |
man |
logical. manual data penalty, e.g. man=TRUE and pen=2 for an approximation of the Akaike Information Criterion |
degree |
different degree of penalty for complexity: positive entries of transitively reduced phis or phi^r (degree=0), phi^r and mixture components minus one k-1 (1), phi^r, k-1 and positive entries of thetas (2), positive entries of transitively closed phis or phi^t, k-1 (3), phi^t, theta, k-1 (4, default), all entries of phis, thetas and k-1 (5) |
logtype |
logarithm type of the data (e.g. 2 for log2 data or exp(1) for natural) |
pen |
penalty weight for the data (e.g. pen=2 for approximate Akaike Information Criterion) |
useF |
use F (see publication) as complexity instead of phi and theta |
Fnorm |
normalize complexity of F, i.e. if two components have the same entry in F, it is only counted once |
... |
additional parameters for the mnem main function |
list containing the result of the best k as an mnem object and the raw and penalized log likelihoods
Martin Pirkl
1 2 3 4 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.