Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis
From MaRDI portal
(Redirected from Publication:418747)
Recommendations
- Cluster structure inference based on clustering stability with applications to microarray data analysis
- scientific article; zbMATH DE number 1928681
- Computing and Combinatorics
- Algorithmic and complexity issues of three clustering methods in microarray data analysis
- Structural, Syntactic, and Statistical Pattern Recognition
- Stability-Based Validation of Clustering Solutions
- Clustering microarray data: theoretical and practical issues
Cites work
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 708500 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 7051258 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3083043 (Why is no real title available?)
- A Method for Comparing Two Hierarchical Clusterings
- A Sober Look at Clustering Stability
- A resampling approach to cluster validation
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Bagging predictors
- Bootstrapping cluster analysis: Assessing the reliability of conclusions from microarray experi\-ments.
- Comparison of Discrimination Methods for the Classification of Tumors Using Gene Expression Data
- Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Estimating the number of clusters in a data set via the gap statistic
- Extensions of Lipschitz mappings into a Hilbert space
- Finding Groups in Data
- Learning the parts of objects by non-negative matrix factorization
- On some significance tests in cluster analysis
- Problems and results in extremal combinatorics. II
- Resampling method for unsupervised estimation of cluster validity
- The Geometry of Information Retrieval
- The adjusted rand statistic: A SAS macro
Cited in
(7)- DNA combinatorial messages and epigenomics: the case of chromatin organization and nucleosome occupancy in eukaryotic genomes
- An algorithm for deciding the number of clusters and validation using simulated data with application to exploring crop population structure
- scientific article; zbMATH DE number 1928681 (Why is no real title available?)
- Stability estimation for unsupervised clustering: a review
- Cluster structure inference based on clustering stability with applications to microarray data analysis
- Algorithmic and complexity issues of three clustering methods in microarray data analysis
- Bootstrapping cluster analysis: Assessing the reliability of conclusions from microarray experi\-ments.
This page was built for publication: Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418747)