IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-0-387-89496-6_23.html
   My bibliography  Save this book chapter

Integer Programming of Biclustering Based on Graph Models

In: Optimization and Optimal Control

Author

Listed:
  • Neng Fan

    (University of Florida)

  • Altannar Chinchuluun

    (Imperial College London)

  • Panos M. Pardalos

    (University of Florida)

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.

Suggested Citation

  • Neng Fan & Altannar Chinchuluun & Panos M. Pardalos, 2010. "Integer Programming of Biclustering Based on Graph Models," Springer Optimization and Its Applications, in: Altannar Chinchuluun & Panos M. Pardalos & Rentsen Enkhbat & Ider Tseveendorj (ed.), Optimization and Optimal Control, pages 479-498, Springer.
    • Handle: RePEc:spr:spochp:978-0-387-89496-6_23
    DOI: 10.1007/978-0-387-89496-6_23
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-0-387-89496-6_23. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.