@inbook{a6c22a3ccc1e4ca387c5875f6609b504,
title = "Integer programming of biclustering based on graph models",
abstract = "In this chapter, biclustering is studied in a mathematical prospective, including bipartite graphs and optimization models via integer programming. A correspondence between biclustering and graph partitioning is established. In the optimization models, different cuts are used and the integer programming models are presented. We prove that the spectral biclustering for Ratio cut and Normalized cut are the relaxation forms of these integer programming models, and also the Minmax cut for biclustering is equivalent to Normalized cut for biclustering.",
keywords = "Biclustering, Graph partitioning, Integer programming, Minmax cut, Normalized cut, Ratio cut, Spectral clustering",
author = "Neng Fan and Altannar Chinchuluun and Pardalos, {Panos M.}",
note = "Publisher Copyright: {\textcopyright} Springer Science+Business Media, LLC 2010.",
year = "2010",
doi = "10.1007/978-0-387-89496-6_23",
language = "English (US)",
series = "Springer Optimization and Its Applications",
publisher = "Springer International Publishing",
pages = "479--498",
booktitle = "Springer Optimization and Its Applications",
}