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

DOI10.1007/S10479-016-2173-9zbMath1390.90400OpenAlexW2307258710MaRDI QIDQ1639243

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

integer programmingdata miningbiclusteringorder-preserving submatrix

Mathematics Subject Classification ID

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

Related Items (1)

Developing \texttt{Biceps} to completely compute in subquadratic time a new generic type of bicluster in dense and sparse matrices

Uses Software

• CPLEX
• KiWi

Cites Work

• Biclustering in data mining
• 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

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