Integer Programming of Biclustering Based on Graph Models

Neng Fan (), Altannar Chinchuluun () and Panos M. Pardalos ()
Additional contact information
Neng Fan: University of Florida
Altannar Chinchuluun: Imperial College London
Panos M. Pardalos: University of Florida

A chapter in Optimization and Optimal Control, 2010, pp 479-498 from Springer

Abstract: Summary 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; integer programming; spectral clustering; graph partitioning; ratio cut; normalized cut; minmax cut (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-89496-6_23

Ordering information: This item can be ordered from
http://www.springer.com/9780387894966

DOI: 10.1007/978-0-387-89496-6_23

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().