Random walk biclustering for microarray data
From MaRDI portal
Publication:2476780
Recommendations
Cites work
- Biclustering in data mining
- Cluster validation techniques for genome expression data
- Feature selection for consistent biclustering via fractional 0-1 programming
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1750182 (Why is no real title available?)
Cited in
(11)- A new geometric biclustering algorithm based on the Hough transform for analysis of large-scale microarray data
- Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction
- A probabilistic relaxation labeling framework for reducing the noise effect in geometric biclustering of gene expression data
- A fuzzy biclustering algorithm for single cluster
- Finding Additive Biclusters with Random Background
- Improved biclustering on expression data through overlapping control
- Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
- Combinatorial Pattern Matching
- Search heuristics for module identification from biological high-thoughput data
- funBlalign: a hierachical algorithm for functional motif discovery based on mean squared residue scores
- MIB: using mutual information for biclustering gene expression data
This page was built for publication: Random walk biclustering for microarray data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476780)