A network flow model for biclustering via optimal re-ordering of data matrices
From MaRDI portal
Publication:989888
DOI10.1007/s10898-008-9349-zzbMath1200.90030MaRDI QIDQ989888
Joshua D. Rabinowitz, Xiao-Jiang Feng, Scott R. McAllister, Christodoulos A. Floudas, Peter A. jun. DiMaggio, Herschel Rabitz
Publication date: 23 August 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9349-z
Related Items
Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem, Comments on: Optimization and data mining in biomedicine
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Experiments in projection and clustering by simulated annealing
- Splitting an ordering into a partition to minimize diameter
- Prediction of oligopeptide conformations via deterministic global optimization
- Ab initio tertiary structure prediction of proteins
- A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning
- Feature selection for consistent biclustering via fractional 0-1 programming
- Some Simple Applications of the Travelling Salesman Problem
- Technical Note—Clustering a Data Array and the Traveling-Salesman Problem
- Information-based clustering
- An optimization-based approach for data classification