Mining order-preserving submatrices from probabilistic matrices
From MaRDI portal
Publication:2943568
Recommendations
- Matrix methods in data mining and pattern recognition
- scientific article; zbMATH DE number 5161643
- Recovering all generalized order-preserving submatrices: new exact formulations and algorithms
- Integer matrix approximation and data mining
- Approximation algorithms for a minimization variant of the order-preserving submatrices and for biclustering problems
- Submodular stochastic probing on matroids
- Submodular stochastic probing on matroids
- Solving the order-preserving submatrix problem via integer programming
Cites work
- scientific article; zbMATH DE number 1178942 (Why is no real title available?)
- 10.1162/153244303322753661
- A generalized maximum entropy approach to Bregman co-clustering and matrix approximation
- An introduction to order statistics
- Erratum
- Extracting conserved gene expression motifs from gene expression data
- Importance of replication in microarray gene expression studies: Statistical methods and evidence from repetitive cDNA hybridizations
- MIB: using mutual information for biclustering gene expression data
- Solving the order-preserving submatrix problem via integer programming
Cited in
(2)
This page was built for publication: Mining order-preserving submatrices from probabilistic matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943568)