IDEAS home Printed from https://ideas.repec.org/a/taf/jnlasa/v119y2024i546p1374-1384.html
   My bibliography  Save this article

Cohesion and Repulsion in Bayesian Distance Clustering

Author

Listed:
  • Abhinav Natarajan
  • Maria De Iorio
  • Andreas Heinecke
  • Emanuel Mayer
  • Simon Glenn

Abstract

Clustering in high-dimensions poses many statistical challenges. While traditional distance-based clustering methods are computationally feasible, they lack probabilistic interpretation and rely on heuristics for estimation of the number of clusters. On the other hand, probabilistic model-based clustering techniques often fail to scale and devising algorithms that are able to effectively explore the posterior space is an open problem. Based on recent developments in Bayesian distance-based clustering, we propose a hybrid solution that entails defining a likelihood on pairwise distances between observations. The novelty of the approach consists in including both cohesion and repulsion terms in the likelihood, which allows for cluster identifiability. This implies that clusters are composed of objects which have small dissimilarities among themselves (cohesion) and similar dissimilarities to observations in other clusters (repulsion). We show how this modeling strategy has interesting connection with existing proposals in the literature. The proposed method is computationally efficient and applicable to a wide variety of scenarios. We demonstrate the approach in simulation and an application in digital numismatics. Supplementary Material with code is available online.

Suggested Citation

  • Abhinav Natarajan & Maria De Iorio & Andreas Heinecke & Emanuel Mayer & Simon Glenn, 2024. "Cohesion and Repulsion in Bayesian Distance Clustering," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 119(546), pages 1374-1384, April.
  • Handle: RePEc:taf:jnlasa:v:119:y:2024:i:546:p:1374-1384
    DOI: 10.1080/01621459.2023.2191821
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01621459.2023.2191821
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01621459.2023.2191821?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:jnlasa:v:119:y:2024:i:546:p:1374-1384. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/UASA20 .

    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.