Last updated: 2018-09-14

workflowr checks: (Click a bullet for more information)
Expand here to see past versions:


SLSL (Scaled Lasso Similarity Learning) is an unsupervised learning tool for clustering single cells using their expression level data. SLSL constructs many similarity matrices using different distance measures (Euclidean, Pearson, and Spearman), and different kernel parameters to account for the possible nonlinear structure. Then, SLSL employs scaled lasso to find optimal weights on each of those similarity matrices and infer one final sparse similarity matrix. This procedure does not have rank constraint unlike many popular unsupervised learning tools, because imposing such inflexible structure does not guarantee higher accuracy. Instead, we employ network diffusion to make the final similarity matrix closer to the block diagonal matrix. This is in effect equivalent to shrinking the less important eigenvalues. Lastly, SLSL sequentially performs dimension reduction using tSNE and kmeans for the final clustering result.


This reproducible R Markdown analysis was created with workflowr 1.1.1