IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v40y2025i1d10.1007_s00180-024-01500-6.html
   My bibliography  Save this article

Exact and approximate computation of the scatter halfspace depth

Author

Listed:
  • Xiaohui Liu

    (Jiangxi University of Finance and Economics)

  • Yuzi Liu

    (Jiangxi University of Finance and Economics)

  • Petra Laketa

    (Charles University)

  • Stanislav Nagy

    (Charles University)

  • Yuting Chen

    (University of Maryland)

Abstract

The scatter halfspace depth (sHD) is an extension of the location halfspace (also called Tukey) depth that is applicable in the nonparametric analysis of scatter. Using sHD, it is possible to define minimax optimal robust scatter estimators for multivariate data. The problem of exact computation of sHD for data of dimension $$d \ge 2$$ d ≥ 2 has, however, not been addressed in the literature. We develop an exact algorithm for the computation of sHD in any dimension d and implement it efficiently for any dimension $$d \ge 1$$ d ≥ 1 . Since the exact computation of sHD is slow especially for higher dimensions, we also propose two fast approximate algorithms. All our programs are freely available in the R package scatterdepth.

Suggested Citation

  • Xiaohui Liu & Yuzi Liu & Petra Laketa & Stanislav Nagy & Yuting Chen, 2025. "Exact and approximate computation of the scatter halfspace depth," Computational Statistics, Springer, vol. 40(1), pages 547-572, January.
    • Handle: RePEc:spr:compst:v:40:y:2025:i:1:d:10.1007_s00180-024-01500-6
    DOI: 10.1007/s00180-024-01500-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-024-01500-6
    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/s00180-024-01500-6?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:compst:v:40:y:2025:i:1:d:10.1007_s00180-024-01500-6. 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.