Mining order-preserving submatrices from probabilistic matrices
From MaRDI portal
Publication:2943568
DOI10.1145/2533712zbMATH Open1321.68244OpenAlexW1967025868MaRDI QIDQ2943568FDOQ2943568
Authors: Qiong Fang, Wilfred Ng, Jianlin Feng, Yuliang Li 
Publication date: 3 September 2015
Published in: ACM Transactions on Database Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2533712
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
Learning and adaptive systems in artificial intelligence (68T05) Stochastic matrices (15B51) Database theory (68P15)
Cites Work
- A generalized maximum entropy approach to Bregman co-clustering and matrix approximation
- An introduction to order statistics
- Title not available (Why is that?)
- 10.1162/153244303322753661
- 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
- Erratum
Cited In (2)
Uses Software
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)
