Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

CHAI: consensus clustering through similarity matrix integration for cell-type identification

View through CrossRef
Abstract Several methods have been developed to computationally predict cell-types for single cell RNA sequencing (scRNAseq) data. As methods are developed, a common problem for investigators has been identifying the best method they should apply to their specific use-case. To address this challenge, we present CHAI (consensus Clustering tHrough similArIty matrix integratIon for single cell-type identification), a wisdom of crowds approach for scRNAseq clustering. CHAI presents two competing methods which aggregate the clustering results from seven state-of-the-art clustering methods: CHAI-AvgSim and CHAI-SNF. CHAI-AvgSim and CHAI-SNF demonstrate superior performance across several benchmarking datasets. Furthermore, both CHAI methods outperform the most recent consensus clustering method, SAME-clustering. We demonstrate CHAI’s practical use case by identifying a leader tumor cell cluster enriched with CDH3. CHAI provides a platform for multiomic integration, and we demonstrate CHAI-SNF to have improved performance when including spatial transcriptomics data. CHAI overcomes previous limitations by incorporating the most recent and top performing scRNAseq clustering algorithms into the aggregation framework. It is also an intuitive and easily customizable R package where users may add their own clustering methods to the pipeline, or down-select just the ones they want to use for the clustering aggregation. This ensures that as more advanced clustering algorithms are developed, CHAI will remain useful to the community as a generalized framework. CHAI is available as an open source R package on GitHub: https://github.com/lodimk2/chai.
Title: CHAI: consensus clustering through similarity matrix integration for cell-type identification
Description:
Abstract Several methods have been developed to computationally predict cell-types for single cell RNA sequencing (scRNAseq) data.
As methods are developed, a common problem for investigators has been identifying the best method they should apply to their specific use-case.
To address this challenge, we present CHAI (consensus Clustering tHrough similArIty matrix integratIon for single cell-type identification), a wisdom of crowds approach for scRNAseq clustering.
CHAI presents two competing methods which aggregate the clustering results from seven state-of-the-art clustering methods: CHAI-AvgSim and CHAI-SNF.
CHAI-AvgSim and CHAI-SNF demonstrate superior performance across several benchmarking datasets.
Furthermore, both CHAI methods outperform the most recent consensus clustering method, SAME-clustering.
We demonstrate CHAI’s practical use case by identifying a leader tumor cell cluster enriched with CDH3.
CHAI provides a platform for multiomic integration, and we demonstrate CHAI-SNF to have improved performance when including spatial transcriptomics data.
CHAI overcomes previous limitations by incorporating the most recent and top performing scRNAseq clustering algorithms into the aggregation framework.
It is also an intuitive and easily customizable R package where users may add their own clustering methods to the pipeline, or down-select just the ones they want to use for the clustering aggregation.
This ensures that as more advanced clustering algorithms are developed, CHAI will remain useful to the community as a generalized framework.
CHAI is available as an open source R package on GitHub: https://github.
com/lodimk2/chai.

Related Results

CHAI: Consensus Clustering Through Similarity Matrix Integration for Cell-Type Identification
CHAI: Consensus Clustering Through Similarity Matrix Integration for Cell-Type Identification
ABSTRACT Several methods have been developed to computationally predict cell-types for single cell RNA sequencing (scRNAseq) data. As methods are...
Complex Collision Tumors: A Systematic Review
Complex Collision Tumors: A Systematic Review
Abstract Introduction: A collision tumor consists of two distinct neoplastic components located within the same organ, separated by stromal tissue, without histological intermixing...
Frequency of Common Chromosomal Abnormalities in Patients with Idiopathic Acquired Aplastic Anemia
Frequency of Common Chromosomal Abnormalities in Patients with Idiopathic Acquired Aplastic Anemia
Objective: To determine the frequency of common chromosomal aberrations in local population idiopathic determine the frequency of common chromosomal aberrations in local population...
Similarity Search with Data Missing
Similarity Search with Data Missing
Similarity search is a fundamental research problem with broad applications in various research fields, including data mining, information retrieval, and machine learning. The core...
A Proposed Clustering Algorithm for Efficient Clustering of High-Dimensional Data
A Proposed Clustering Algorithm for Efficient Clustering of High-Dimensional Data
To partition transaction data values, clustering algorithms are used. To analyse the relationships between transactions, similarity measures are utilized. Similarity models based o...
Chai Tea Promotes Ampicillin Susceptibility in MRSA
Chai Tea Promotes Ampicillin Susceptibility in MRSA
Staphylococcus aureus (S. aureus) is a pathogenic organism that asymptomatically resides on the skin and in nasal mucosal membranes of 11–40% of the worldwide population. S. aureus...
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background: Clustering is one of the most important data mining methods. The k-means (c-means ) and its derivative methods are the hotspot in the field of clustering research in re...
Konsep Dasar Ijmak sebagai Sumber Hukum Islam
Konsep Dasar Ijmak sebagai Sumber Hukum Islam
This study aimed to describe the basic concept of consensus as source of Islamic law. The description of basic concept of consensus consists of: 1) definition of consensus; 2) stat...

Back to Top