# Batch integration graph

Removing batch effects while preserving biological variation (graph output)

3 datasets · 40 methods · 5 control methods · 4 metrics

This is a sub-task of the overall batch integration task. Batch (or data) integration methods integrate datasets across batches that arise from various biological and technical sources. Methods that integrate batches typically have three different types of output: a corrected feature matrix, a joint embedding across batches, and/or an integrated cell-cell similarity graph (e.g., a kNN graph). This sub-task focuses on all methods that can output integrated graphs, and includes methods that canonically output the other two data formats with subsequent postprocessing to generate a graph. Other sub-tasks for batch integration can be found for:

This sub-task was taken from a benchmarking study of data integration methods.

## Summary

## Metrics

**ARI**(Luecken et al. 2021): ARI (Adjusted Rand Index) compares the overlap of two clusterings. It considers both correct clustering overlaps while also counting correct disagreements between two clustering.**Graph connectivity**(Luecken et al. 2021): The graph connectivity metric assesses whether the kNN graph representation, G, of the integrated data connects all cells with the same cell identity label.**Isolated label F1**(Luecken et al. 2021): Isolated cell labels are identified as the labels present in the least number of batches in the integration task. The score evaluates how well these isolated labels separate from other cell identities based on clustering.**NMI**(Luecken et al. 2021): NMI compares the overlap of two clusterings. We used NMI to compare the cell-type labels with Louvain clusters computed on the integrated dataset.

## Results

Results table of the scores per method, dataset and metric (after scaling). Use the filters to make a custom subselection of methods and datasets. The “Overall mean” dataset is the mean value across all datasets.

## Details

## Methods

