Geometric medians (Q1201233): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A generalization of Caratheodory's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of triangles covering the center of an \(n\)-set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convex layers of a planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On <i>k</i>-Hulls and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Arrangements of Lines and Hyperplanes with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a triangle counting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ultimate Planar Convex Hull Algorithm? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a notion of data depth based on random simplices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex hulls of finite sets of points in two and three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur L'enveloppe convexe des nuages de points aleatoires dans <i>R<sup>n</sup></i>. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten / rank
 
Normal rank

Revision as of 12:03, 17 May 2024

scientific article
Language Label Description Also known as
English
Geometric medians
scientific article

    Statements

    Geometric medians (English)
    0 references
    0 references
    0 references
    0 references
    17 January 1993
    0 references
    The authors investigate measures that state how deep a point of a finite set \(S\subset\mathbb{R}^ d\) stick inside the set. A point of \(S\) is called median if there is no deeper point in \(S\). For \(d>1\) the peel depth, the tukey depth, the simplicial depth and the box depth are quite different while the definitions coincide for \(d=1\). Only peel depth and simplicial depth are invariant under linear transformations. Furthermore are considered: the range of variation of the depth of each median, the so called breakdown point in each case of the medians, an \(O(n^ d)\)-time algorithm to compute the simplicial median for \(d=2\) and \(d=3\). The paper finishes with a number of problems.
    0 references
    point depth
    0 references
    sorting
    0 references
    median
    0 references
    0 references

    Identifiers