Integer Programming of Biclustering Based on Graph Models

DOI10.1007/978-0-387-89496-6_23MaRDI QIDQ3059306zbMATH OpenOpenAlexFDO

Authors Neng Fan, Altannar Chinchuluun, Panos M. Pardalos

Publication date 8 December 2010

Published in Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-0-387-89496-6_23

zbMATH Keywords

biclusteringgraph partitioningminmax cutnormalized cutratio cutspectral clustering

Mathematics Subject Classification ID

Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• Integer programming models for detecting graph bipartitions with structural requirements
• Approximation Algorithms for Biclustering Problems
• The biclique k-clustering problem in bipartite graphs and its application in bioinformatics
• Clustering minimum biclique completion of a bipartite graph
• Complete mixed integer linear programming formulations for modularity density based clustering
• A novel mixed integer linear programming model for clustering relational networks
• A biclustering approach based on factor graphs and the max-sum algorithm

Cited in

(6)

• Linear and quadratic programming approaches for the general graph partitioning problem
• A biclustering approach based on factor graphs and the max-sum algorithm
• Bi-objective optimization of biclustering with binary data
• The biclique k-clustering problem in bipartite graphs and its application in bioinformatics
• Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs
• Finding checkerboard patterns via fractional 0-1 programming

This page was built for publication: Integer Programming of Biclustering Based on Graph Models

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