Exploration of dimension reduction techniques for clustering spatial transcriptomics data

Spatial transcriptomics (ST) provides a spatially resolved, high-dimensional assessment of gene transcription. Spatial domain identification (SDI) is a critical task in ST, as it enables a deeper understanding of tissue microenvironments and biological functions. SDI typically involves a clustering step to infer spatial domains. Existing methods utilize statistical or deep learning models to incorporate spatial information for clustering. For statistical methods, Giotto implements a Hidden Markov Random Field model to detect spatial domains with consistent gene expression patterns, while BayesSpace uses a Bayesian model to encourage neighboring spots to be grouped together. [1] Among deep learning methods, GraphST uses graph convolutional networks and self-supervised contrastive learning to reconstruct gene expression matrix with spatial information. [2] SEDR adopts a variational graph autoencoder to produce embeddings that represent gene expression profiles with spatial information. However, existing methods face two major limitations in the clustering process. First, they often rely on a hardcoded number of clusters and/or model type. In practice, ground truth annotations, such as the number of spatial domains, are generally not available. Second, principal component analysis (PCA) is commonly used for dimension reduction of the gene expression matrix. However, PCA primarily captures variability that may not align with features needed for clustering, potentially hindering accurate domain identification. To tackle these limitations, we applied model-based clustering with various dimension reduction techniques. We compared and benchmarked different clustering and dimension reduction methods using the dorsolateral prefrontal cortex reference dataset consisting of 12 samples. Specifically, we experimented with mclust and substituted PCA with alternative dimensionality reduction techniques. Most importantly, we used the Bayesian Information Criterion (BIC) to select the best model and determine the optimal number of clusters. Clustering was performed on both the spatial embeddings and the spatially enhanced gene expression matrix, with results compared to external knowledge using the Adjusted Rand Index (ARI). Our preliminary results on dimensionality reduction methods suggest that Spatially Variable Genes (SVG) may offer a more effective approach compared to PCA. We explored various SVG selection methods, including Giotto KMeans, Giotto Rank, and Spark-X to reduce the dimensions of GraphST's reconstructed gene expression matrix. Using Giotto KMeans, the best BIC-selected model achieved a higher ARI of 0.6198, outperforming GraphST's default hardcoded model, which uses PCA embeddings for clustering and achieved an ARI of 0.5993 on sample 151673.

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2024-11-20
DOI
https://doi.org/10.5281/zenodo.14188936
Primary Topic
Neuroscience and Neural Engineering
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Exploration of dimension reduction techniques for clustering spatial transcriptomics data

Zenodo (CERN European Organization for Nuclear Research)
Neuroscience and Neural Engineering
article

Exploration of dimension reduction techniques for clustering spatial transcriptomics data

article en

Abstract

Spatial transcriptomics (ST) provides a spatially resolved, high-dimensional assessment of gene transcription. Spatial domain identification (SDI) is a critical task in ST, as it enables a deeper understanding of tissue microenvironments and biological functions. SDI typically involves a clustering step to infer spatial domains. Existing methods utilize statistical or deep learning models to incorporate spatial information for clustering. For statistical methods, Giotto implements a Hidden Markov Random Field model to detect spatial domains with consistent gene expression patterns, while BayesSpace uses a Bayesian model to encourage neighboring spots to be grouped together. [1] Among deep learning methods, GraphST uses graph convolutional networks and self-supervised contrastive learning to reconstruct gene expression matrix with spatial information. [2] SEDR adopts a variational graph autoencoder to produce embeddings that represent gene expression profiles with spatial information. However, existing methods face two major limitations in the clustering process. First, they often rely on a hardcoded number of clusters and/or model type. In practice, ground truth annotations, such as the number of spatial domains, are generally not available. Second, principal component analysis (PCA) is commonly used for dimension reduction of the gene expression matrix. However, PCA primarily captures variability that may not align with features needed for clustering, potentially hindering accurate domain identification. To tackle these limitations, we applied model-based clustering with various dimension reduction techniques. We compared and benchmarked different clustering and dimension reduction methods using the dorsolateral prefrontal cortex reference dataset consisting of 12 samples. Specifically, we experimented with mclust and substituted PCA with alternative dimensionality reduction techniques. Most importantly, we used the Bayesian Information Criterion (BIC) to select the best model and determine the optimal number of clusters. Clustering was performed on both the spatial embeddings and the spatially enhanced gene expression matrix, with results compared to external knowledge using the Adjusted Rand Index (ARI). Our preliminary results on dimensionality reduction methods suggest that Spatially Variable Genes (SVG) may offer a more effective approach compared to PCA. We explored various SVG selection methods, including Giotto KMeans, Giotto Rank, and Spark-X to reduce the dimensions of GraphST's reconstructed gene expression matrix. Using Giotto KMeans, the best BIC-selected model achieved a higher ARI of 0.6198, outperforming GraphST's default hardcoded model, which uses PCA embeddings for clustering and achieved an ARI of 0.5993 on sample 151673.

Zenodo (CERN European Organization for Nuclear Research)
University of Washington (US)
Openalex Percentile: Top 59%
Neuroscience and Neural Engineering
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.