Evidence map›Paper›PMID 20932336›Full record

ArticleBMC bioinformatics2010

Misty Mountain clustering: application to fast unsupervised flow cytometry gating.

István P Sugár, Stuart C Sealfon

Abstract read
In one paragraph

Article in BMC bioinformatics, 2010. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 13 papers.

0numbers the graph read from it
0cells of the map it votes in
13citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

13 citing papers in PubMed.

  1. Article
  2. [Automatic clustering method of flow cytometry data based onSheng wu yi xue gong cheng xue za zhi = Journal of biomedical engineering = Shengwu yixue gongchengxue zazhi · 2018
    Article
  3. Toward deterministic and semiautomated SPADE analysis.Cytometry. Part A : the journal of the International Society for Analytical Cytology · 2017
    Article
  4. [Cell data clustering method in flow cytometry based on kernel principal component analysis].Sheng wu yi xue gong cheng xue za zhi = Journal of biomedical engineering = Shengwu yixue gongchengxue zazhi · 2017
    Article
  5. Article
  6. Computational prediction of manually gated rare cells in flow cytometry data.Cytometry. Part A : the journal of the International Society for Analytical Cytology · 2015
    Article
  7. Automated identification of stratifying signatures in cellular subpopulations.Proceedings of the National Academy of Sciences of the United States of America · 2014
    Article
  8. Application of user-guided automated cytometric data analysis to large-scale immunoprofiling of invariant natural killer T cells.Proceedings of the National Academy of Sciences of the United States of America · 2013
    Article
  9. Article
  10. Review
  11. RchyOptimyx: cellular hierarchy optimization for flow cytometry.Cytometry. Part A : the journal of the International Society for Analytical Cytology · 2012
    Article
  12. Article
  13. Unfold High-Dimensional Clouds for Exhaustive Gating of Flow Cytometry Data.IEEE/ACM transactions on computational biology and bioinformatics
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

István P SugárDepartment of Neurology and Center for Translational Systems Biology, Mount Sinai School of Medicine, New York, NY, USA. istvan.sugar@mssm.edu
Stuart C Sealfon

Funding

PHS HHS HHSN266200500021C
6 · The paper itself

Abstract

backgroundThere are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large, multidimensional datasets, such as flow cytometry data, prove unsatisfactory in terms of speed, problems with local minima or cluster shape bias. Model-based approaches are restricted by the assumptions of the fitting functions. Furthermore, model based clustering requires serial clustering for all cluster numbers within a user defined interval. The final cluster number is then selected by various criteria. These supervised serial clustering methods are time consuming and frequently different criteria result in different optimal cluster numbers. Various unsupervised heuristic approaches that have been developed such as affinity propagation are too expensive to be applied to datasets on the order of 106 points that are often generated by high throughput experiments.

resultsTo circumvent these limitations, we developed a new, unsupervised density contour clustering algorithm, called Misty Mountain, that is based on percolation theory and that efficiently analyzes large data sets. The approach can be envisioned as a progressive top-down removal of clouds covering a data histogram relief map to identify clusters by the appearance of statistically distinct peaks and ridges. This is a parallel clustering method that finds every cluster after analyzing only once the cross sections of the histogram. The overall run time for the composite steps of the algorithm increases linearly by the number of data points. The clustering of 106 data points in 2D data space takes place within about 15 seconds on a standard laptop PC. Comparison of the performance of this algorithm with other state of the art automated flow cytometry gating methods indicate that Misty Mountain provides substantial improvements in both run time and in the accuracy of cluster assignment.

conclusionsMisty Mountain is fast, unbiased for cluster shape, identifies stable clusters and is robust to noise. It provides a useful, general solution for multidimensional clustering problems. We demonstrate its suitability for automated gating of flow cytometry data.

Indexed as

SoftwareAlgorithmsCluster AnalysisDatabases, FactualFlow Cytometry

Identifiers

PMID20932336
PMCPMC2967560

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.