IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v58y2014i3p439-464.html
   My bibliography  Save this article

A continuous characterization of the maximum-edge biclique problem

Author

Listed:
  • Nicolas Gillis
  • François Glineur

Abstract

The problem of finding large complete subgraphs in bipartite graphs (that is, bicliques) is a well-known combinatorial optimization problem referred to as the maximum-edge biclique problem (MBP), and has many applications, e.g., in web community discovery, biological data analysis and text mining. In this paper, we present a new continuous characterization for MBP. Given a bipartite graph $$G$$ , we are able to formulate a continuous optimization problem (namely, an approximate rank-one matrix factorization problem with nonnegativity constraints, R1N for short), and show that there is a one-to-one correspondence between (1) the maximum (i.e., the largest) bicliques of $$G$$ and the global minima of R1N, and (2) the maximal bicliques of $$G$$ (i.e., bicliques not contained in any larger biclique) and the local minima of R1N. We also show that any stationary points of R1N must be close to a biclique of $$G$$ . This allows us to design a new type of biclique finding algorithm based on the application of a block-coordinate descent scheme to R1N. We show that this algorithm, whose algorithmic complexity per iteration is proportional to the number of edges in the graph, is guaranteed to converge to a biclique and that it performs competitively with existing methods on random graphs and text mining datasets. Finally, we show how R1N is closely related to the Motzkin–Strauss formalism for cliques. Copyright Springer Science+Business Media New York 2014

Suggested Citation

  • Nicolas Gillis & François Glineur, 2014. "A continuous characterization of the maximum-edge biclique problem," Journal of Global Optimization, Springer, vol. 58(3), pages 439-464, March.
  • Handle: RePEc:spr:jglopt:v:58:y:2014:i:3:p:439-464
    DOI: 10.1007/s10898-013-0053-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-013-0053-2
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10898-013-0053-2?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 look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. GILLIS, Nicolas & GLINEUR, François, 2008. "Nonnegative factorization and the maximum edge biclique problem," LIDAM Discussion Papers CORE 2008064, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Peeters, M.J.P., 2003. "The maximum edge biclique problem is NP-complete," Other publications TiSEM 3e340431-37b3-4bc5-9b14-9, Tilburg University, School of Economics and Management.
    3. Luana E. Gibbons & Donald W. Hearn & Panos M. Pardalos & Motakuri V. Ramana, 1997. "Continuous Characterizations of the Maximum Clique Problem," Mathematics of Operations Research, INFORMS, vol. 22(3), pages 754-768, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Melisew Tefera Belachew & Nicolas Gillis, 2017. "Solving the Maximum Clique Problem with Symmetric Rank-One Non-negative Matrix Approximation," Journal of Optimization Theory and Applications, Springer, vol. 173(1), pages 279-296, April.

    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. GILLIS, Nicolas & GLINEUR, François, 2010. "On the geometric interpretation of the nonnegative rank," LIDAM Discussion Papers CORE 2010051, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. GILLIS, Nicolas & GLINEUR, François, 2010. "Low-rank matrix approximation with weights or missing data is NP-hard," LIDAM Discussion Papers CORE 2010075, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. Qingsong Tang & Yuejian Peng & Xiangde Zhang & Cheng Zhao, 2014. "On Graph-Lagrangians of Hypergraphs Containing Dense Subgraphs," Journal of Optimization Theory and Applications, Springer, vol. 163(1), pages 31-56, October.
    4. Yuejian Peng & Qingsong Tang & Cheng Zhao, 2015. "On Lagrangians of r-uniform hypergraphs," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 812-825, October.
    5. Takehiro Sano & Tsuyoshi Migita & Norikazu Takahashi, 2022. "A novel update rule of HALS algorithm for nonnegative matrix factorization and Zangwill’s global convergence," Journal of Global Optimization, Springer, vol. 84(3), pages 755-781, November.
    6. Sumit Kunnumkal & Kalyan Talluri, 2019. "Choice Network Revenue Management Based on New Tractable Approximations," Transportation Science, INFORMS, vol. 53(6), pages 1591-1608, November.
    7. GILLIS, Nicolas & GLINEUR, François, 2011. "Accelerated multiplicative updates and hierarchical als algorithms for nonnegative matrix factorization," LIDAM Discussion Papers CORE 2011030, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. Qingsong Tang & Yuejian Peng & Xiangde Zhang & Cheng Zhao, 2017. "On Motzkin–Straus type results for non-uniform hypergraphs," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 504-521, August.
    9. Immanuel M. Bomze & Michael Kahr & Markus Leitner, 2021. "Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 301-316, February.
    10. Alejandra Casado & Sergio Pérez-Peló & Jesús Sánchez-Oro & Abraham Duarte, 2022. "A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem," Journal of Heuristics, Springer, vol. 28(1), pages 121-146, February.
    11. Yanming Chang & Yuejian Peng & Yuping Yao, 2016. "Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 881-892, February.
    12. Vargas, Luis Felipe & Laurent, Monique, 2023. "Copositive matrices, sums of squares and the stability number of a graph," Other publications TiSEM 8e471691-a452-4ee5-9f88-8, Tilburg University, School of Economics and Management.
    13. Derval, Guillaume & Schaus, Pierre, 2022. "Maximal-Sum submatrix search using a hybrid contraint programming/linear programming approach," European Journal of Operational Research, Elsevier, vol. 297(3), pages 853-865.
    14. GILLIS, Nicolas & GLINEUR, François, 2008. "Nonnegative factorization and the maximum edge biclique problem," LIDAM Discussion Papers CORE 2008064, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    15. Qingsong Tang & Xiangde Zhang & Guoren Wang & Cheng Zhao, 2018. "A continuous characterization of the maximum vertex-weighted clique in hypergraphs," Journal of Combinatorial Optimization, Springer, vol. 35(4), pages 1250-1260, May.
    16. Jingu Kim & Yunlong He & Haesun Park, 2014. "Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework," Journal of Global Optimization, Springer, vol. 58(2), pages 285-319, February.
    17. Aaditya V Rangan & Caroline C McGrouther & John Kelsoe & Nicholas Schork & Eli Stahl & Qian Zhu & Arjun Krishnan & Vicky Yao & Olga Troyanskaya & Seda Bilaloglu & Preeti Raghavan & Sarah Bergen & Ande, 2018. "A loop-counting method for covariate-corrected low-rank biclustering of gene-expression and genome-wide association study data," PLOS Computational Biology, Public Library of Science, vol. 14(5), pages 1-29, May.
    18. Qingsong Tang & Xiangde Zhang & Cheng Zhao & Peng Zhao, 2022. "On the maxima of motzkin-straus programs and cliques of graphs," Journal of Global Optimization, Springer, vol. 84(4), pages 989-1003, December.
    19. Sumit Kunnumkal & Kalyan Talluri, 2012. "A New Compact Linear Programming Formulation for Choice Network Revenue Management," Working Papers 677, Barcelona School of Economics.
    20. Sumit Kunnumkal & Kalyan Talluri, 2012. "A new compact linear programming formulation for choice network revenue management," Economics Working Papers 1349, Department of Economics and Business, Universitat Pompeu Fabra.

    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:jglopt:v:58:y:2014:i:3:p:439-464. 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.