misty mountain a parallel clustering method application
play

Misty Mountain A Parallel Clustering Method. Application to Fast - PowerPoint PPT Presentation

Misty Mountain A Parallel Clustering Method. Application to Fast Unsupervised Flow Cytometry Gating Istvn P. Sugr and Stuart C. Sealfon Istvn P. Sugr and Stuart C. Sealfon Department of Neurology and Center for D t t f N l d C


  1. Misty Mountain – A Parallel Clustering Method. Application to Fast Unsupervised Flow Cytometry Gating István P. Sugár and Stuart C. Sealfon István P. Sugár and Stuart C. Sealfon Department of Neurology and Center for D t t f N l d C t f Translational Systems Biology, Mount Si Sinai School of Medicine, New York i S h l f M di i N Y k

  2. Misty Mountain clustering/automated gating: - unsupervised - unbiased for cluster shape unbiased for cluster shape - fast (run time increases linearly with the number of data points) the number of data points) - high clustering accuracy in multiple “ “gold standard tests” ld t d d t t ”

  3. Steps of Misty Mountain clustering Steps of Misty Mountain clustering The multi-dimensional data is first processed to The multi dimensional data is first processed to generate a histogram containing an optimal number of bins by using Knuth’s data-based optimization criterion. Then cross sections of the histogram are created. The algorithm finds the largest cross section of each statistically significant histogram peak. Th The data points belonging to these largest cross d i b l i h l sections define the clusters of the data set

  4. Knuth’s data-based binning for histogram The N that maximizes the following function is the optimal bin number along each coordinate axis: p N d = log ( | ) D D N ( ) ∑ + Γ − Γ − Γ + + Γ + + D D D D n log N log 0.5 N N log (0.5) log ( n 0.5 N ) log ( n 0.5) const . k = k 1 n = number of data points n k = number of data points in the k-th bin D = dimension of the data space p(N|d) = probability for the number of bins of similar shape at given data d. (N|d) b bilit f th b f bi f i il h t i d t d Γ (x) = gamma function

  5. Misty Mountain clustering Misty Mountain clustering b

  6. Comparison of different methods by clustering the same 2D barcoding data set g Comparison of clustering accuracy Clustering Clustering accuracy Method sensitivity (%) specificity (%) Misty Mountain 100 100 20 a 33 a 20 33 FLAME 60 b 50 b 45 a* 60 a* flowClust 60 b* 55 b* fl flowMerge M 25 25 45 45 flowJo 45 47 # of correctly assigned clusters sensitivity= # # of f clusters l t i in gold ld standard t d d # of correctly assigned clusters specificity= total # of assigned clusters Gold standards were independent expert manual clustering Gold standards were independent expert manual clustering for 2D barcoding data.

  7. Serial vs. Parallel Clustering Model based clustering requires serial clustering for all cluster numbers within a g user defined interval. Then the optimal cluster number is selected by an y information criterion. Misty Mountain is a parallel clustering Misty Mountain is a parallel clustering method that finds every cluster after analyzing only once the cross sections of analyzing only once the cross sections of the histogram

  8. Performance of Misty Mountain clustering in flowCAP challenges #1 flowCAP challenges #1 Stem GvHD DLBCL ( (D=4) ) (D=4) ( ) (D=3) ( ) Number of data sets 30 12 30 Average CPU per data 0.284 0.623 0.184 set (sec) Total CPU for all data 8.52 7.48 5.52 sets (sec) Cluster # deviates by 0 67% 42% 40% from manual clustering f l l t i Cluster # deviates by 1 27% 58% 43% from manual clustering Cluster # deviates by 2 Cluster # deviates by 2 6% 0% 17% from manual clustering

  9. Acknowledgements We thank Profs. D. Stäuffer and B. Roysam for sending the source code of a Hoshen Kopelman type cluster counting algorithm and code of a Hoshen-Kopelman type cluster counting algorithm and spectral clustering, respectively. We also thank Prof. F. Hayot for the critical evaluation of the manuscript. We acknowledge Drs. B. Hartman and J. Seto for providing the FCM data and Dr. German Nudelman for making the program available on the web Dr Nudelman for making the program available on the web. Dr. Yongchao Ge for analyzing FCM data with flowClust and flowMerge. We are grateful for Prof. Ryan Brinkman for providing access to the GvHD flow cytometry data sets and to Prof. Hans Snoeck for providing the OP9 dataset This work from the Program for providing the OP9 dataset. This work from the Program for Research in Immune Modeling and Experimentation (PRIME) was supported by contract NIH/NIAID HHSN266200500021C. Publication Sugar, IP; Sealfon, SC (2010) Misty Mountain clustering: application to fast unsupervised flow cytometry gating, BMC Bioinformatics, in press

  10. Comparison of different methods by clustering the same 4D OP9 data set Comparison of clustering accuracy Cl Clustering t i Clustering accuracy Cluster CPU Method spec number (sec) sens (%) (%) 5 Misty 100 100 100 100 3 6 3.6 Mountain 4 60 75 flowClust 3660 60 38 8 flowMerge 25 45 7 8400 # of correctly assigned clusters sensitivity= # of clusters in gold standard # of correctly assigned clusters specificity= spec c y total # of assigned clusters Manual gating of 4D OP9 data set Gold standards were independent expert manual clustering A) 4 clusters were gated in the APC/PE CY7 plane, B-E) for 4D OP9 data. elements of each of the 4 clusters are projected into the PerPC-CY5/FITC plane. In this plane only one of the four C C / C l hi l l f h f clusters splitted into two clusters, while the others remained single clusters. Thus the manual gating identified 5 clusters total.

  11. Goal of the cluster analysis Goal of the cluster analysis Select from the experimental data separated clusters of data points where separated clusters of data points where each cluster characterizes the respective group of data points g p p

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend