Recovering all generalized order-preserving submatrices: new exact formulations and algorithms

DOI10.1007/S10479-016-2173-9MaRDI QIDQ1639243zbMATH OpenOpenAlexFDO

Authors Y. Aharonov

Publication date 12 June 2018

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-016-2173-9

zbMATH Keywords

biclusteringdata mininginteger programmingorder-preserving submatrix

Mathematics Subject Classification ID

Integer programming (90C10) Applications of mathematical programming (90C90)

Recommendations

• Solving the order-preserving submatrix problem via integer programming
• Approximation algorithms for a minimization variant of the order-preserving submatrices and for biclustering problems
• Mining order-preserving submatrices from probabilistic matrices
• Computing and Combinatorics
• Algorithmic and complexity issues of three clustering methods in microarray data analysis

Cites work

• Approximation algorithms for a minimization variant of the order-preserving submatrices and for biclustering problems
• Biclustering in data mining
• Mining order-preserving submatrices from probabilistic matrices
• Solving the order-preserving submatrix problem via integer programming

Cited in

(4)

• Developing \texttt{Biceps} to completely compute in subquadratic time a new generic type of bicluster in dense and sparse matrices
• Solving the order-preserving submatrix problem via integer programming
• Approximation algorithms for a minimization variant of the order-preserving submatrices and for biclustering problems
• Mining order-preserving submatrices from probabilistic matrices

Describes a project that uses

Uses Software

• CPLEX
• KiWi

This page was built for publication: Recovering all generalized order-preserving submatrices: new exact formulations and algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1639243)