IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v23y2012i2d10.1007_s10878-010-9351-5.html
   My bibliography  Save this article

Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs

Author

Listed:
  • Neng Fan

    (University of Florida)

  • Panos M. Pardalos

    (University of Florida)

Abstract

In this paper, we consider the multi-way clustering problem based on graph partitioning models by the Ratio cut and Normalized cut. We formulate the problem using new quadratic models. Spectral relaxations, new semidefinite programming relaxations and linearization techniques are used to solve these problems. It has been shown that our proposed methods can obtain improved solutions. We also adapt our proposed techniques to the bipartite graph partitioning problem for biclustering.

Suggested Citation

  • Neng Fan & Panos M. Pardalos, 2012. "Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs," Journal of Combinatorial Optimization, Springer, vol. 23(2), pages 224-251, February.
    • Handle: RePEc:spr:jcomop:v:23:y:2012:i:2:d:10.1007_s10878-010-9351-5
    DOI: 10.1007/s10878-010-9351-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-010-9351-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-010-9351-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Neng Fan & Panos Pardalos, 2010. "Linear and quadratic programming approaches for the general graph partitioning problem," Journal of Global Optimization, Springer, vol. 48(1), pages 57-71, September.
    2. William W. Hager & Yaroslav Krylyuk, 2002. "Multiset graph partitioning," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 55(1), pages 1-10, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Diego Recalde & Ramiro Torres & Polo Vaca, 2020. "An exact approach for the multi-constraint graph partitioning problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 289-308, October.
    2. Eduardo Queiroga & Anand Subramanian & Rosa Figueiredo & Yuri Frota, 2021. "Integer programming formulations and efficient local search for relaxed correlation clustering," Journal of Global Optimization, Springer, vol. 81(4), pages 919-966, December.
    3. Sonia Cafieri & Alberto Costa & Pierre Hansen, 2014. "Reformulation of a model for hierarchical divisive graph modularity maximization," Annals of Operations Research, Springer, vol. 222(1), pages 213-226, November.
    4. Angelika Wiegele & Shudian Zhao, 2022. "SDP-based bounds for graph partition via extended ADMM," Computational Optimization and Applications, Springer, vol. 82(1), pages 251-291, May.
    5. Colombo, Fabio & Cordone, Roberto & Trubian, Marco, 2014. "Column-generation based bounds for the Homogeneous Areas Problem," European Journal of Operational Research, Elsevier, vol. 236(2), pages 695-705.
    6. Neng Fan & Panos Pardalos, 2010. "Linear and quadratic programming approaches for the general graph partitioning problem," Journal of Global Optimization, Springer, vol. 48(1), pages 57-71, September.
    7. Zhengxi Yang & Zhipeng Jiang & Wenguo Yang & Suixiang Gao, 2023. "Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-17, July.

    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:jcomop:v:23:y:2012:i:2:d:10.1007_s10878-010-9351-5. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.