Integer programming of biclustering based on graph models

Neng Fan, Altannar Chinchuluun, Panos M. Pardalos

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationSpringer Optimization and Its Applications
PublisherSpringer International Publishing
Pages479-498
Number of pages20
Volume39
DOIs
StatePublished - 2010
Externally publishedYes

Publication series

NameSpringer Optimization and Its Applications
Volume39
ISSN (Print)19316828
ISSN (Electronic)19316836

Keywords

  • Biclustering
  • Graph partitioning
  • Integer programming
  • Minmax cut
  • Normalized cut
  • Ratio cut
  • Spectral clustering

ASJC Scopus subject areas

  • Control and Optimization

Fingerprint Dive into the research topics of 'Integer programming of biclustering based on graph models'. Together they form a unique fingerprint.

Cite this