Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis

DOI10.1016/J.TCS.2012.01.024zbMATH Open1238.68124OpenAlexW1989810298MaRDI QIDQ418747FDOQ418747

Authors: R. Giancarlo, F. Utro 

Publication date: 30 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.024

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

zbMATH Keywords

machine learningcomputational biologybioinformaticsalgorithms and data structuresanalysis of massive datasetsgeneral statistics

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Data structures (68P05) General biology and biomathematics (92B05)

Cites Work

• Estimating the number of clusters in a data set via the gap statistic
• Finding Groups in Data
• Title not available (Why is that?)
• Bagging predictors
• Comparison of Discrimination Methods for the Classification of Tumors Using Gene Expression Data
• Extensions of Lipschitz mappings into a Hilbert space
• Title not available (Why is that?)
• An elementary proof of a theorem of Johnson and Lindenstrauss
• Title not available (Why is that?)
• Learning the parts of objects by non-negative matrix factorization
• Title not available (Why is that?)
• Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data
• A Method for Comparing Two Hierarchical Clusterings
• The Geometry of Information Retrieval
• Title not available (Why is that?)
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• A Sober Look at Clustering Stability
• Bootstrapping cluster analysis: Assessing the reliability of conclusions from microarray experi\-ments.
• Problems and results in extremal combinatorics. II
• On some significance tests in cluster analysis
• Resampling method for unsupervised estimation of cluster validity
• Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
• A resampling approach to cluster validation
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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.

Uses Software

• SAS
• Mosclust
• bootstrap
• clusfind
• GenClust
• clustervalidation

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)