IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v89y2024i4d10.1007_s10898-024-01374-4.html
   My bibliography  Save this article

Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering

Author

Listed:
  • Maolin Che

    (Southwestern University of Finance and Economics
    Center for Intelligent Multidimensional Data Analysis, Hong Kong Science Park)

  • Yimin Wei

    (Fudan University)

  • Hong Yan

    (City University of Hong Kong)

Abstract

Nonnegative tensor factorizations (NTF) have applications in statistics, computer vision, exploratory multi-way data analysis, and blind source separation. This paper studies randomized multiplicative updating algorithms for symmetric NTF via random projections and random samplings. For random projections, we consider two methods to generate the random matrix and analyze the computational complexity, while for random samplings the uniform sampling strategy and its variants are examined. The mixing of these two strategies is then considered. Some theoretical results are presented based on the bounds of the singular values of sub-Gaussian matrices and the fact that randomly sampling rows from an orthogonal matrix results in a well-conditioned matrix. These algorithms are easy to implement, and their efficiency is verified via test tensors from both synthetic and real datasets, such as for clustering facial images.

Suggested Citation

  • Maolin Che & Yimin Wei & Hong Yan, 2024. "Sketch-based multiplicative updating algorithms for symmetric nonnegative tensor factorizations with applications to face image clustering," Journal of Global Optimization, Springer, vol. 89(4), pages 995-1032, August.
    • Handle: RePEc:spr:jglopt:v:89:y:2024:i:4:d:10.1007_s10898-024-01374-4
    DOI: 10.1007/s10898-024-01374-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-024-01374-4
    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/s10898-024-01374-4?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.

    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:89:y:2024:i:4:d:10.1007_s10898-024-01374-4. 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.