All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Approximate computation of projection depths

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10434777" target="_blank" >RIV/00216208:11320/21:10434777 - isvavai.cz</a>

  • Result on the web

    <a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=G_U9W1Dx3Y" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=G_U9W1Dx3Y</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.csda.2020.107166" target="_blank" >10.1016/j.csda.2020.107166</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Approximate computation of projection depths

  • Original language description

    Data depth is a concept in multivariate statistics that measures the centrality of a point in a given data cloud in R-d. If the depth of a point can be represented as the minimum of the depths with respect to all one-dimensional projections of the data, then the depth satisfies the so-called projection property. Such depths form an important class that includes many of the depths that have been proposed in literature. For depths that satisfy the projection property an approximate algorithm can easily be constructed since taking the minimum of the depths with respect to only a finite number of one-dimensional projections yields an upper bound for the depth with respect to the multivariate data. Such an algorithm is particularly useful if no exact algorithm exists or if the exact algorithm has a high computational complexity, as is the case with the halfspace depth or the projection depth. To compute these depths in high dimensions, the use of an approximate algorithm with better complexity is surely preferable. Instead of focusing on a single method we provide a comprehensive and fair comparison of several methods, both already described in the literature and original. (C) 2021 Elsevier B.V. All rights reserved.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10103 - Statistics and probability

Result continuities

  • Project

    <a href="/en/project/GJ19-16097Y" target="_blank" >GJ19-16097Y: Geometric aspects of mathematical statistics</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2021

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Computational Statistics and Data Analysis

  • ISSN

    0167-9473

  • e-ISSN

  • Volume of the periodical

    157

  • Issue of the periodical within the volume

    January

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    23

  • Pages from-to

    107166

  • UT code for WoS article

    000620292000003

  • EID of the result in the Scopus database

    2-s2.0-85099698819