**Random Integration by Batch**(Open Problems for Single Cell Analysis Consortium 2022): Feature values, embedding coordinates, and graph connectivity are all randomly permuted within each batch label. Links: Docs.**BBKNN (full/scaled)**(Polański et al. 2019): BBKNN or batch balanced k nearest neighbours graph is built for each cell by identifying its k nearest neighbours within each defined batch separately, creating independent neighbour sets for each cell in each batch. These sets are then combined and processed with the UMAP algorithm for visualisation. Links: Docs.**BBKNN (full/unscaled)**(Polański et al. 2019): BBKNN or batch balanced k nearest neighbours graph is built for each cell by identifying its k nearest neighbours within each defined batch separately, creating independent neighbour sets for each cell in each batch. These sets are then combined and processed with the UMAP algorithm for visualisation. Links: Docs.**BBKNN (hvg/scaled)**(Polański et al. 2019): BBKNN or batch balanced k nearest neighbours graph is built for each cell by identifying its k nearest neighbours within each defined batch separately, creating independent neighbour sets for each cell in each batch. These sets are then combined and processed with the UMAP algorithm for visualisation. Links: Docs.**BBKNN (hvg/unscaled)**(Polański et al. 2019): BBKNN or batch balanced k nearest neighbours graph is built for each cell by identifying its k nearest neighbours within each defined batch separately, creating independent neighbour sets for each cell in each batch. These sets are then combined and processed with the UMAP algorithm for visualisation. Links: Docs.**Random Graph by Celltype**(Open Problems for Single Cell Analysis Consortium 2022): Cells are embedded as a one-hot encoding of celltype labels. A graph is then built on this embedding. Links: Docs.**Random Integration by Celltype**(Open Problems for Single Cell Analysis Consortium 2022): Feature values, embedding coordinates, and graph connectivity are all randomly permuted within each celltype label. Links: Docs.**Combat (full/scaled)**(Johnson, Li, and Rabinovic 2006): ComBat uses an Empirical Bayes (EB) approach to correct for batch effects. It estimates batch-specific parameters by pooling information across genes in each batch and shrinks the estimates towards the overall mean of the batch effect estimates across all genes. These parameters are then used to adjust the data for batch effects, leading to more accurate and reproducible results. Links: Docs.**Combat (full/unscaled)**(Johnson, Li, and Rabinovic 2006): ComBat uses an Empirical Bayes (EB) approach to correct for batch effects. It estimates batch-specific parameters by pooling information across genes in each batch and shrinks the estimates towards the overall mean of the batch effect estimates across all genes. These parameters are then used to adjust the data for batch effects, leading to more accurate and reproducible results. Links: Docs.**Combat (hvg/scaled)**(Johnson, Li, and Rabinovic 2006): ComBat uses an Empirical Bayes (EB) approach to correct for batch effects. It estimates batch-specific parameters by pooling information across genes in each batch and shrinks the estimates towards the overall mean of the batch effect estimates across all genes. These parameters are then used to adjust the data for batch effects, leading to more accurate and reproducible results. Links: Docs.**Combat (hvg/unscaled)**(Johnson, Li, and Rabinovic 2006): ComBat uses an Empirical Bayes (EB) approach to correct for batch effects. It estimates batch-specific parameters by pooling information across genes in each batch and shrinks the estimates towards the overall mean of the batch effect estimates across all genes. These parameters are then used to adjust the data for batch effects, leading to more accurate and reproducible results. Links: Docs.**FastMNN embed (full/scaled)**(Lun 2019): fastMNN performs a multi-sample PCA to reduce dimensionality, identifying MNN paris in the low-dimensional space, and then correcting the target batch towards the reference using locally weighted correction vectors. The corrected target batch is then merged with the reference. The process is repeated with the next target batch except for the PCA step. Links: Docs.**FastMNN embed (full/unscaled)**(Lun 2019): fastMNN performs a multi-sample PCA to reduce dimensionality, identifying MNN paris in the low-dimensional space, and then correcting the target batch towards the reference using locally weighted correction vectors. The corrected target batch is then merged with the reference. The process is repeated with the next target batch except for the PCA step. Links: Docs.**FastMNN embed (hvg/scaled)**(Lun 2019): fastMNN performs a multi-sample PCA to reduce dimensionality, identifying MNN paris in the low-dimensional space, and then correcting the target batch towards the reference using locally weighted correction vectors. The corrected target batch is then merged with the reference. The process is repeated with the next target batch except for the PCA step. Links: Docs.**FastMNN embed (hvg/unscaled)**(Lun 2019): fastMNN performs a multi-sample PCA to reduce dimensionality, identifying MNN paris in the low-dimensional space, and then correcting the target batch towards the reference using locally weighted correction vectors. The corrected target batch is then merged with the reference. The process is repeated with the next target batch except for the PCA step. Links: Docs.**FastMNN feature (full/scaled)**(Lun 2019): fastMNN performs a multi-sample PCA to reduce dimensionality, identifying MNN paris in the low-dimensional space, and then correcting the target batch towards the reference using locally weighted correction vectors. The corrected target batch is then merged with the reference. The process is repeated with the next target batch except for the PCA step. Links: Docs.**FastMNN feature (full/unscaled)**(Lun 2019): fastMNN performs a multi-sample PCA to reduce dimensionality, identifying MNN paris in the low-dimensional space, and then correcting the target batch towards the reference using locally weighted correction vectors. The corrected target batch is then merged with the reference. The process is repeated with the next target batch except for the PCA step. Links: Docs.**FastMNN feature (hvg/scaled)**(Lun 2019): fastMNN performs a multi-sample PCA to reduce dimensionality, identifying MNN paris in the low-dimensional space, and then correcting the target batch towards the reference using locally weighted correction vectors. The corrected target batch is then merged with the reference. The process is repeated with the next target batch except for the PCA step. Links: Docs.**FastMNN feature (hvg/unscaled)**(Lun 2019): fastMNN performs a multi-sample PCA to reduce dimensionality, identifying MNN paris in the low-dimensional space, and then correcting the target batch towards the reference using locally weighted correction vectors. The corrected target batch is then merged with the reference. The process is repeated with the next target batch except for the PCA step. Links: Docs.**Harmony (full/scaled)**(Korsunsky et al. 2019): Harmony is a method that uses PCA to group the cells into multi-dataset clusters, and then computes cluster-specific linear correction factors. Each cell is then corrected by its cell-specific linear factor using the cluster-weighted average. The method keeps iterating these four steps until cell clusters are stable. Links: Docs.**Harmony (full/unscaled)**(Korsunsky et al. 2019): Harmony is a method that uses PCA to group the cells into multi-dataset clusters, and then computes cluster-specific linear correction factors. Each cell is then corrected by its cell-specific linear factor using the cluster-weighted average. The method keeps iterating these four steps until cell clusters are stable. Links: Docs.**Harmony (hvg/scaled)**(Korsunsky et al. 2019): Harmony is a method that uses PCA to group the cells into multi-dataset clusters, and then computes cluster-specific linear correction factors. Each cell is then corrected by its cell-specific linear factor using the cluster-weighted average. The method keeps iterating these four steps until cell clusters are stable. Links: Docs.**Harmony (hvg/unscaled)**(Korsunsky et al. 2019): Harmony is a method that uses PCA to group the cells into multi-dataset clusters, and then computes cluster-specific linear correction factors. Each cell is then corrected by its cell-specific linear factor using the cluster-weighted average. The method keeps iterating these four steps until cell clusters are stable. Links: Docs.**Liger (full/unscaled)**(Welch et al. 2019): LIGER or linked inference of genomic experimental relationships uses iNMF deriving and implementing a novel coordinate descent algorithm to efficiently do the factorization. Joint clustering is performed and factor loadings are normalised. Links: Docs.**Liger (hvg/unscaled)**(Welch et al. 2019): LIGER or linked inference of genomic experimental relationships uses iNMF deriving and implementing a novel coordinate descent algorithm to efficiently do the factorization. Joint clustering is performed and factor loadings are normalised. Links: Docs.**MNN (full/scaled)**(Haghverdi et al. 2018): MNN first detects mutual nearest neighbours in two of the batches and infers a projection of the second onto the first batch. After that, additional batches are added iteratively. Links: Docs.**MNN (full/unscaled)**(Haghverdi et al. 2018): MNN first detects mutual nearest neighbours in two of the batches and infers a projection of the second onto the first batch. After that, additional batches are added iteratively. Links: Docs.**MNN (hvg/scaled)**(Haghverdi et al. 2018): MNN first detects mutual nearest neighbours in two of the batches and infers a projection of the second onto the first batch. After that, additional batches are added iteratively. Links: Docs.**MNN (hvg/unscaled)**(Haghverdi et al. 2018): MNN first detects mutual nearest neighbours in two of the batches and infers a projection of the second onto the first batch. After that, additional batches are added iteratively. Links: Docs.**No Integration**(Open Problems for Single Cell Analysis Consortium 2022): Cells are embedded by PCA on the unintegrated data. A graph is built on this PCA embedding. Links: Docs.**Random Integration**(Open Problems for Single Cell Analysis Consortium 2022): Feature values, embedding coordinates, and graph connectivity are all randomly permuted. Links: Docs.**SCALEX (full)**(Xiong et al. 2022): SCALEX is a method for integrating heterogeneous single-cell data online using a VAE framework. Its generalised encoder disentangles batch-related components from batch-invariant biological components, which are then projected into a common cell-embedding space. Links: Docs.**SCALEX (hvg)**(Xiong et al. 2022): SCALEX is a method for integrating heterogeneous single-cell data online using a VAE framework. Its generalised encoder disentangles batch-related components from batch-invariant biological components, which are then projected into a common cell-embedding space. Links: Docs.**Scanorama (full/scaled)**(Hie, Bryson, and Berger 2019): Scanorama is an extension of the MNN method. Other then MNN, it finds mutual nearest neighbours over all batches and embeds observations into a joint hyperplane. Links: Docs.**Scanorama (full/unscaled)**(Hie, Bryson, and Berger 2019): Scanorama is an extension of the MNN method. Other then MNN, it finds mutual nearest neighbours over all batches and embeds observations into a joint hyperplane. Links: Docs.**Scanorama (hvg/scaled)**(Hie, Bryson, and Berger 2019): Scanorama is an extension of the MNN method. Other then MNN, it finds mutual nearest neighbours over all batches and embeds observations into a joint hyperplane. Links: Docs.**Scanorama (hvg/unscaled)**(Hie, Bryson, and Berger 2019): Scanorama is an extension of the MNN method. Other then MNN, it finds mutual nearest neighbours over all batches and embeds observations into a joint hyperplane. Links: Docs.**Scanorama gene output (full/scaled)**(Hie, Bryson, and Berger 2019): Scanorama is an extension of the MNN method. Other then MNN, it finds mutual nearest neighbours over all batches and embeds observations into a joint hyperplane. Links: Docs.**Scanorama gene output (full/unscaled)**(Hie, Bryson, and Berger 2019): Scanorama is an extension of the MNN method. Other then MNN, it finds mutual nearest neighbours over all batches and embeds observations into a joint hyperplane. Links: Docs.**Scanorama gene output (hvg/scaled)**(Hie, Bryson, and Berger 2019): Scanorama is an extension of the MNN method. Other then MNN, it finds mutual nearest neighbours over all batches and embeds observations into a joint hyperplane. Links: Docs.**Scanorama gene output (hvg/unscaled)**(Hie, Bryson, and Berger 2019): Scanorama is an extension of the MNN method. Other then MNN, it finds mutual nearest neighbours over all batches and embeds observations into a joint hyperplane. Links: Docs.**scANVI (full/unscaled)**(Xu et al. 2021): ScanVI is an extension of scVI but instead using a Bayesian semi-supervised approach for more principled cell annotation. Links: Docs.**scANVI (hvg/unscaled)**(Xu et al. 2021): ScanVI is an extension of scVI but instead using a Bayesian semi-supervised approach for more principled cell annotation. Links: Docs.**scVI (full/unscaled)**(Lopez et al. 2018): scVI combines a variational autoencoder with a hierarchical Bayesian model. Links: Docs.**scVI (hvg/unscaled)**(Lopez et al. 2018): scVI combines a variational autoencoder with a hierarchical Bayesian model. Links: Docs.

