A graph spectrum based geometric biclustering algorithm
From MaRDI portal
Recommendations
- Higher-order spectral clustering for geometric graphs
- Spectral methods for graph clustering - a survey
- scientific article; zbMATH DE number 2043367
- Spectral clustering algorithms for the detection of clusters in block-cyclic and block-acyclic graphs
- scientific article; zbMATH DE number 1409218
- Spectral clustering and biclustering. Learning large graphs and contingency tables
Cites work
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 1750182 (Why is no real title available?)
- 10.1162/153244303322753661
- A new geometric biclustering algorithm based on the Hough transform for analysis of large-scale microarray data
- Extracting conserved gene expression motifs from gene expression data
- PQN and DQN: algorithms for expression microarrays
- The disposition of the LZCC protein residues in wenxiang diagram provides new insights into the protein-protein interaction mechanism
- Tumor classification using phylogenetic methods on expression data
Cited in
(2)
This page was built for publication: A graph spectrum based geometric biclustering algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013269)