IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i19p3710-d938090.html
   My bibliography  Save this article

Entropy-Randomized Clustering

Author

Listed:
  • Yuri S. Popkov

    (Federal Research Center “Computer Science and Control” of Russian Academy of Sciences, 119333 Moscow, Russia)

  • Yuri A. Dubnov

    (Federal Research Center “Computer Science and Control” of Russian Academy of Sciences, 119333 Moscow, Russia)

  • Alexey Yu. Popkov

    (Federal Research Center “Computer Science and Control” of Russian Academy of Sciences, 119333 Moscow, Russia)

Abstract

This paper proposes a clustering method based on a randomized representation of an ensemble of possible clusters with a probability distribution. The concept of a cluster indicator is introduced as the average distance between the objects included in the cluster. The indicators averaged over the entire ensemble are considered the latter’s characteristics. The optimal distribution of clusters is determined using the randomized machine learning approach: an entropy functional is maximized with respect to the probability distribution subject to constraints imposed on the averaged indicator of the cluster ensemble. The resulting entropy-optimal cluster corresponds to the maximum of the optimal probability distribution. This method is developed for binary clustering as a basic procedure. Its extension to t -ary clustering is considered. Some illustrative examples of entropy-randomized clustering are given.

Suggested Citation

  • Yuri S. Popkov & Yuri A. Dubnov & Alexey Yu. Popkov, 2022. "Entropy-Randomized Clustering," Mathematics, MDPI, vol. 10(19), pages 1-15, October.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:19:p:3710-:d:938090
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/19/3710/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/19/3710/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:10:y:2022:i:19:p:3710-:d:938090. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.