## Baseline methods

**Random Integration by Batch**: Feature values, embedding coordinates, and graph connectivity are all randomly permuted within each batch label.**Random Graph by Celltype**: Cells are embedded as a one-hot encoding of celltype labels. A graph is then built on this embedding.**Random Integration by Celltype**: Feature values, embedding coordinates, and graph connectivity are all randomly permuted within each celltype label.**No Integration**: Cells are embedded by PCA on the unintegrated data. A graph is built on this PCA embedding.**Random Integration**: Feature values, embedding coordinates, and graph connectivity are all randomly permuted.

## Datasets

**Immune (by batch)**(Luecken et al. 2021): Human immune cells from peripheral blood and bone marrow taken from 5 datasets comprising 10 batches across technologies (10X, Smart-seq2).**Lung (Viera Braga et al.)**(Luecken et al. 2021): Human lung scRNA-seq data from 3 datasets with 32,472 cells. From Vieira Braga et al. Technologies: 10X and Drop-seq.**Pancreas (by batch)**(Luecken et al. 2021): Human pancreatic islet scRNA-seq data from 6 datasets across technologies (CEL-seq, CEL-seq2, Smart-seq2, inDrop, Fluidigm C1, and SMARTER-seq).

## Quality control results

✓ All checks succeeded!

## Raw results

## Visualization of raw results

## References

*Nature Biotechnology*36 (5): 421–27. https://doi.org/10.1038/nbt.4091.

*Nature Biotechnology*37 (6): 685–91. https://doi.org/10.1038/s41587-019-0113-3.

*Biostatistics*8 (1): 118–27. https://doi.org/10.1093/biostatistics/kxj037.

*Nature Methods*16 (12): 1289–96. https://doi.org/10.1038/s41592-019-0619-0.

*Nature Methods*15 (12): 1053–58. https://doi.org/10.1038/s41592-018-0229-2.

*Nature Methods*19 (1): 41–50. https://doi.org/10.1038/s41592-021-01336-8.

*Bioinformatics*. https://doi.org/10.1093/bioinformatics/btz625.

*Cell*177 (7): 1873–1887.e17. https://doi.org/10.1016/j.cell.2019.05.006.

*Nature Communications*13 (1). https://doi.org/10.1038/s41467-022-33758-z.

*Molecular Systems Biology*17 (1). https://doi.org/10.15252/msb.20209620.