“…Our experimental setup compared the performance of graph-sc with 12 competing methods, representative of both scenarios. ScziDesk (Chen et al, 2020), scDeepClustering (Tian et al, 2019), scRNA (Mieth et al, 2019), cidr (Lin et al, 2017) and soup (Zhu et al, 2019) take as input the expected number of clusters while scGNN (Wang et al, 2021), Seurat (Satija et al, 2015), scanpy (Wolf et al, 2018) implementation), desc (Li et al, 2020), scedar (Zhang et al, 2020), raceid (Muraro et al, 2016) and scvi (Lopez et al, 2018) perform clustering without any alternative information. In addition, 6 naive baselines (depicted in gray in all our plots) consisting of clustering with K-means the following dimensionality reduced version of the expression matrix were assessed: the first 2 (labeled pca2_kmeans) and 50 (labelled pca50_kmeans) principal components of X, the first 20 (umap20_kmeans) or 50 (umap50_kmeans) UMAP, the first 2 UMAP components of the 50 PCA (pca50_umap_kmeans) of X and with Leiden the best performing baseline, the 2 UMAP components of the 50 PCA of X (labelled pca50_umap_leiden).…”