Forest Fire Clustering for Single-cell Sequencing with Iterative Label Propagation and Parallelized Monte Carlo Simulation

Abstract

In the era of single-cell sequencing, there is a growing need to extract insights from data with clustering methods. Here, we introduce Forest Fire Clustering, an efficient and interpretable method for cell-type discovery from single-cell data. Forest Fire Clustering makes minimal prior assumptions and, different from current approaches, calculates a non-parametric posterior probability that each cell is assigned a cell-type label. These posterior distributions allow for the evaluation of a label confidence for each cell and enable the computation of "label entropies," highlighting transitions along developmental trajectories. Furthermore, we show that Forest Fire Clustering can make robust, inductive inferences in an online-learning context and can readily scale to millions of cells. Finally, we demonstrate that our method outperforms state-of-the-art clustering approaches on diverse benchmarks of simulated and experimental data. Overall, Forest Fire Clustering is a useful tool for rare cell type discovery in large-scale single-cell analysis.

arXiv comment30 pages, 6 figures

References in corpus (10)

• Scikit-learn: Machine Learning in Python
• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Array Programming with NumPy
• UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction
• From Louvain to Leiden: guaranteeing well-connected communities
• Generalized Louvain Method for Community Detection in Large Networks
• Graph Evolution: Densification and Shrinking Diameters
• Diffusion $K$-means clustering on manifolds: provable exact recovery via semidefinite relaxations
• Selective Inference for Hierarchical Clustering
• Monte Carlo approximation certificates for k-means clustering