Matrix factorization \(A = B C\) with strictly positiv matrices \(B, C\) which minimize the reconstruction error \(\|A - B C\|\). This replicate-aware version of the non-negtive matrix factorization (NMF) is based on the alternating least squares approach and exploits the replicate information to speed up the calculation.
prismaNMF(prismaData, ncomp, time = 60, pca.init = TRUE, doNorm = TRUE, oldResult = NULL)
PRISMA data for which a NMF should be calculated.
either an integer
or prismaDimension
object specifying
the inner dimension of the matrix factorization.
seconds after which the calculation should end.
should the \(B\) matrix be initialized by a PCA.
should the \(B\) matrix normalized (i.e. all columns have the Euclidean length of 1).
re-use results of a previous run, i.e. \(B\) and \(C\) are pre-initialized with the values of this previous matrix factorization object.
Matrix factorization object containing the \(B\) and \(C\) matrix.
Krueger, T., Gascon, H., Kraemer, N., Rieck, K. (2012) Learning Stateful Models for Network Honeypots 5th ACM Workshop on Artificial Intelligence and Security (AISEC 2012), accepted
R. Albright, J. Cox, D. Duling, A. Langville, and C. Meyer. (2006) Algorithms, initializations, and convergence for the nonnegative matrix factorization. Technical Report 81706, North Carolina State University
# NOT RUN {
# please see the vingette for examles
# }
Run the code above in your browser using DataLab