fsc3_fjlt.SCESet: Fast-Johnson-Lindenstrauss-Transform (FJLT)

In hemberg-lab/FastSC3: Fast Single-Cell Consensus Clustering

Description

This function calculates the FJLT and project onto d dimensions. The FJLT is faster than standard random projections and just as easy to implement. It is based upon the preconditioning of a sparse projection matrix with a randomized Fourier transform.

Usage

fsc3_fjlt.SCESet(object, k = 100)

## S4 method for signature 'SCESet'
fsc3_fjlt(object, k = 100)

Arguments

object	an object of 'SCESet' class
k	number of dimensions to reduce to

Details

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).

Calculate Fast-Johnson-Lindenstrauss-Transform (FJLT)

This function calculates FJLT projection of the processed_dataset item of the object@sc3 slot. It then creates and populates the following items of the object@sc3 slot:

• processed_dataset_fjlt - contains the FJLT transform of the processed_dataset

hemberg-lab/FastSC3 documentation built on May 17, 2019, 3:42 p.m.