Description Usage Arguments Details Value
This function calculates the FJLT and project onto d dimensions. The FJLT is faster than standard random pro-jections and just as easy to implement. It is based upon the preconditioning of a sparse projection matrix with a randomized Fourier transform.
1 | fjlt(x, k = 100)
|
x |
input expression matrix |
k |
number of dimension to reduce to |
Ailon, N. and Chazelle, B. Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. in Proceedings of the thirty-eighth annual ACM symposium on Theory of computing 557–563 (ACM, 2006).
Functions adapted from: http://www.cs.ubc.ca/~jaquesn/MachineLearningTheory.pdf
transformed reduced expression matrix
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.